An Automated Method for Identifying Inconsistencies within Diagrammatic Software Requirements Specifications

NASA Technical Reports Server (NTRS)

Zhang, Zhong

1997-01-01

The development of large-scale, composite software in a geographically distributed environment is an evolutionary process. Often, in such evolving systems, striving for consistency is complicated by many factors, because development participants have various locations, skills, responsibilities, roles, opinions, languages, terminology and different degrees of abstraction they employ. This naturally leads to many partial specifications or viewpoints. These multiple views on the system being developed usually overlap. From another aspect, these multiple views give rise to the potential for inconsistency. Existing CASE tools do not efficiently manage inconsistencies in distributed development environment for a large-scale project. Based on the ViewPoints framework the WHERE (Web-Based Hypertext Environment for requirements Evolution) toolkit aims to tackle inconsistency management issues within geographically distributed software development projects. Consequently, WHERE project helps make more robust software and support software assurance process. The long term goal of WHERE tools aims to the inconsistency analysis and management in requirements specifications. A framework based on Graph Grammar theory and TCMJAVA toolkit is proposed to detect inconsistencies among viewpoints. This systematic approach uses three basic operations (UNION, DIFFERENCE, INTERSECTION) to study the static behaviors of graphic and tabular notations. From these operations, subgraphs Query, Selection, Merge, Replacement operations can be derived. This approach uses graph PRODUCTIONS (rewriting rules) to study the dynamic transformations of graphs. We discuss the feasibility of implementation these operations. Also, We present the process of porting original TCM (Toolkit for Conceptual Modeling) project from C++ to Java programming language in this thesis. A scenario based on NASA International Space Station Specification is discussed to show the applicability of our approach. Finally, conclusion and future work about inconsistency management issues in WHERE project will be summarized.

Analytical learning and term-rewriting systems

NASA Technical Reports Server (NTRS)

Laird, Philip; Gamble, Evan

1990-01-01

Analytical learning is a set of machine learning techniques for revising the representation of a theory based on a small set of examples of that theory. When the representation of the theory is correct and complete but perhaps inefficient, an important objective of such analysis is to improve the computational efficiency of the representation. Several algorithms with this purpose have been suggested, most of which are closely tied to a first order logical language and are variants of goal regression, such as the familiar explanation based generalization (EBG) procedure. But because predicate calculus is a poor representation for some domains, these learning algorithms are extended to apply to other computational models. It is shown that the goal regression technique applies to a large family of programming languages, all based on a kind of term rewriting system. Included in this family are three language families of importance to artificial intelligence: logic programming, such as Prolog; lambda calculus, such as LISP; and combinatorial based languages, such as FP. A new analytical learning algorithm, AL-2, is exhibited that learns from success but is otherwise quite different from EBG. These results suggest that term rewriting systems are a good framework for analytical learning research in general, and that further research should be directed toward developing new techniques.

Knowledge-based understanding of aerial surveillance video

NASA Astrophysics Data System (ADS)

Cheng, Hui; Butler, Darren

2006-05-01

Aerial surveillance has long been used by the military to locate, monitor and track the enemy. Recently, its scope has expanded to include law enforcement activities, disaster management and commercial applications. With the ever-growing amount of aerial surveillance video acquired daily, there is an urgent need for extracting actionable intelligence in a timely manner. Furthermore, to support high-level video understanding, this analysis needs to go beyond current approaches and consider the relationships, motivations and intentions of the objects in the scene. In this paper we propose a system for interpreting aerial surveillance videos that automatically generates a succinct but meaningful description of the observed regions, objects and events. For a given video, the semantics of important regions and objects, and the relationships between them, are summarised into a semantic concept graph. From this, a textual description is derived that provides new search and indexing options for aerial video and enables the fusion of aerial video with other information modalities, such as human intelligence, reports and signal intelligence. Using a Mixture-of-Experts video segmentation algorithm an aerial video is first decomposed into regions and objects with predefined semantic meanings. The objects are then tracked and coerced into a semantic concept graph and the graph is summarized spatially, temporally and semantically using ontology guided sub-graph matching and re-writing. The system exploits domain specific knowledge and uses a reasoning engine to verify and correct the classes, identities and semantic relationships between the objects. This approach is advantageous because misclassifications lead to knowledge contradictions and hence they can be easily detected and intelligently corrected. In addition, the graph representation highlights events and anomalies that a low-level analysis would overlook.

An Algebraic Approach to the Study and Optimization of the Set of Rules of a Conditional Rewrite System

NASA Astrophysics Data System (ADS)

Makhortov, S. D.

2018-03-01

An algebraic system containing the semantics of a set of rules of the conditional equational theory (or the conditional term rewriting system) is introduced. The following basic questions are considered for the given model: existence of logical closure, structure of logical closure, possibility of equivalent transformations, and construction of logical reduction. The obtained results can be applied to the analysis and automatic optimization of the corresponding set of rules. The basis for the given research is the theory of lattices and binary relations.

Rewriting Modulo SMT and Open System Analysis

NASA Technical Reports Server (NTRS)

Rocha, Camilo; Meseguer, Jose; Munoz, Cesar

2014-01-01

This paper proposes rewriting modulo SMT, a new technique that combines the power of SMT solving, rewriting modulo theories, and model checking. Rewriting modulo SMT is ideally suited to model and analyze infinite-state open systems, i.e., systems that interact with a non-deterministic environment. Such systems exhibit both internal non-determinism, which is proper to the system, and external non-determinism, which is due to the environment. In a reflective formalism, such as rewriting logic, rewriting modulo SMT can be reduced to standard rewriting. Hence, rewriting modulo SMT naturally extends rewriting-based reachability analysis techniques, which are available for closed systems, to open systems. The proposed technique is illustrated with the formal analysis of: (i) a real-time system that is beyond the scope of timed-automata methods and (ii) automatic detection of reachability violations in a synchronous language developed to support autonomous spacecraft operations.

From free fields to AdS space. II

NASA Astrophysics Data System (ADS)

Gopakumar, Rajesh

2004-07-01

We continue with the program of paper I [Phys. Rev. D 70, 025009 (2004)] to implement open-closed string duality on free gauge field theory (in the large-N limit). In this paper we consider correlators such as <∏ni=1TrΦJi(xi)>. The Schwinger parametrization of this n-point function exhibits a partial gluing up into a set of basic skeleton graphs. We argue that the moduli space of the planar skeleton graphs is exactly the same as the moduli space of genus zero Riemann surfaces with n holes. In other words, we can explicitly rewrite the n-point (planar) free-field correlator as an integral over the moduli space of a sphere with n holes. A preliminary study of the integrand also indicates compatibility with a string theory on AdS space. The details of our argument are quite insensitive to the specific form of the operators and generalize to diagrams of a higher genus as well. We take this as evidence of the field theory’s ability to reorganize itself into a string theory.

Values Education through Aggadic Stories: The Didactic Rewriter as Interpreter

ERIC Educational Resources Information Center

Weinstein, Sara

2016-01-01

Didactic rewrites of aggadic stories are an important resource in values education. This study, geared primarily toward teachers involved in choosing curricular materials, investigates how the didactic rewriter actually becomes an interpreter, rather than a mere transmitter, of the original text. The personal values of the rewriters can influence…

A new order-theoretic characterisation of the polytime computable functions☆

PubMed Central

Avanzini, Martin; Eguchi, Naohi; Moser, Georg

2015-01-01

We propose a new order-theoretic characterisation of the class of polytime computable functions. To this avail we define the small polynomial path order (sPOP⁎ for short). This termination order entails a new syntactic method to analyse the innermost runtime complexity of term rewrite systems fully automatically: for any rewrite system compatible with sPOP⁎ that employs recursion up to depth d, the (innermost) runtime complexity is polynomially bounded of degree d. This bound is tight. Thus we obtain a direct correspondence between a syntactic (and easily verifiable) condition of a program and the asymptotic worst-case complexity of the program. PMID:26412933

Hydrochromic molecular switches for water-jet rewritable paper

NASA Astrophysics Data System (ADS)

Sheng, Lan; Li, Minjie; Zhu, Shaoyin; Li, Hao; Xi, Guan; Li, Yong-Gang; Wang, Yi; Li, Quanshun; Liang, Shaojun; Zhong, Ke; Zhang, Sean Xiao-An

2014-01-01

The days of rewritable paper are coming, printers of the future will use water-jet paper. Although several kinds of rewritable paper have been reported, practical usage of them is rare. Herein, a new rewritable paper for ink-free printing is proposed and demonstrated successfully by using water as the sole trigger to switch hydrochromic dyes on solid media. Water-jet prints with various colours are achieved with a commercial desktop printer based on these hydrochromic rewritable papers. The prints can be erased and rewritten dozens of times with no significant loss in colour quality. This rewritable paper is promising in that it can serve an eco-friendly information display to meet the increasing global needs for environmental protection.

Hydrochromic molecular switches for water-jet rewritable paper.

PubMed

Sheng, Lan; Li, Minjie; Zhu, Shaoyin; Li, Hao; Xi, Guan; Li, Yong-Gang; Wang, Yi; Li, Quanshun; Liang, Shaojun; Zhong, Ke; Zhang, Sean Xiao-An

2014-01-01

The days of rewritable paper are coming, printers of the future will use water-jet paper. Although several kinds of rewritable paper have been reported, practical usage of them is rare. Herein, a new rewritable paper for ink-free printing is proposed and demonstrated successfully by using water as the sole trigger to switch hydrochromic dyes on solid media. Water-jet prints with various colours are achieved with a commercial desktop printer based on these hydrochromic rewritable papers. The prints can be erased and rewritten dozens of times with no significant loss in colour quality. This rewritable paper is promising in that it can serve an eco-friendly information display to meet the increasing global needs for environmental protection.

Rewriting in Advanced Composition.

ERIC Educational Resources Information Center

Stone, William B.

A college English instructor made an informal comparison of rewriting habits of students in a freshman composition course and two advanced composition courses. Notes kept on student rewriting focused on this central question: given peer and instructor response to their papers and a choice as to what and how to rewrite, what will students decide to…

Dynamic Querying of Mass-Storage RDF Data with Rule-Based Entailment Regimes

NASA Astrophysics Data System (ADS)

Ianni, Giovambattista; Krennwallner, Thomas; Martello, Alessandra; Polleres, Axel

RDF Schema (RDFS) as a lightweight ontology language is gaining popularity and, consequently, tools for scalable RDFS inference and querying are needed. SPARQL has become recently a W3C standard for querying RDF data, but it mostly provides means for querying simple RDF graphs only, whereas querying with respect to RDFS or other entailment regimes is left outside the current specification. In this paper, we show that SPARQL faces certain unwanted ramifications when querying ontologies in conjunction with RDF datasets that comprise multiple named graphs, and we provide an extension for SPARQL that remedies these effects. Moreover, since RDFS inference has a close relationship with logic rules, we generalize our approach to select a custom ruleset for specifying inferences to be taken into account in a SPARQL query. We show that our extensions are technically feasible by providing benchmark results for RDFS querying in our prototype system GiaBATA, which uses Datalog coupled with a persistent Relational Database as a back-end for implementing SPARQL with dynamic rule-based inference. By employing different optimization techniques like magic set rewriting our system remains competitive with state-of-the-art RDFS querying systems.

Simulation and Verification of Synchronous Set Relations in Rewriting Logic

NASA Technical Reports Server (NTRS)

Rocha, Camilo; Munoz, Cesar A.

2011-01-01

This paper presents a mathematical foundation and a rewriting logic infrastructure for the execution and property veri cation of synchronous set relations. The mathematical foundation is given in the language of abstract set relations. The infrastructure consists of an ordersorted rewrite theory in Maude, a rewriting logic system, that enables the synchronous execution of a set relation provided by the user. By using the infrastructure, existing algorithm veri cation techniques already available in Maude for traditional asynchronous rewriting, such as reachability analysis and model checking, are automatically available to synchronous set rewriting. The use of the infrastructure is illustrated with an executable operational semantics of a simple synchronous language and the veri cation of temporal properties of a synchronous system.

Rewriting Modulo SMT

NASA Technical Reports Server (NTRS)

Rocha, Camilo; Meseguer, Jose; Munoz, Cesar A.

2013-01-01

Combining symbolic techniques such as: (i) SMT solving, (ii) rewriting modulo theories, and (iii) model checking can enable the analysis of infinite-state systems outside the scope of each such technique. This paper proposes rewriting modulo SMT as a new technique combining the powers of (i)-(iii) and ideally suited to model and analyze infinite-state open systems; that is, systems that interact with a non-deterministic environment. Such systems exhibit both internal non-determinism due to the system, and external non-determinism due to the environment. They are not amenable to finite-state model checking analysis because they typically are infinite-state. By being reducible to standard rewriting using reflective techniques, rewriting modulo SMT can both naturally model and analyze open systems without requiring any changes to rewriting-based reachability analysis techniques for closed systems. This is illustrated by the analysis of a real-time system beyond the scope of timed automata methods.

Let the Rewriter Beware.

ERIC Educational Resources Information Center

Charrow, Veda R.

Translating legal and bureaucratic language into plain, comprehensible English is not amenable to simple rules and procedures. Rewriting comprehensibly requires specialized knowledge about language and an awareness of a number of misconceptions and pitfalls. This paper discusses what not to do in rewriting, based upon rewritten documents presently…

75 FR 5241 - General Services Administration Acquisition Regulation; Rewrite of Part 512, Acquisition of...

Federal Register 2010, 2011, 2012, 2013, 2014

2010-02-02

... Acquisition Regulation; Rewrite of Part 512, Acquisition of Commercial Items AGENCIES: Office of Acquisition... Administration (GSA) is amending the General Services Administration Acquisition Regulation (GSAR) to update the text addressing the acquisition of commercial items. This rule is a result of the GSAM Rewrite...

A Ten-Year Reflection

ERIC Educational Resources Information Center

Phillip, Cyndi

2016-01-01

Five initiatives launched during Cyndi Phillip's term as American Association of School Librarians (AASL) President (2006-2007) continue to have an impact on school librarians ten years later. They include the rewriting of AASL's learning standards, introduction of the SKILLS Act, the presentation of the Crystal Apple Award to Scholastic Library…

The diagonalization of cubic matrices

NASA Astrophysics Data System (ADS)

Cocolicchio, D.; Viggiano, M.

2000-08-01

This paper is devoted to analysing the problem of the diagonalization of cubic matrices. We extend the familiar algebraic approach which is based on the Cardano formulae. We rewrite the complex roots of the associated resolvent secular equation in terms of transcendental functions and we derive the diagonalizing matrix.

Setting the Record Straight

ERIC Educational Resources Information Center

Ruffins, Paul

2010-01-01

Native Americans have long struggled to battle Hollywood stereotypes, correct the distorted "official" histories found in textbooks and museums and present their stories on their own terms. It is not surprising that a group of Native American scholars and activists is gearing up for an effort to rewrite their history to clarify the true…

Rewritable phosphorescent paper by the control of competing kinetic and thermodynamic self-assembling events

NASA Astrophysics Data System (ADS)

Kishimura, Akihiro; Yamashita, Takashi; Yamaguchi, Kentaro; Aida, Takuzo

2005-07-01

Security inks have become of increasing importance. They are composed of invisible substances that provide printed images that are not able to be photocopied, and are readable only under special environments. Here we report a novel photoluminescent ink for rewritable media that dichroically emits phosphorescence due to a structural bistability of the self-assembled luminophor. Long-lasting images have been developed by using conventional thermal printers, which are readable only on exposure to ultraviolet light, and more importantly, are thermally erasable for rewriting. Although thermally rewritable printing media have already been developed using visible dyes and cholesteric liquid crystals, security inks that allow rewriting of invisible printed images are unprecedented. We realized this unique feature by the control of kinetic and thermodynamic processes that compete with one another in the self-assembly of the luminophor. This strategy can provide an important step towards the next-generation security technology for information handling.

Mirroring the Object of the Lesson: The Creative Process of Scriptural Rewriting as an Effective Practice for Teaching Sacred Texts

ERIC Educational Resources Information Center

Palmer, Carmen

2018-01-01

This paper introduces Rewritten Scripture and scriptural rewriting as a creative process that, when mirrored in a teaching exercise, may serve as an effective practice in teaching sacred texts. Observing changes made between scripture and its rewriting may allow readers to identify different contexts among these texts. Furthermore, the act of…

Formal logic rewrite system bachelor in teaching mathematical informatics

NASA Astrophysics Data System (ADS)

Habiballa, Hashim; Jendryscik, Radek

2017-07-01

The article presents capabilities of the formal rewrite logic system - Bachelor - for teaching theoretical computer science (mathematical informatics). The system Bachelor enables constructivist approach to teaching and therefore it may enhance the learning process in hard informatics essential disciplines. It brings not only detailed description of formal rewrite process but also it can demonstrate algorithmical principles for logic formulae manipulations.

7 CFR 762.149 - Liquidation.

Code of Federal Regulations, 2012 CFR

2012-01-01

... farmer-creditor mediation program; and (3) Not agree to any proposals to rewrite the terms of a... action will be pursued. If the lender does not pursue the recovery, the reason must be documented when an... recovery value of the security as defined in § 762.102. The appraisal requirement may be waived by the...

7 CFR 762.149 - Liquidation.

Code of Federal Regulations, 2013 CFR

2013-01-01

... farmer-creditor mediation program; and (3) Not agree to any proposals to rewrite the terms of a... action will be pursued. If the lender does not pursue the recovery, the reason must be documented when an... recovery value of the security as defined in § 762.102. The appraisal requirement may be waived by the...

7 CFR 762.149 - Liquidation.

Code of Federal Regulations, 2011 CFR

2011-01-01

... farmer-creditor mediation program; and (3) Not agree to any proposals to rewrite the terms of a... action will be pursued. If the lender does not pursue the recovery, the reason must be documented when an... recovery value of the security as defined in § 762.102. The appraisal requirement may be waived by the...

A Case of You: Remembering David Fowler

ERIC Educational Resources Information Center

Pimm, David

2004-01-01

The author has framed this brief appreciation of David Flower in terms of influence; specifically, his influence as a teacher, both in person and through his writing (most of all his attempted rewriting of much of the history of Greek mathematics). The author will also make some second-order remarks about the influence of teachers.

Specification and Verification of Web Applications in Rewriting Logic

NASA Astrophysics Data System (ADS)

Alpuente, María; Ballis, Demis; Romero, Daniel

This paper presents a Rewriting Logic framework that formalizes the interactions between Web servers and Web browsers through a communicating protocol abstracting HTTP. The proposed framework includes a scripting language that is powerful enough to model the dynamics of complex Web applications by encompassing the main features of the most popular Web scripting languages (e.g. PHP, ASP, Java Servlets). We also provide a detailed characterization of browser actions (e.g. forward/backward navigation, page refresh, and new window/tab openings) via rewrite rules, and show how our models can be naturally model-checked by using the Linear Temporal Logic of Rewriting (LTLR), which is a Linear Temporal Logic specifically designed for model-checking rewrite theories. Our formalization is particularly suitable for verification purposes, since it allows one to perform in-depth analyses of many subtle aspects related to Web interaction. Finally, the framework has been completely implemented in Maude, and we report on some successful experiments that we conducted by using the Maude LTLR model-checker.

Rewriting Logic Semantics of a Plan Execution Language

NASA Technical Reports Server (NTRS)

Dowek, Gilles; Munoz, Cesar A.; Rocha, Camilo

2009-01-01

The Plan Execution Interchange Language (PLEXIL) is a synchronous language developed by NASA to support autonomous spacecraft operations. In this paper, we propose a rewriting logic semantics of PLEXIL in Maude, a high-performance logical engine. The rewriting logic semantics is by itself a formal interpreter of the language and can be used as a semantic benchmark for the implementation of PLEXIL executives. The implementation in Maude has the additional benefit of making available to PLEXIL designers and developers all the formal analysis and verification tools provided by Maude. The formalization of the PLEXIL semantics in rewriting logic poses an interesting challenge due to the synchronous nature of the language and the prioritized rules defining its semantics. To overcome this difficulty, we propose a general procedure for simulating synchronous set relations in rewriting logic that is sound and, for deterministic relations, complete. We also report on the finding of two issues at the design level of the original PLEXIL semantics that were identified with the help of the executable specification in Maude.

Supermanifolds from Feynman graphs

NASA Astrophysics Data System (ADS)

Marcolli, Matilde; Rej, Abhijnan

2008-08-01

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

Termination of String Rewriting Rules that have One Pair of Overlaps

NASA Technical Reports Server (NTRS)

Geser, Alfons; Bushnell, Dennis M. (Technical Monitor)

2002-01-01

This paper presents a partial solution to the long standing open problem of termination of one-rule string rewriting. Overlaps between the two sides of the rule play a central role in existing termination criteria. We characterize termination of all one-rule string rewriting systems that have one such overlap at either end. This both completes a result of Kurth and generalizes a result of Shikishima-Tsuji et al.

TEACHING AND TRAINING WITH MOTION PICTURES (MAGNETIC SOUND).

ERIC Educational Resources Information Center

Bell and Howell Co., Lincolnwood, IL.

THE PREPARATION OF A MAGNETIC-SOUND TRACK FOR 16 MM. MOTION PICTURE FILMS IS DESCRIBED. IN SCRIPT PREPARATION, THE SCRIPT SHOULD BE WRITTEN IN NARRATIVE FORM TO INCLUDE ALL SHOTS NEEDED AND TO SUPPLEMENT AND GIVE INFORMATION NOT IN THE FILM. LANGUAGE SHOULD BE KEPT SIMPLE, AND UNAVOIDABLE TECHNICAL TERMS SHOULD BE EXPLAINED. IN REWRITING THE…

MatchingTools: A Python library for symbolic effective field theory calculations

NASA Astrophysics Data System (ADS)

Criado, Juan C.

2018-06-01

MatchingTools is a Python library for doing symbolic calculations in effective field theory. It provides the tools to construct general models by defining their field content and their interaction Lagrangian. Once a model is given, the heavy particles can be integrated out at the tree level to obtain an effective Lagrangian in which only the light particles appear. After integration, some of the terms of the resulting Lagrangian might not be independent. MatchingTools contains functions for transforming these terms to rewrite them in terms of any chosen set of operators.

GeoSciGraph: An Ontological Framework for EarthCube Semantic Infrastructure

NASA Astrophysics Data System (ADS)

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

2015-12-01

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

Match-bounded String Rewriting Systems

NASA Technical Reports Server (NTRS)

Geser, Alfons; Hofbauer, Dieter; Waldmann, Johannes

2003-01-01

We introduce a new class of automated proof methods for the termination of rewriting systems on strings. The basis of all these methods is to show that rewriting preserves regular languages. To this end, letters are annotated with natural numbers, called match heights. If the minimal height of all positions in a redex is h+1 then every position in the reduct will get height h+1. In a match-bounded system, match heights are globally bounded. Using recent results on deleting systems, we prove that rewriting by a match-bounded system preserves regular languages. Hence it is decidable whether a given rewriting system has a given match bound. We also provide a sufficient criterion for the abence of a match-bound. The problem of existence of a match-bound is still open. Match-boundedness for all strings can be used as an automated criterion for termination, for match-bounded systems are terminating. This criterion can be strengthened by requiring match-boundedness only for a restricted set of strings, for instance the set of right hand sides of forward closures.

Rewritable ferroelectric vortex pairs in BiFeO3

NASA Astrophysics Data System (ADS)

Li, Yang; Jin, Yaming; Lu, Xiaomei; Yang, Jan-Chi; Chu, Ying-Hao; Huang, Fengzhen; Zhu, Jinsong; Cheong, Sang-Wook

2017-08-01

Ferroelectric vortex in multiferroic materials has been considered as a promising alternative to current memory cells for the merit of high storage density. However, the formation of regular natural ferroelectric vortex is difficult, restricting the achievement of vortex memory device. Here, we demonstrated the creation of ferroelectric vortex-antivortex pairs in BiFeO3 thin films by using local electric field. The evolution of the polar vortex structure is studied by piezoresponse force microscopy at nanoscale. The results reveal that the patterns and stability of vortex structures are sensitive to the poling position. Consecutive writing and erasing processes cause no influence on the original domain configuration. The Z4 proper coloring vortex-antivortex network is then analyzed by graph theory, which verifies the rationality of artificial vortex-antivortex pairs. This study paves a foundation for artificial regulation of vortex, which provides a possible pathway for the design and realization of non-volatile vortex memory devices and logical devices.

Formal Compiler Implementation in a Logical Framework

DTIC Science & Technology

2003-04-29

variable set [], we omit the brackets and use the simpler notation v. MetaPRL is a tactic-based prover that uses OCaml [20] as its meta-language. When a...rewrite is defined in MetaPRL, the framework creates an OCaml expression that can be used to apply the rewrite. Code to guide the application of...rewrites is written in OCaml , using a rich set of primitives provided by MetaPRL. MetaPRL automates the construction of most guidance code; we describe

Rewritable Painting Realized from Ambient-Sensitive Fluorescence of ZnO Nanoparticles

PubMed Central

Liu, Kai-Kai; Shan, Chong-Xin; He, Gao-Hang; Wang, Ruo-Qiu; Dong, Lin; Shen, De-Zhen

2017-01-01

Paper, as one of the most important information carriers, has contributed to the development and transmission of human civilization greatly. Meanwhile, a serious problem of environmental sustainable development caused by the production and utilization of paper has been resulted to modern society. Therefore, a simple and green route is urgently demanded to realize rewritable painting on paper. Herein, a simple route to rewritable painting on copy paper has been demonstrated by using eco-friendly ZnO nanoparticles (NPs) as fluorescent ink, and vinegar and soda that are frequently used in kitchen as erasing and neutralizing agents. Words or patterns written using the ZnO NPs as ink can be erased by vinegar vapour within five seconds, and after a neutralizing process in the ambient of soda vapour, the paper can be used for writing again. It is worth noting that the resolution and precision of the patterns produced via the above route degrade little after ten rewriting cycles, and the quality of the patterns produced using the ZnO NPs as ink fades little after being storage for several months, which promises the versatile potential applications of the rewriting route proposed in this paper. PMID:28169344

A Rewritable, Reprogrammable, Dual Light-Responsive Polymer Actuator.

PubMed

Gelebart, Anne Helene; Mulder, Dirk J; Vantomme, Ghislaine; Schenning, Albertus P H J; Broer, Dirk J

2017-10-16

We report on the fabrication of a rewritable and reprogrammable dual-photoresponsive liquid crystalline-based actuator containing an azomerocyanine dye that can be locally converted into the hydroxyazopyridinium form by acid treatment. Each dye absorbs at a different wavelength giving access to programmable actuators, the folding of which can be controlled by using different colors of light. The acidic patterning is reversible and allows the erasing and rewriting of patterns in the polymer film, giving access to reusable, adjustable soft actuators. © 2017 The Authors. Published by Wiley-VCH Verlag GmbH & Co. KGaA.

Distributed Sensing and Processing: A Graphical Model Approach

DTIC Science & Technology

2005-11-30

that Ramanujan graph toplogies maximize the convergence rate of distributed detection consensus algorithms, improving over three orders of...small world type network designs. 14. SUBJECT TERMS Ramanujan graphs, sensor network topology, sensor network...that Ramanujan graphs, for which there are explicit algebraic constructions, have large eigenratios, converging much faster than structured graphs

Learning graph matching.

PubMed

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

2009-06-01

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

Relating zeta functions of discrete and quantum graphs

NASA Astrophysics Data System (ADS)

Harrison, Jonathan; Weyand, Tracy

2018-02-01

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

Rewriting the Ways of Globalising Education?

ERIC Educational Resources Information Center

Singh, Michael

2002-01-01

Recodes metaphors in Apple's "Educating the 'Right' Way: Markets, Standards, God and Inequality," as resources for rewriting ways of globalizing education. Suggests that the radical right is imposing its market-driven, evangelical, reductionist project on educational globalization. These efforts frame the work of real-world teachers…

Monitoring Programs Using Rewriting

NASA Technical Reports Server (NTRS)

Havelund, Klaus; Rosu, Grigore; Lan, Sonie (Technical Monitor)

2001-01-01

We present a rewriting algorithm for efficiently testing future time Linear Temporal Logic (LTL) formulae on finite execution traces, The standard models of LTL are infinite traces, reflecting the behavior of reactive and concurrent systems which conceptually may be continuously alive in most past applications of LTL, theorem provers and model checkers have been used to formally prove that down-scaled models satisfy such LTL specifications. Our goal is instead to use LTL for up-scaled testing of real software applications, corresponding to analyzing the conformance of finite traces against LTL formulae. We first describe what it means for a finite trace to satisfy an LTL property end then suggest an optimized algorithm based on transforming LTL formulae. We use the Maude rewriting logic, which turns out to be a good notation and being supported by an efficient rewriting engine for performing these experiments. The work constitutes part of the Java PathExplorer (JPAX) project, the purpose of which is to develop a flexible tool for monitoring Java program executions.

On-Chip Fluorescence Switching System for Constructing a Rewritable Random Access Data Storage Device.

PubMed

Nguyen, Hoang Hiep; Park, Jeho; Hwang, Seungwoo; Kwon, Oh Seok; Lee, Chang-Soo; Shin, Yong-Beom; Ha, Tai Hwan; Kim, Moonil

2018-01-10

We report the development of on-chip fluorescence switching system based on DNA strand displacement and DNA hybridization for the construction of a rewritable and randomly accessible data storage device. In this study, the feasibility and potential effectiveness of our proposed system was evaluated with a series of wet experiments involving 40 bits (5 bytes) of data encoding a 5-charactered text (KRIBB). Also, a flexible data rewriting function was achieved by converting fluorescence signals between "ON" and "OFF" through DNA strand displacement and hybridization events. In addition, the proposed system was successfully validated on a microfluidic chip which could further facilitate the encoding and decoding process of data. To the best of our knowledge, this is the first report on the use of DNA hybridization and DNA strand displacement in the field of data storage devices. Taken together, our results demonstrated that DNA-based fluorescence switching could be applicable to construct a rewritable and randomly accessible data storage device through controllable DNA manipulations.

Examining the Development of Students' Covariational Reasoning in the Context of Graphing

ERIC Educational Resources Information Center

Frank, Kristin Marianna

2017-01-01

Researchers have documented the importance of seeing a graph as an emergent trace of how two quantities' values vary simultaneously in order to reason about the graph in terms of quantitative relationships. If a student does not see a graph as a representation of how quantities change together then the student is limited to reasoning about…

Proposal of New Rewritable Printing Media Using Electrophoresis and Confirmation of Its Mechanism

NASA Astrophysics Data System (ADS)

Hoshino, Yasushi; Ogura, Masahiro; Sano, Takayuki

2004-10-01

A new rewritable printing media using electrophoresis and selective heating is proposed to contribute to the reduction in paper consumption by printers. The mechanism is that when a heated part of the rewritable media is melted, white particles in that part of the media are able to move by electrophoresis. The media is initialized by heating its entire surface under the condition of voltage application and imaging is carried out by selective heating under the condition of an applied reversed-polarity voltage. Using a mixture system of carnauba wax and particles coated with titanium oxide (TiO2), the feasibility of the mechanism is confirmed.

A flexible optically re-writable color liquid crystal display

NASA Astrophysics Data System (ADS)

Zhang, Yihong; Sun, Jiatong; Liu, Yang; Shang, Jianhua; Liu, Hao; Liu, Huashan; Gong, Xiaohui; Chigrinov, Vladimir; Kowk, Hoi Sing

2018-03-01

It is very difficult to make a liquid crystal display (LCD) that is flexible. However, for an optically re-writable LCD (ORWLCD), only the spacers and the substrates need to be flexible because the driving unit and the display unit are separate and there are no electronics in the display part of ORWLCD. In this paper, three flexible-spacer methods are proposed to achieve this goal. A cholesteric liquid crystal colored mirror with a polarizer behind it is used as the colored reflective backboard of an ORWLCD. Polyethersulfone substrates and flexible spacers are used to make the optically re-writable cell insensitive to mechanical force.

A Female Interrogative Reader: The Adolescent Jane Austen Reads and Rewrites (His)tory.

ERIC Educational Resources Information Center

Reid-Walsh, Jacqueline

1992-01-01

Argues that Jane Austen's unpublished juvenile work "The History of England" has considerable relevance to twentieth-century high-school English classrooms. Notes that the work humorously shows the gender bias of traditional history texts because it is a "woman-centered" rewriting. (RS)

75 FR 48872 - General Services Administration Acquisition Regulation; Rewrite of GSAR Part 541, Acquisition of...

Federal Register 2010, 2011, 2012, 2013, 2014

2010-08-12

... Acquisition Regulation; Rewrite of GSAR Part 541, Acquisition of Utility Services AGENCIES: Office of Acquisition Policy, General Services Administration (GSA). ACTION: Final rule. SUMMARY: The General Services Administration (GSA) is amending the General Services Administration Acquisition Regulation (GSAR) to improve the...

78 FR 71041 - VA Compensation and Pension Regulation Rewrite Project

Federal Register 2010, 2011, 2012, 2013, 2014

2013-11-27

...The Department of Veterans Affairs (VA) proposes to reorganize and rewrite its compensation and pension regulations in a logical, claimant-focused, and user-friendly format. The intended effect of the proposed revisions is to assist claimants, beneficiaries, veterans' representatives, and VA personnel in locating and understanding these regulations.

Rewriting of States' Standards on Social Studies Stirs Debate

ERIC Educational Resources Information Center

Robelen, Erik W.

2010-01-01

As debate continues around the development and adoption of common standards in English and mathematics, several states are independently wrestling with rewrites of standards in a content area largely absent from that national discussion--social studies--and encountering their own shares of controversy. Flash points in the social studies debates…

Rewriting Citizenship? Civic Education in Costa Rica and Argentina

ERIC Educational Resources Information Center

Suarez, David F.

2008-01-01

To what degree are nations "rewriting" citizenship by expanding discussions of human rights, diversity and cultural pluralism in modern civic education, and what explains variation between countries? This study addresses these issues by analysing the intended content of civic education in Costa Rica and Argentina. Over time, civic…

Building Specialized Multilingual Lexical Graphs Using Community Resources

NASA Astrophysics Data System (ADS)

Daoud, Mohammad; Boitet, Christian; Kageura, Kyo; Kitamoto, Asanobu; Mangeot, Mathieu; Daoud, Daoud

We are describing methods for compiling domain-dedicated multilingual terminological data from various resources. We focus on collecting data from online community users as a main source, therefore, our approach depends on acquiring contributions from volunteers (explicit approach), and it depends on analyzing users' behaviors to extract interesting patterns and facts (implicit approach). As a generic repository that can handle the collected multilingual terminological data, we are describing the concept of dedicated Multilingual Preterminological Graphs MPGs, and some automatic approaches for constructing them by analyzing the behavior of online community users. A Multilingual Preterminological Graph is a special lexical resource that contains massive amount of terms related to a special domain. We call it preterminological, because it is a raw material that can be used to build a standardized terminological repository. Building such a graph is difficult using traditional approaches, as it needs huge efforts by domain specialists and terminologists. In our approach, we build such a graph by analyzing the access log files of the website of the community, and by finding the important terms that have been used to search in that website, and their association with each other. We aim at making this graph as a seed repository so multilingual volunteers can contribute. We are experimenting this approach with the Digital Silk Road Project. We have used its access log files since its beginning in 2003, and obtained an initial graph of around 116000 terms. As an application, we used this graph to obtain a preterminological multilingual database that is serving a CLIR system for the DSR project.

Assessment of semantic similarity between proteins using information content and topological properties of the Gene Ontology graph.

PubMed

Dutta, Pritha; Basu, Subhadip; Kundu, Mahantapas

2017-03-31

The semantic similarity between two interacting proteins can be estimated by combining the similarity scores of the GO terms associated with the proteins. Greater number of similar GO annotations between two proteins indicates greater interaction affinity. Existing semantic similarity measures make use of the GO graph structure, the information content of GO terms, or a combination of both. In this paper, we present a hybrid approach which utilizes both the topological features of the GO graph and information contents of the GO terms. More specifically, we 1) consider a fuzzy clustering of the GO graph based on the level of association of the GO terms, 2) estimate the GO term memberships to each cluster center based on the respective shortest path lengths, and 3) assign weightage to GO term pairs on the basis of their dissimilarity with respect to the cluster centers. We test the performance of our semantic similarity measure against seven other previously published similarity measures using benchmark protein-protein interaction datasets of Homo sapiens and Saccharomyces cerevisiae based on sequence similarity, Pfam similarity, area under ROC curve and F1 measure.

Smartphone Application Enabling Global Graph Exploitation and Proactive Dissemination Service (DSPro) Integration (Revised Fiscal Year 2015)

DTIC Science & Technology

2015-09-01

interface. 15. SUBJECT TERMS smartphone, HDPT, global graph, DSPro, ozone widget framework, distributed common ground system, web service 16. SECURITY...Lee M. Lessons learned with a global graph and ozone widget framework (OWF) testbed. Aberdeen Proving Ground (MD): Army Research Laboratory (US); 2013

Precalculus Teachers' Perspectives on Using Graphing Calculators: An Example from One Curriculum

ERIC Educational Resources Information Center

Karadeniz, Ilyas; Thompson, Denisse R.

2018-01-01

Graphing calculators are hand-held technological tools currently used in mathematics classrooms. Teachers' perspectives on using graphing calculators are important in terms of exploring what teachers think about using such technology in advanced mathematics courses, particularly precalculus courses. A descriptive intrinsic case study was conducted…

Kellogg Foundation Initiative: Rewriting the Way Foundations Do Business in Indian Country.

ERIC Educational Resources Information Center

Boyer, Paul

2000-01-01

Describes the multi-million dollar initiative announced by W. K. Kellogg Foundation in 1995 to support the Native American Higher Education Initiative, and how the Kellogg initiative deserves attention from the nation as a whole because it is attempting to fundamentally rewrite the way foundations do business with Indian communities. (VWC)

76 FR 69296 - Proposed Models for Plant-Specific Adoption of Technical Specifications Task Force Traveler TSTF...

Federal Register 2010, 2011, 2012, 2013, 2014

2011-11-08

... Adoption of Technical Specifications Task Force Traveler TSTF-500, Revision 2, ``DC Electrical Rewrite... Technical Specifications Task Force (TSTF) Traveler TSTF-500, Revision 2, ``DC Electrical Rewrite--Update to... Reactor Systems Engineer, Technical Specifications Branch, Mail Stop: O-7 C2A, Division of Inspection and...

Emancipatory Narratives: Rewriting the Master Script in the School Curriculum.

ERIC Educational Resources Information Center

Swartz, Ellen

1992-01-01

Early efforts at multicultural education have largely been compensatory attempts to address inequities in cultural representation. What is needed is a rewriting of the entire master script of curriculum to eliminate implicit racism, classism, and sexism. Examples from U.S. history illustrate the scope of revision needed in education. (SLD)

Re/Writing the Subject: A Contribution to Post-Structuralist Theory in Mathematics Education

ERIC Educational Resources Information Center

Roth, Wolff-Michael

2012-01-01

This text, occasioned by a critical reading of "Mathematics Education and Subjectivity" (Brown, "2011") and constituting a response to the book, aims at contributing to the building of (post-structuralist) theory in mathematics education. Its purpose was to re/write two major positions that "Mathematics Education and Subjectivity" articulates:…

Sentence-Level Rewriting Detection

ERIC Educational Resources Information Center

Zhang, Fan; Litman, Diane

2014-01-01

Writers usually need iterations of revisions and edits during their writings. To better understand the process of rewriting, we need to know what has changed be-tween the revisions. Prior work mainly focuses on detecting corrections within sentences, which is at the level of words or phrases. This paper proposes to detect revision changes at the…

A simplifying feature of the heterotic one loop four graviton amplitude

NASA Astrophysics Data System (ADS)

Basu, Anirban

2018-01-01

We show that the weight four modular graph functions that contribute to the integrand of the t8t8D4R4 term at one loop in heterotic string theory do not require regularization, and hence the integrand is simple. This is unlike the graphs that contribute to the integrands of the other gravitational terms at this order in the low momentum expansion, and these integrands require regularization. This property persists for an infinite number of terms in the effective action, and their integrands do not require regularization. We find non-trivial relations between weight four graphs of distinct topologies that do not require regularization by performing trivial manipulations using auxiliary diagrams.

The Vertex Version of Weighted Wiener Number for Bicyclic Molecular Structures

PubMed Central

Gao, Wei

2015-01-01

Graphs are used to model chemical compounds and drugs. In the graphs, each vertex represents an atom of molecule and edges between the corresponding vertices are used to represent covalent bounds between atoms. We call such a graph, which is derived from a chemical compound, a molecular graph. Evidence shows that the vertex-weighted Wiener number, which is defined over this molecular graph, is strongly correlated to both the melting point and boiling point of the compounds. In this paper, we report the extremal vertex-weighted Wiener number of bicyclic molecular graph in terms of molecular structural analysis and graph transformations. The promising prospects of the application for the chemical and pharmacy engineering are illustrated by theoretical results achieved in this paper. PMID:26640513

A Lexicon of Contracting Terms: Contract Types

DTIC Science & Technology

1990-09-01

42 respondents, 24 of them agreed with the definition, while 17 disagreed, and one had no comment . That led to an agreement rate of about 57%. The...synonym. Seventeen others had no comment , and the one who disagreed with the "non-list" offered no suggestions. Proposed Definition. After reviewing...respondents disagreed with the definition, and three had no comment . Rewrite. The two comments dealt with replacing "to" with another word, either "under

Structural Analysis of Treatment Cycles Representing Transitions between Nursing Organizational Units Inferred from Diabetes

PubMed Central

Dehmer, Matthias; Kurt, Zeyneb; Emmert-Streib, Frank; Them, Christa; Schulc, Eva; Hofer, Sabine

2015-01-01

In this paper, we investigate treatment cycles inferred from diabetes data by means of graph theory. We define the term treatment cycles graph-theoretically and perform a descriptive as well as quantitative analysis thereof. Also, we interpret our findings in terms of nursing and clinical management. PMID:26030296

Financing Education for Children Affected by Conflict: Lessons from Save the Children's Rewrite the Future Campaign

ERIC Educational Resources Information Center

Dolan, Janice; Ndaruhutse, Susy

2011-01-01

In recent years, Save the Children, a non-governmental organization, prioritized education for children affected by conflict through its Rewrite the Future Campaign. By significantly scaling up the resources allocated to programmes in conflict-affected countries, the organization has grown its education programmes in these contexts. Thus it has…

77 FR 59581 - Personal Identity Verification, Release and Handling of Restricted Information, Protection of the...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-09-28

... of a major NASA FAR Supplement (NFS) rewrite, any changes from the withdrawn rules that continue to... (NFS). Public comments were received on all three rules. However, circumstances at the time prevented... cancelled without further action. At this time, NASA is in process of a major NFS rewrite, and any changes...

Scaffolded Writing and Rewriting in the Discipline: A Web-Based Reciprocal Peer Review System

ERIC Educational Resources Information Center

Cho, Kwangsu; Schunn, Christian D.

2007-01-01

This paper describes how SWoRD (scaffolded writing and rewriting in the discipline), a web-based reciprocal peer review system, supports writing practice, particularly for large content courses in which writing is considered critical but not feasibly included. To help students gain content knowledge as well as writing and reviewing skills, SWoRD…

Students' Use of Languaging in Rewriting Events from "The Things They Carried"

ERIC Educational Resources Information Center

Beach, Richard

2017-01-01

This article describes high school students' responses to events in the novel, "The Things They Carried," leading to their collaborative rewriting to create their own narrative versions of these events. It draws on "enactivist" theory of languaging, an approach to language that focuses on its use as social actions to enact and…

A brief historical introduction to Euler's formula for polyhedra, topology, graph theory and networks

NASA Astrophysics Data System (ADS)

Debnath, Lokenath

2010-09-01

This article is essentially devoted to a brief historical introduction to Euler's formula for polyhedra, topology, theory of graphs and networks with many examples from the real-world. Celebrated Königsberg seven-bridge problem and some of the basic properties of graphs and networks for some understanding of the macroscopic behaviour of real physical systems are included. We also mention some important and modern applications of graph theory or network problems from transportation to telecommunications. Graphs or networks are effectively used as powerful tools in industrial, electrical and civil engineering, communication networks in the planning of business and industry. Graph theory and combinatorics can be used to understand the changes that occur in many large and complex scientific, technical and medical systems. With the advent of fast large computers and the ubiquitous Internet consisting of a very large network of computers, large-scale complex optimization problems can be modelled in terms of graphs or networks and then solved by algorithms available in graph theory. Many large and more complex combinatorial problems dealing with the possible arrangements of situations of various kinds, and computing the number and properties of such arrangements can be formulated in terms of networks. The Knight's tour problem, Hamilton's tour problem, problem of magic squares, the Euler Graeco-Latin squares problem and their modern developments in the twentieth century are also included.

Elementary Particle Spectroscopy in Regular Solid Rewrite

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

Trell, Erik

The Nilpotent Universal Computer Rewrite System (NUCRS) has operationalized the radical ontological dilemma of Nothing at All versus Anything at All down to the ground recursive syntax and principal mathematical realisation of this categorical dichotomy as such and so governing all its sui generis modalities, leading to fulfilment of their individual terms and compass when the respective choice sequence operations are brought to closure. Focussing on the general grammar, NUCRS by pure logic and its algebraic notations hence bootstraps Quantum Mechanics, aware that it ''is the likely keystone of a fundamental computational foundation'' also for e.g. physics, molecular biology andmore » neuroscience. The present work deals with classical geometry where morphology is the modality, and ventures that the ancient regular solids are its specific rewrite system, in effect extensively anticipating the detailed elementary particle spectroscopy, and further on to essential structures at large both over the inorganic and organic realms. The geodetic antipode to Nothing is extension, with natural eigenvector the endless straight line which when deployed according to the NUCRS as well as Plotelemeian topographic prescriptions forms a real three-dimensional eigenspace with cubical eigenelements where observed quark-skewed quantum-chromodynamical particle events self-generate as an Aristotelean phase transition between the straight and round extremes of absolute endlessness under the symmetry- and gauge-preserving, canonical coset decomposition SO(3)xO(5) of Lie algebra SU(3). The cubical eigen-space and eigen-elements are the parental state and frame, and the other solids are a range of transition matrix elements and portions adapting to the spherical root vector symmetries and so reproducibly reproducing the elementary particle spectroscopy, including a modular, truncated octahedron nano-composition of the Electron which piecemeal enter into molecular structures or compressed to each other fuse into atomic honeycombs of periodic table signature.« less

Localization on Quantum Graphs with Random Vertex Couplings

NASA Astrophysics Data System (ADS)

Klopp, Frédéric; Pankrashkin, Konstantin

2008-05-01

We consider Schrödinger operators on a class of periodic quantum graphs with randomly distributed Kirchhoff coupling constants at all vertices. We obtain necessary conditions for localization on quantum graphs in terms of finite volume criteria for some energy-dependent discrete Hamiltonians. These conditions hold in the strong disorder limit and at the spectral edges.

The signed permutation group on Feynman graphs

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

Purkart, Julian, E-mail: purkart@physik.hu-berlin.de

2016-08-15

The Feynman rules assign to every graph an integral which can be written as a function of a scaling parameter L. Assuming L for the process under consideration is very small, so that contributions to the renormalization group are small, we can expand the integral and only consider the lowest orders in the scaling. The aim of this article is to determine specific combinations of graphs in a scalar quantum field theory that lead to a remarkable simplification of the first non-trivial term in the perturbation series. It will be seen that the result is independent of the renormalization schememore » and the scattering angles. To achieve that goal we will utilize the parametric representation of scalar Feynman integrals as well as the Hopf algebraic structure of the Feynman graphs under consideration. Moreover, we will present a formula which reduces the effort of determining the first-order term in the perturbation series for the specific combination of graphs to a minimum.« less

Fiche pratique: En chantant; Recrire un scenario; Pour en decoudre avec le subjonctif; Cri d'alerte (Practical Ideas: Singing; Rewriting a Scenario; to Unravel the Subjunctive; Cry of Alarm).

ERIC Educational Resources Information Center

Delbende, Jean-Christophe; And Others

1996-01-01

Four ideas for French language classroom activities are described: an exercise in listening to popular songs; a film scenario rewriting exercise; a technique for teaching the subjunctive mood; and a paired or small-group activity to enhance understanding of advertising. (MSE)

Word Processing with the Elementary School Student--A Teaching and Learning Experience for Both Teachers and Students.

ERIC Educational Resources Information Center

Jacoby, Adrienne

Using word processing in the elementary school writing curriculum is advantageous for both students and teachers. Word processors motivate students to spend more time on task, encourage changes and rewriting, and eliminate concern for neatness and the tedium of writing (and rewriting) by hand. Teachers can see that students using the word…

(Re)Writing Civics in the Digital Age: The Role of Social Media in Student (Dis)Engagement

ERIC Educational Resources Information Center

Portman Daley, Joannah

2012-01-01

(Re)Writing Civics in the Digital Age: The Role of Social Media in Student (Dis)Engagement addresses an important gap in the knowledge of civic rhetoric available in Rhetoric and Composition by using qualitative methods to explore the parameters of civic engagement through social media-based digital writing. With funding from URI's Office of…

A SCIENCE PROGRAM FOR THE ELEMENTARY SCHOOLS OF LOWER MERION SCHOOL DISTRICT.

ERIC Educational Resources Information Center

Lower Merion Township School District, Ardmore, PA.

AFTER AN EVALUATION MADE BY THE TEACHERS OF KINDERGARTEN THROUGH GRADE 6, THE FOLLOWING AREAS OF CLARIFICATION, REWRITING, OR ADDITIONS WERE INDICATED--THE PURPOSE AND USE OF THE SCIENCE GUIDE, EVALUATION OF THE UNITS BY GRADES, ADDITIONAL MATERIALS FOR THE UNITS, A REWRITING OF PARTICULAR UNITS, HEALTH UNITS FOR GRADES 1 THROUGH 5, THE USE OF…

A Rewriting-Based Approach to Trace Analysis

NASA Technical Reports Server (NTRS)

Havelund, Klaus; Rosu, Grigore; Clancy, Daniel (Technical Monitor)

2002-01-01

We present a rewriting-based algorithm for efficiently evaluating future time Linear Temporal Logic (LTL) formulae on finite execution traces online. While the standard models of LTL are infinite traces, finite traces appear naturally when testing and/or monitoring red applications that only run for limited time periods. The presented algorithm is implemented in the Maude executable specification language and essentially consists of a set of equations establishing an executable semantics of LTL using a simple formula transforming approach. The algorithm is further improved to build automata on-the-fly from formulae, using memoization. The result is a very efficient and small Maude program that can be used to monitor program executions. We furthermore present an alternative algorithm for synthesizing probably minimal observer finite state machines (or automata) from LTL formulae, which can be used to analyze execution traces without the need for a rewriting system, and can hence be used by observers written in conventional programming languages. The presented work is part of an ambitious runtime verification and monitoring project at NASA Ames, called PATHEXPLORER, and demonstrates that rewriting can be a tractable and attractive means for experimenting and implementing program monitoring logics.

Dynamic Information Management and Exchange for Command and Control Applications, Modelling and Enforcing Category-Based Access Control via Term Rewriting

DTIC Science & Technology

2015-03-01

a hotel and a hospital. 2. Event handler for emergency policies (item 2 above): this has been implemented in two UG projects, one project developed a...Workshop on Logical and Se- mantic Frameworks, with Applications, Brasilia, Brazil , September 2014. Electronic Notes in Theoretical Computer Science (to...Brasilia, Brazil , September 2014, 2015. [3] S. Barker. The next 700 access control models or a unifying meta-model? In SACMAT 2009, 14th ACM Symposium on

Sub-Circuit Selection and Replacement Algorithms Modeled as Term Rewriting Systems

DTIC Science & Technology

2008-12-16

424, 389, 084, 160 2 In. - 4 Out. 8 , 534, 800, 742, 400 1, 692, 393, 846 , 681, 600 2 In. - 5 Out. 12, 142, 363, 968, 000 2, 661, 320, 479, 104, 000 3...57 A.2 The number of sub-circuits containing 5 and 6 gates . . . . . . 59 A.3 The number of sub-circuits containing 7 and 8 gates . . . . . . 61 A.4...number of sub-circuits containing 7 and 8 gates . . . . . . 68 B.1 Circuit Transformation Rules . . . . . . . . . . . . . . . . . . . 71 x Sub-circuit

Optically erasable and rewritable solid-state holograms.

NASA Technical Reports Server (NTRS)

Gaylord, T. K.; Rabson, T. A.; Tittel, F. K.

1972-01-01

Optical holographic storage in single-crystal LiNbO3 is described which can be optically erased at room temperature and then rewritten with no degradation in efficiency or writing rate. The diffraction efficiencies associated with the process are about 0.0001. Some variations from previously obtained results include a lack of threshold power density for writing, very-long-term persistence of the stored hologram, and a lack of a dependence of the diffracted intensity on the polarization of the readout beam.

Global dynamics for switching systems and their extensions by linear differential equations

NASA Astrophysics Data System (ADS)

Huttinga, Zane; Cummins, Bree; Gedeon, Tomáš; Mischaikow, Konstantin

2018-03-01

Switching systems use piecewise constant nonlinearities to model gene regulatory networks. This choice provides advantages in the analysis of behavior and allows the global description of dynamics in terms of Morse graphs associated to nodes of a parameter graph. The parameter graph captures spatial characteristics of a decomposition of parameter space into domains with identical Morse graphs. However, there are many cellular processes that do not exhibit threshold-like behavior and thus are not well described by a switching system. We consider a class of extensions of switching systems formed by a mixture of switching interactions and chains of variables governed by linear differential equations. We show that the parameter graphs associated to the switching system and any of its extensions are identical. For each parameter graph node, there is an order-preserving map from the Morse graph of the switching system to the Morse graph of any of its extensions. We provide counterexamples that show why possible stronger relationships between the Morse graphs are not valid.

Global dynamics for switching systems and their extensions by linear differential equations.

PubMed

Huttinga, Zane; Cummins, Bree; Gedeon, Tomáš; Mischaikow, Konstantin

2018-03-15

Switching systems use piecewise constant nonlinearities to model gene regulatory networks. This choice provides advantages in the analysis of behavior and allows the global description of dynamics in terms of Morse graphs associated to nodes of a parameter graph. The parameter graph captures spatial characteristics of a decomposition of parameter space into domains with identical Morse graphs. However, there are many cellular processes that do not exhibit threshold-like behavior and thus are not well described by a switching system. We consider a class of extensions of switching systems formed by a mixture of switching interactions and chains of variables governed by linear differential equations. We show that the parameter graphs associated to the switching system and any of its extensions are identical. For each parameter graph node, there is an order-preserving map from the Morse graph of the switching system to the Morse graph of any of its extensions. We provide counterexamples that show why possible stronger relationships between the Morse graphs are not valid.

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

PubMed

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

2017-12-01

Policy Points: Effective graphs can be a powerful tool in communicating health inequality. The choice of graphs is often based on preferences and familiarity rather than science. According to the literature on graph perception, effective graphs allow human brains to decode visual cues easily. Dot charts are easier to decode than bar charts, and thus they are more effective. Dot charts are a flexible and versatile way to display information about health inequality. Consistent with the health risk communication literature, the captions accompanying health inequality graphs should provide a numerical, explicitly calculated description of health inequality, expressed in absolute and relative terms, from carefully thought-out perspectives. Graphs are an essential tool for communicating health inequality, a key health policy concern. The choice of graphs is often driven by personal preferences and familiarity. Our article is aimed at health policy researchers developing health inequality graphs for policy and scientific audiences and seeks to (1) raise awareness of the effective use of graphs in communicating health inequality; (2) advocate for a particular type of graph (ie, dot charts) to depict health inequality; and (3) suggest key considerations for the captions accompanying health inequality graphs. Using composite review methods, we selected the prevailing recommendations for improving graphs in scientific reporting. To find the origins of these recommendations, we reviewed the literature on graph perception and then applied what we learned to the context of health inequality. In addition, drawing from the numeracy literature in health risk communication, we examined numeric and verbal formats to explain health inequality graphs. Many disciplines offer commonsense recommendations for visually presenting quantitative data. The literature on graph perception, which defines effective graphs as those allowing the easy decoding of visual cues in human brains, shows that with their more accurate and easier-to-decode visual cues, dot charts are more effective than bar charts. Dot charts can flexibly present a large amount of information in limited space. They also can easily accommodate typical health inequality information to describe a health variable (eg, life expectancy) by an inequality domain (eg, income) with domain groups (eg, poor and rich) in a population (eg, Canada) over time periods (eg, 2010 and 2017). The numeracy literature suggests that a health inequality graph's caption should provide a numerical, explicitly calculated description of health inequality expressed in absolute and relative terms, from carefully thought-out perspectives. Given the ubiquity of graphs, the health inequality field should learn from the vibrant multidisciplinary literature how to construct effective graphic communications, especially by considering to use dot charts. © 2017 Milbank Memorial Fund.

Rewritable and pH-Sensitive Micropatterns Based on Nanoparticle "Inks"

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

Wang, D. W.; Lagzi, Istvan; Wesson, Paul J.

2010-08-16

Rewritable micropatterns based on nanoparticle “inks” are created in gel substrates by wet stamping. The colors of the patterns depend on pH, reflect the degree of nanoparticle aggregation, and can be written using acids and erased using bases. Micropatterns imprinted with salts are “permanent” but can change color upon pH changes; these patterns act as multiple-use pH sensors.

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

PubMed Central

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

2010-01-01

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

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

PubMed

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

2010-05-18

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

Preserving Differential Privacy in Degree-Correlation based Graph Generation

PubMed Central

Wang, Yue; Wu, Xintao

2014-01-01

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

A Rewritable, Random-Access DNA-Based Storage System.

PubMed

Yazdi, S M Hossein Tabatabaei; Yuan, Yongbo; Ma, Jian; Zhao, Huimin; Milenkovic, Olgica

2015-09-18

We describe the first DNA-based storage architecture that enables random access to data blocks and rewriting of information stored at arbitrary locations within the blocks. The newly developed architecture overcomes drawbacks of existing read-only methods that require decoding the whole file in order to read one data fragment. Our system is based on new constrained coding techniques and accompanying DNA editing methods that ensure data reliability, specificity and sensitivity of access, and at the same time provide exceptionally high data storage capacity. As a proof of concept, we encoded parts of the Wikipedia pages of six universities in the USA, and selected and edited parts of the text written in DNA corresponding to three of these schools. The results suggest that DNA is a versatile media suitable for both ultrahigh density archival and rewritable storage applications.

A Rewritable, Random-Access DNA-Based Storage System

NASA Astrophysics Data System (ADS)

Tabatabaei Yazdi, S. M. Hossein; Yuan, Yongbo; Ma, Jian; Zhao, Huimin; Milenkovic, Olgica

2015-09-01

We describe the first DNA-based storage architecture that enables random access to data blocks and rewriting of information stored at arbitrary locations within the blocks. The newly developed architecture overcomes drawbacks of existing read-only methods that require decoding the whole file in order to read one data fragment. Our system is based on new constrained coding techniques and accompanying DNA editing methods that ensure data reliability, specificity and sensitivity of access, and at the same time provide exceptionally high data storage capacity. As a proof of concept, we encoded parts of the Wikipedia pages of six universities in the USA, and selected and edited parts of the text written in DNA corresponding to three of these schools. The results suggest that DNA is a versatile media suitable for both ultrahigh density archival and rewritable storage applications.

Resistance distance and Kirchhoff index in circulant graphs

NASA Astrophysics Data System (ADS)

Zhang, Heping; Yang, Yujun

The resistance distance rij between vertices i and j of a connected (molecular) graph G is computed as the effective resistance between nodes i and j in the corresponding network constructed from G by replacing each edge of G with a unit resistor. The Kirchhoff index Kf(G) is the sum of resistance distances between all pairs of vertices. In this work, closed-form formulae for Kirchhoff index and resistance distances of circulant graphs are derived in terms of Laplacian spectrum and eigenvectors. Special formulae are also given for four classes of circulant graphs (complete graphs, complete graphs minus a perfect matching, cycles, Möbius ladders Mp). In particular, the asymptotic behavior of Kf(Mp) as p ? ? is obtained, that is, Kf(Mp) grows as ⅙p3 as p ? ?.

On a programming language for graph algorithms

NASA Technical Reports Server (NTRS)

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

1971-01-01

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

Quantum Experiments and Graphs: Multiparty States as Coherent Superpositions of Perfect Matchings.

PubMed

Krenn, Mario; Gu, Xuemei; Zeilinger, Anton

2017-12-15

We show a surprising link between experimental setups to realize high-dimensional multipartite quantum states and graph theory. In these setups, the paths of photons are identified such that the photon-source information is never created. We find that each of these setups corresponds to an undirected graph, and every undirected graph corresponds to an experimental setup. Every term in the emerging quantum superposition corresponds to a perfect matching in the graph. Calculating the final quantum state is in the #P-complete complexity class, thus it cannot be done efficiently. To strengthen the link further, theorems from graph theory-such as Hall's marriage problem-are rephrased in the language of pair creation in quantum experiments. We show explicitly how this link allows one to answer questions about quantum experiments (such as which classes of entangled states can be created) with graph theoretical methods, and how to potentially simulate properties of graphs and networks with quantum experiments (such as critical exponents and phase transitions).

Resistance Distances and Kirchhoff Index in Generalised Join Graphs

NASA Astrophysics Data System (ADS)

Chen, Haiyan

2017-03-01

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

Quantum Experiments and Graphs: Multiparty States as Coherent Superpositions of Perfect Matchings

NASA Astrophysics Data System (ADS)

Krenn, Mario; Gu, Xuemei; Zeilinger, Anton

2017-12-01

We show a surprising link between experimental setups to realize high-dimensional multipartite quantum states and graph theory. In these setups, the paths of photons are identified such that the photon-source information is never created. We find that each of these setups corresponds to an undirected graph, and every undirected graph corresponds to an experimental setup. Every term in the emerging quantum superposition corresponds to a perfect matching in the graph. Calculating the final quantum state is in the #P-complete complexity class, thus it cannot be done efficiently. To strengthen the link further, theorems from graph theory—such as Hall's marriage problem—are rephrased in the language of pair creation in quantum experiments. We show explicitly how this link allows one to answer questions about quantum experiments (such as which classes of entangled states can be created) with graph theoretical methods, and how to potentially simulate properties of graphs and networks with quantum experiments (such as critical exponents and phase transitions).

Israel & Jordan: Paving a Path for the Future through Understanding the Peoples and Cultures of the Middle East. Fulbright-Hays Summer Seminars Abroad, 1998 (Israel and Jordan).

ERIC Educational Resources Information Center

Moore, Ilene

This curriculum project on the cultures of the Middle Eastern countries of Israel and Jordan stresses the language arts and focuses on objectives for elementary-age students to attain. The project states that children will: locate, list, identify, label, demonstrate, research, organize, compose, conference, rewrite, proofread, rewrite again,…

Evolutionary dynamics of social dilemmas in structured heterogeneous populations.

PubMed

Santos, F C; Pacheco, J M; Lenaerts, Tom

2006-02-28

Real populations have been shown to be heterogeneous, in which some individuals have many more contacts than others. This fact contrasts with the traditional homogeneous setting used in studies of evolutionary game dynamics. We incorporate heterogeneity in the population by studying games on graphs, in which the variability in connectivity ranges from single-scale graphs, for which heterogeneity is small and associated degree distributions exhibit a Gaussian tale, to scale-free graphs, for which heterogeneity is large with degree distributions exhibiting a power-law behavior. We study the evolution of cooperation, modeled in terms of the most popular dilemmas of cooperation. We show that, for all dilemmas, increasing heterogeneity favors the emergence of cooperation, such that long-term cooperative behavior easily resists short-term noncooperative behavior. Moreover, we show how cooperation depends on the intricate ties between individuals in scale-free populations.

The Kirchhoff index and the matching number

NASA Astrophysics Data System (ADS)

Zhou, Bo; Trinajstić, Nenad

The Kirchhoff index of a connected (molecular) graph is the sum of the resistance-distances between all unordered pairs of vertices and may also be expressed by its Laplacian eigenvalues. We determine the minimum Kirchhoff index of connected (molecular) graphs in terms of the number of vertices and matching number and characterize the unique extremal graph. The results on the Kirchhoff index are compared with the corresponding results on the Wiener index.

Visibility of quantum graph spectrum from the vertices

NASA Astrophysics Data System (ADS)

Kühn, Christian; Rohleder, Jonathan

2018-03-01

We investigate the relation between the eigenvalues of the Laplacian with Kirchhoff vertex conditions on a finite metric graph and a corresponding Titchmarsh-Weyl function (a parameter-dependent Neumann-to-Dirichlet map). We give a complete description of all real resonances, including multiplicities, in terms of the edge lengths and the connectivity of the graph, and apply it to characterize all eigenvalues which are visible for the Titchmarsh-Weyl function.

Droplet states in quantum XXZ spin systems on general graphs

NASA Astrophysics Data System (ADS)

Fischbacher, C.; Stolz, G.

2018-05-01

We study XXZ spin systems on general graphs. In particular, we describe the formation of droplet states near the bottom of the spectrum in the Ising phase of the model, where the Z-term dominates the XX-term. As key tools, we use particle number conservation of XXZ systems and symmetric products of graphs with their associated adjacency matrices and Laplacians. Of particular interest to us are strips and multi-dimensional Euclidean lattices, for which we discuss the existence of spectral gaps above the droplet regime. We also prove a Combes-Thomas bound which shows that the eigenstates in the droplet regime are exponentially small perturbations of strict (classical) droplets.

Genome alignment with graph data structures: a comparison

PubMed Central

2014-01-01

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

Top-k similar graph matching using TraM in biological networks.

PubMed

Amin, Mohammad Shafkat; Finley, Russell L; Jamil, Hasan M

2012-01-01

Many emerging database applications entail sophisticated graph-based query manipulation, predominantly evident in large-scale scientific applications. To access the information embedded in graphs, efficient graph matching tools and algorithms have become of prime importance. Although the prohibitively expensive time complexity associated with exact subgraph isomorphism techniques has limited its efficacy in the application domain, approximate yet efficient graph matching techniques have received much attention due to their pragmatic applicability. Since public domain databases are noisy and incomplete in nature, inexact graph matching techniques have proven to be more promising in terms of inferring knowledge from numerous structural data repositories. In this paper, we propose a novel technique called TraM for approximate graph matching that off-loads a significant amount of its processing on to the database making the approach viable for large graphs. Moreover, the vector space embedding of the graphs and efficient filtration of the search space enables computation of approximate graph similarity at a throw-away cost. We annotate nodes of the query graphs by means of their global topological properties and compare them with neighborhood biased segments of the datagraph for proper matches. We have conducted experiments on several real data sets, and have demonstrated the effectiveness and efficiency of the proposed method

Superhydrophobic Surface With Shape Memory Micro/Nanostructure and Its Application in Rewritable Chip for Droplet Storage.

PubMed

Lv, Tong; Cheng, Zhongjun; Zhang, Dongjie; Zhang, Enshuang; Zhao, Qianlong; Liu, Yuyan; Jiang, Lei

2016-09-21

Recently, superhydrophobic surfaces with tunable wettability have aroused much attention. Noticeably, almost all present smart performances rely on the variation of surface chemistry on static micro/nanostructure, to obtain a surface with dynamically tunable micro/nanostructure, especially that can memorize and keep different micro/nanostructures and related wettabilities, is still a challenge. Herein, by creating micro/nanostructured arrays on shape memory polymer, a superhydrophobic surface that has shape memory ability in changing and recovering its hierarchical structures and related wettabilities was reported. Meanwhile, the surface was successfully used in the rewritable functional chip for droplet storage by designing microstructure-dependent patterns, which breaks through current research that structure patterns cannot be reprogrammed. This article advances a superhydrophobic surface with shape memory hierarchical structure and the application in rewritable functional chip, which could start some fresh ideas for the development of smart superhydrophobic surface.

Termination Proofs for String Rewriting Systems via Inverse Match-Bounds

NASA Technical Reports Server (NTRS)

Butler, Ricky (Technical Monitor); Geser, Alfons; Hofbauer, Dieter; Waldmann, Johannes

2004-01-01

Annotating a letter by a number, one can record information about its history during a reduction. A string rewriting system is called match-bounded if there is a global upper bound to these numbers. In earlier papers we established match-boundedness as a strong sufficient criterion for both termination and preservation of regular languages. We show now that the string rewriting system whose inverse (left and right hand sides exchanged) is match-bounded, also have exceptional properties, but slightly different ones. Inverse match-bounded systems effectively preserve context-free languages; their sets of normalized strings and their sets of immortal strings are effectively regular. These sets of strings can be used to decide the normalization, the termination and the uniform termination problems of inverse match-bounded systems. We also show that the termination problem is decidable in linear time, and that a certain strong reachability problem is deciable, thus solving two open problems of McNaughton's.

A link representation for gravity amplitudes

NASA Astrophysics Data System (ADS)

He, Song

2013-10-01

We derive a link representation for all tree amplitudes in supergravity, from a recent conjecture by Cachazo and Skinner. The new formula explicitly writes amplitudes as contour integrals over constrained link variables, with an integrand naturally expressed in terms of determinants, or equivalently tree diagrams. Important symmetries of the amplitude, such as supersymmetry, parity and (partial) permutation invariance, are kept manifest in the formulation. We also comment on rewriting the formula in a GL( k)-invariant manner, which may serve as a starting point for the generalization to possible Grassmannian contour integrals.

Associating clinical archetypes through UMLS Metathesaurus term clusters.

PubMed

Lezcano, Leonardo; Sánchez-Alonso, Salvador; Sicilia, Miguel-Angel

2012-06-01

Clinical archetypes are modular definitions of clinical data, expressed using standard or open constraint-based data models as the CEN EN13606 and openEHR. There is an increasing archetype specification activity that raises the need for techniques to associate archetypes to support better management and user navigation in archetype repositories. This paper reports on a computational technique to generate tentative archetype associations by mapping them through term clusters obtained from the UMLS Metathesaurus. The terms are used to build a bipartite graph model and graph connectivity measures can be used for deriving associations.

On the Kirchhoff Index of Graphs

NASA Astrophysics Data System (ADS)

Das, Kinkar C.

2013-09-01

Let G be a connected graph of order n with Laplacian eigenvalues μ1 ≥ μ2 ≥ ... ≥ μn-1 > mn = 0. The Kirchhoff index of G is defined as [xxx] In this paper. we give lower and upper bounds on Kf of graphs in terms on n, number of edges, maximum degree, and number of spanning trees. Moreover, we present lower and upper bounds on the Nordhaus-Gaddum-type result for the Kirchhoff index.

Patterns and Practices for Future Architectures

DTIC Science & Technology

2014-08-01

14. SUBJECT TERMS computing architecture, graph algorithms, high-performance computing, big data , GPU 15. NUMBER OF PAGES 44 16. PRICE CODE 17...at Vertex 1 6 Figure 4: Data Structures Created by Kernel 1 of Single CPU, List Implementation Using the Graph in the Example from Section 1.2 9...Figure 5: Kernel 2 of Graph500 BFS Reference Implementation: Single CPU, List 10 Figure 6: Data Structures for Sequential CSR Algorithm 12 Figure 7

Statistics of Gaussian packets on metric and decorated graphs.

PubMed

Chernyshev, V L; Shafarevich, A I

2014-01-28

We study a semiclassical asymptotics of the Cauchy problem for a time-dependent Schrödinger equation on metric and decorated graphs with a localized initial function. A decorated graph is a topological space obtained from a graph via replacing vertices with smooth Riemannian manifolds. The main term of an asymptotic solution at an arbitrary finite time is a sum of Gaussian packets and generalized Gaussian packets (localized near a certain set of codimension one). We study the number of packets as time tends to infinity. We prove that under certain assumptions this number grows in time as a polynomial and packets fill the graph uniformly. We discuss a simple example of the opposite situation: in this case, a numerical experiment shows a subexponential growth.

Using ontology network structure in text mining.

PubMed

Berndt, Donald J; McCart, James A; Luther, Stephen L

2010-11-13

Statistical text mining treats documents as bags of words, with a focus on term frequencies within documents and across document collections. Unlike natural language processing (NLP) techniques that rely on an engineered vocabulary or a full-featured ontology, statistical approaches do not make use of domain-specific knowledge. The freedom from biases can be an advantage, but at the cost of ignoring potentially valuable knowledge. The approach proposed here investigates a hybrid strategy based on computing graph measures of term importance over an entire ontology and injecting the measures into the statistical text mining process. As a starting point, we adapt existing search engine algorithms such as PageRank and HITS to determine term importance within an ontology graph. The graph-theoretic approach is evaluated using a smoking data set from the i2b2 National Center for Biomedical Computing, cast as a simple binary classification task for categorizing smoking-related documents, demonstrating consistent improvements in accuracy.

Global Patch Matching

NASA Astrophysics Data System (ADS)

Huang, X.; Hu, K.; Ling, X.; Zhang, Y.; Lu, Z.; Zhou, G.

2017-09-01

This paper introduces a novel global patch matching method that focuses on how to remove fronto-parallel bias and obtain continuous smooth surfaces with assuming that the scenes covered by stereos are piecewise continuous. Firstly, simple linear iterative cluster method (SLIC) is used to segment the base image into a series of patches. Then, a global energy function, which consists of a data term and a smoothness term, is built on the patches. The data term is the second-order Taylor expansion of correlation coefficients, and the smoothness term is built by combing connectivity constraints and the coplanarity constraints are combined to construct the smoothness term. Finally, the global energy function can be built by combining the data term and the smoothness term. We rewrite the global energy function in a quadratic matrix function, and use least square methods to obtain the optimal solution. Experiments on Adirondack stereo and Motorcycle stereo of Middlebury benchmark show that the proposed method can remove fronto-parallel bias effectively, and produce continuous smooth surfaces.

Solving graph data issues using a layered architecture approach with applications to web spam detection.

PubMed

Scarselli, Franco; Tsoi, Ah Chung; Hagenbuchner, Markus; Noi, Lucia Di

2013-12-01

This paper proposes the combination of two state-of-the-art algorithms for processing graph input data, viz., the probabilistic mapping graph self organizing map, an unsupervised learning approach, and the graph neural network, a supervised learning approach. We organize these two algorithms in a cascade architecture containing a probabilistic mapping graph self organizing map, and a graph neural network. We show that this combined approach helps us to limit the long-term dependency problem that exists when training the graph neural network resulting in an overall improvement in performance. This is demonstrated in an application to a benchmark problem requiring the detection of spam in a relatively large set of web sites. It is found that the proposed method produces results which reach the state of the art when compared with some of the best results obtained by others using quite different approaches. A particular strength of our method is its applicability towards any input domain which can be represented as a graph. Copyright © 2013 Elsevier Ltd. All rights reserved.

The Grammatical Universe and the Laws of Thermodynamics and Quantum Entanglement

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

Marcer, Peter J.; Rowlands, Peter

2010-11-24

The universal nilpotent computational rewrite system (UNCRS) is shown to formalize an irreversible process of evolution in conformity with the First, Second and Third Laws of Thermodynamics, in terms of a single algebraic creation operator (ikE+ip+jm) which delivers the whole quantum mechanical language apparatus, where k, i, j are quaternions units and E, p, m are energy, momentum and rest mass. This nilpotent evolution describes 'a dynamic zero totality universe' in terms of its fermion states (each of which, by Pauli exclusion, is unique and nonzero), where, together with their boson interactions, these define physics at the fundamental level. (Themore » UNCRS implies that the inseparability of objects and fields in the quantum universe is based on the fact that the only valid mathematical representations are all automorphisms of the universe itself, and that this is the mathematical meaning of quantum entanglement. It thus appears that the nilpotent fermion states are in fact what is called the splitting field in Quantum Mechanics of the Galois group which leads to the roots of the corresponding algebraic equation, and concerns in this case the alternating group of even permutations which are themselves automorphisms). In the nilpotent evolutionary process: (i) the Quantum Carnot Engine (QCE) extended model of thermodynamic irreversibility, consisting of a single heat bath of an ensemble of Standard Model elementary particles, retains a small amount of quantum coherence / entanglement, so as to constitute new emergent fermion states of matter, and (ii) the metric (E{sup 2}-p{sup 2}m{sup 2}) = 0 ensures the First Law of the conservation of energy operates at each nilpotent stage, so that (iii) prior to each creation (and implied corresponding annihilation / conserve operation), E and m can be postulated to constitute dark energy and matter respectively. It says that the natural language form of the rewrite grammar of the evolution consists of the well known precepts of the Laws of Thermodynamics, formalized by the UNCRS regress, so as to become (as UNCRS rewrites already published at CASYS), firstly the Quantum Laws of Physics in the form of the generalized Dirac equation and later at higher stages of QCE ensemble complexity, the Laws of Life in the form of Nature's (DNA / RNA genetic) Code and then subsequently those of Intelligence and Consciousness (Nature's Rules).« less

Navigability of Random Geometric Graphs in the Universe and Other Spacetimes.

PubMed

Cunningham, William; Zuev, Konstantin; Krioukov, Dmitri

2017-08-18

Random geometric graphs in hyperbolic spaces explain many common structural and dynamical properties of real networks, yet they fail to predict the correct values of the exponents of power-law degree distributions observed in real networks. In that respect, random geometric graphs in asymptotically de Sitter spacetimes, such as the Lorentzian spacetime of our accelerating universe, are more attractive as their predictions are more consistent with observations in real networks. Yet another important property of hyperbolic graphs is their navigability, and it remains unclear if de Sitter graphs are as navigable as hyperbolic ones. Here we study the navigability of random geometric graphs in three Lorentzian manifolds corresponding to universes filled only with dark energy (de Sitter spacetime), only with matter, and with a mixture of dark energy and matter. We find these graphs are navigable only in the manifolds with dark energy. This result implies that, in terms of navigability, random geometric graphs in asymptotically de Sitter spacetimes are as good as random hyperbolic graphs. It also establishes a connection between the presence of dark energy and navigability of the discretized causal structure of spacetime, which provides a basis for a different approach to the dark energy problem in cosmology.

K-theory of locally finite graph C∗-algebras

NASA Astrophysics Data System (ADS)

Iyudu, Natalia

2013-09-01

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

Exclusivity structures and graph representatives of local complementation orbits

NASA Astrophysics Data System (ADS)

Cabello, Adán; Parker, Matthew G.; Scarpa, Giannicola; Severini, Simone

2013-07-01

We describe a construction that maps any connected graph G on three or more vertices into a larger graph, H(G), whose independence number is strictly smaller than its Lovász number which is equal to its fractional packing number. The vertices of H(G) represent all possible events consistent with the stabilizer group of the graph state associated with G, and exclusive events are adjacent. Mathematically, the graph H(G) corresponds to the orbit of G under local complementation. Physically, the construction translates into graph-theoretic terms the connection between a graph state and a Bell inequality maximally violated by quantum mechanics. In the context of zero-error information theory, the construction suggests a protocol achieving the maximum rate of entanglement-assisted capacity, a quantum mechanical analogue of the Shannon capacity, for each H(G). The violation of the Bell inequality is expressed by the one-shot version of this capacity being strictly larger than the independence number. Finally, given the correspondence between graphs and exclusivity structures, we are able to compute the independence number for certain infinite families of graphs with the use of quantum non-locality, therefore highlighting an application of quantum theory in the proof of a purely combinatorial statement.

Edge connectivity and the spectral gap of combinatorial and quantum graphs

NASA Astrophysics Data System (ADS)

Berkolaiko, Gregory; Kennedy, James B.; Kurasov, Pavel; Mugnolo, Delio

2017-09-01

We derive a number of upper and lower bounds for the first nontrivial eigenvalue of Laplacians on combinatorial and quantum graph in terms of the edge connectivity, i.e. the minimal number of edges which need to be removed to make the graph disconnected. On combinatorial graphs, one of the bounds corresponds to a well-known inequality of Fiedler, of which we give a new variational proof. On quantum graphs, the corresponding bound generalizes a recent result of Band and Lévy. All proofs are general enough to yield corresponding estimates for the p-Laplacian and allow us to identify the minimizers. Based on the Betti number of the graph, we also derive upper and lower bounds on all eigenvalues which are ‘asymptotically correct’, i.e. agree with the Weyl asymptotics for the eigenvalues of the quantum graph. In particular, the lower bounds improve the bounds of Friedlander on any given graph for all but finitely many eigenvalues, while the upper bounds improve recent results of Ariturk. Our estimates are also used to derive bounds on the eigenvalues of the normalized Laplacian matrix that improve known bounds of spectral graph theory.

The Edge-Disjoint Path Problem on Random Graphs by Message-Passing.

PubMed

Altarelli, Fabrizio; Braunstein, Alfredo; Dall'Asta, Luca; De Bacco, Caterina; Franz, Silvio

2015-01-01

We present a message-passing algorithm to solve a series of edge-disjoint path problems on graphs based on the zero-temperature cavity equations. Edge-disjoint paths problems are important in the general context of routing, that can be defined by incorporating under a unique framework both traffic optimization and total path length minimization. The computation of the cavity equations can be performed efficiently by exploiting a mapping of a generalized edge-disjoint path problem on a star graph onto a weighted maximum matching problem. We perform extensive numerical simulations on random graphs of various types to test the performance both in terms of path length minimization and maximization of the number of accommodated paths. In addition, we test the performance on benchmark instances on various graphs by comparison with state-of-the-art algorithms and results found in the literature. Our message-passing algorithm always outperforms the others in terms of the number of accommodated paths when considering non trivial instances (otherwise it gives the same trivial results). Remarkably, the largest improvement in performance with respect to the other methods employed is found in the case of benchmarks with meshes, where the validity hypothesis behind message-passing is expected to worsen. In these cases, even though the exact message-passing equations do not converge, by introducing a reinforcement parameter to force convergence towards a sub optimal solution, we were able to always outperform the other algorithms with a peak of 27% performance improvement in terms of accommodated paths. On random graphs, we numerically observe two separated regimes: one in which all paths can be accommodated and one in which this is not possible. We also investigate the behavior of both the number of paths to be accommodated and their minimum total length.

The Edge-Disjoint Path Problem on Random Graphs by Message-Passing

PubMed Central

2015-01-01

We present a message-passing algorithm to solve a series of edge-disjoint path problems on graphs based on the zero-temperature cavity equations. Edge-disjoint paths problems are important in the general context of routing, that can be defined by incorporating under a unique framework both traffic optimization and total path length minimization. The computation of the cavity equations can be performed efficiently by exploiting a mapping of a generalized edge-disjoint path problem on a star graph onto a weighted maximum matching problem. We perform extensive numerical simulations on random graphs of various types to test the performance both in terms of path length minimization and maximization of the number of accommodated paths. In addition, we test the performance on benchmark instances on various graphs by comparison with state-of-the-art algorithms and results found in the literature. Our message-passing algorithm always outperforms the others in terms of the number of accommodated paths when considering non trivial instances (otherwise it gives the same trivial results). Remarkably, the largest improvement in performance with respect to the other methods employed is found in the case of benchmarks with meshes, where the validity hypothesis behind message-passing is expected to worsen. In these cases, even though the exact message-passing equations do not converge, by introducing a reinforcement parameter to force convergence towards a sub optimal solution, we were able to always outperform the other algorithms with a peak of 27% performance improvement in terms of accommodated paths. On random graphs, we numerically observe two separated regimes: one in which all paths can be accommodated and one in which this is not possible. We also investigate the behavior of both the number of paths to be accommodated and their minimum total length. PMID:26710102

The graph neural network model.

PubMed

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

2009-01-01

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

A system for routing arbitrary directed graphs on SIMD architectures

NASA Technical Reports Server (NTRS)

Tomboulian, Sherryl

1987-01-01

There are many problems which can be described in terms of directed graphs that contain a large number of vertices where simple computations occur using data from connecting vertices. A method is given for parallelizing such problems on an SIMD machine model that is bit-serial and uses only nearest neighbor connections for communication. Each vertex of the graph will be assigned to a processor in the machine. Algorithms are given that will be used to implement movement of data along the arcs of the graph. This architecture and algorithms define a system that is relatively simple to build and can do graph processing. All arcs can be transversed in parallel in time O(T), where T is empirically proportional to the diameter of the interconnection network times the average degree of the graph. Modifying or adding a new arc takes the same time as parallel traversal.

Sustainable Supply Chain Design by the P-Graph Framework

EPA Science Inventory

The present work proposes a computer-aided methodology for designing sustainable supply chains in terms of sustainability metrics by resorting to the P-graph framework. The methodology is an outcome of the collaboration between the Office of Research and Development (ORD) of the ...

What energy functions can be minimized via graph cuts?

PubMed

Kolmogorov, Vladimir; Zabih, Ramin

2004-02-01

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

Introduction to the Natural Anticipator and the Artificial Anticipator

NASA Astrophysics Data System (ADS)

Dubois, Daniel M.

2010-11-01

This short communication deals with the introduction of the concept of anticipator, which is one who anticipates, in the framework of computing anticipatory systems. The definition of anticipation deals with the concept of program. Indeed, the word program, comes from "pro-gram" meaning "to write before" by anticipation, and means a plan for the programming of a mechanism, or a sequence of coded instructions that can be inserted into a mechanism, or a sequence of coded instructions, as genes or behavioural responses, that is part of an organism. Any natural or artificial programs are thus related to anticipatory rewriting systems, as shown in this paper. All the cells in the body, and the neurons in the brain, are programmed by the anticipatory genetic code, DNA, in a low-level language with four signs. The programs in computers are also computing anticipatory systems. It will be shown, at one hand, that the genetic code DNA is a natural anticipator. As demonstrated by Nobel laureate McClintock [8], genomes are programmed. The fundamental program deals with the DNA genetic code. The properties of the DNA consist in self-replication and self-modification. The self-replicating process leads to reproduction of the species, while the self-modifying process leads to new species or evolution and adaptation in existing ones. The genetic code DNA keeps its instructions in memory in the DNA coding molecule. The genetic code DNA is a rewriting system, from DNA coding to DNA template molecule. The DNA template molecule is a rewriting system to the Messenger RNA molecule. The information is not destroyed during the execution of the rewriting program. On the other hand, it will be demonstrated that Turing machine is an artificial anticipator. The Turing machine is a rewriting system. The head reads and writes, modifying the content of the tape. The information is destroyed during the execution of the program. This is an irreversible process. The input data are lost.

Exotic equilibria of Harary graphs and a new minimum degree lower bound for synchronization

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

Canale, Eduardo A., E-mail: ecanale@pol.una.py; Monzón, Pablo, E-mail: monzon@fing.edu.uy

2015-02-15

This work is concerned with stability of equilibria in the homogeneous (equal frequencies) Kuramoto model of weakly coupled oscillators. In 2012 [R. Taylor, J. Phys. A: Math. Theor. 45, 1–15 (2012)], a sufficient condition for almost global synchronization was found in terms of the minimum degree–order ratio of the graph. In this work, a new lower bound for this ratio is given. The improvement is achieved by a concrete infinite sequence of regular graphs. Besides, non standard unstable equilibria of the graphs studied in Wiley et al. [Chaos 16, 015103 (2006)] are shown to exist as conjectured in that work.

Counting the number of Feynman graphs in QCD

NASA Astrophysics Data System (ADS)

Kaneko, T.

2018-05-01

Information about the number of Feynman graphs for a given physical process in a given field theory is especially useful for confirming the result of a Feynman graph generator used in an automatic system of perturbative calculations. A method of counting the number of Feynman graphs with weight of symmetry factor was established based on zero-dimensional field theory, and was used in scalar theories and QED. In this article this method is generalized to more complicated models by direct calculation of generating functions on a computer algebra system. This method is applied to QCD with and without counter terms, where many higher order are being calculated automatically.

The Effective Resistance of the -Cycle Graph with Four Nearest Neighbors

NASA Astrophysics Data System (ADS)

Chair, Noureddine

2014-02-01

The exact expression for the effective resistance between any two vertices of the -cycle graph with four nearest neighbors , is given. It turns out that this expression is written in terms of the effective resistance of the -cycle graph , the square of the Fibonacci numbers, and the bisected Fibonacci numbers. As a consequence closed form formulas for the total effective resistance, the first passage time, and the mean first passage time for the simple random walk on the the -cycle graph with four nearest neighbors are obtained. Finally, a closed form formula for the effective resistance of with all first neighbors removed is obtained.

Many-core graph analytics using accelerated sparse linear algebra routines

NASA Astrophysics Data System (ADS)

Kozacik, Stephen; Paolini, Aaron L.; Fox, Paul; Kelmelis, Eric

2016-05-01

Graph analytics is a key component in identifying emerging trends and threats in many real-world applications. Largescale graph analytics frameworks provide a convenient and highly-scalable platform for developing algorithms to analyze large datasets. Although conceptually scalable, these techniques exhibit poor performance on modern computational hardware. Another model of graph computation has emerged that promises improved performance and scalability by using abstract linear algebra operations as the basis for graph analysis as laid out by the GraphBLAS standard. By using sparse linear algebra as the basis, existing highly efficient algorithms can be adapted to perform computations on the graph. This approach, however, is often less intuitive to graph analytics experts, who are accustomed to vertex-centric APIs such as Giraph, GraphX, and Tinkerpop. We are developing an implementation of the high-level operations supported by these APIs in terms of linear algebra operations. This implementation is be backed by many-core implementations of the fundamental GraphBLAS operations required, and offers the advantages of both the intuitive programming model of a vertex-centric API and the performance of a sparse linear algebra implementation. This technology can reduce the number of nodes required, as well as the run-time for a graph analysis problem, enabling customers to perform more complex analysis with less hardware at lower cost. All of this can be accomplished without the requirement for the customer to make any changes to their analytics code, thanks to the compatibility with existing graph APIs.

Multi-parametric centrality method for graph network models

NASA Astrophysics Data System (ADS)

Ivanov, Sergei Evgenievich; Gorlushkina, Natalia Nikolaevna; Ivanova, Lubov Nikolaevna

2018-04-01

The graph model networks are investigated to determine centrality, weights and the significance of vertices. For centrality analysis appliesa typical method that includesany one of the properties of graph vertices. In graph theory, methods of analyzing centrality are used: in terms by degree, closeness, betweenness, radiality, eccentricity, page-rank, status, Katz and eigenvector. We have proposed a new method of multi-parametric centrality, which includes a number of basic properties of the network member. The mathematical model of multi-parametric centrality method is developed. Comparison of results for the presented method with the centrality methods is carried out. For evaluate the results for the multi-parametric centrality methodthe graph model with hundreds of vertices is analyzed. The comparative analysis showed the accuracy of presented method, includes simultaneously a number of basic properties of vertices.

Enhancing Community Detection By Affinity-based Edge Weighting Scheme

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

Yoo, Andy; Sanders, Geoffrey; Henson, Van

Community detection refers to an important graph analytics problem of finding a set of densely-connected subgraphs in a graph and has gained a great deal of interest recently. The performance of current community detection algorithms is limited by an inherent constraint of unweighted graphs that offer very little information on their internal community structures. In this paper, we propose a new scheme to address this issue that weights the edges in a given graph based on recently proposed vertex affinity. The vertex affinity quantifies the proximity between two vertices in terms of their clustering strength, and therefore, it is idealmore » for graph analytics applications such as community detection. We also demonstrate that the affinity-based edge weighting scheme can improve the performance of community detection algorithms significantly.« less

Preparing a Sublanguage Grammar

DTIC Science & Technology

1991-10-31

new BNFs based on the Navy CASREP data. Rewriting of BNF Options Rewriting Options for Subordinate Clause Strings Originally, SUB6 and SUB7 were "rare...the CASREP data, we found it necessary to derarify the expansions of SUB6 and SUB7 in CSSTG. An Example or Svibordinate Clauses SUB6 expands to a CS6... SUB7 was derarified to account for the sentences in (7). (7) a. [Testa 4.1]: WHILE DIESEL WAS OPERATING WITH SAC DISENGAGED, SAC LO ALARM SOUNDED. b

Proof of Concept for the Rewrite Rule Machine: Interensemble Studies

DTIC Science & Technology

1994-02-23

34 -,,, S2 •fbo fibo 0 1 Figure 1: Concurrent Rewriting of Fibonacci Expressions exploit a problem’s parallelism at several levels. We call this...property multigrain concurrency; it makes the RRM very well suited for solving not only homogeneous problems, but also complex, locally homogeneous but...interprocessor message passing over a network-is not well suited to data parallelism. A key goal of the RRM is to combine the best of these two approaches in a

Rewritable Optical Storage with a Spiropyran Doped Liquid Crystal Polymer Film.

PubMed

Petriashvili, Gia; De Santo, Maria Penelope; Devadze, Lali; Zurabishvili, Tsisana; Sepashvili, Nino; Gary, Ramla; Barberi, Riccardo

2016-03-01

Rewritable optical storage has been obtained in a spiropyran doped liquid crystal polymer films. Pictures can be recorded on films upon irradiation with UV light passing through a grayscale mask and they can be rapidly erased using visible light. Films present improved photosensitivity and optical contrast, good resistance to photofatigue, and high spatial resolution. These photochromic films work as a multifunctional, dynamic photosensitive material with a real-time image recording feature. © 2016 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

The European space debris safety and mitigation standard

NASA Astrophysics Data System (ADS)

Alby, F.; Alwes, D.; Anselmo, L.; Baccini, H.; Bonnal, C.; Crowther, R.; Flury, W.; Jehn, R.; Klinkrad, H.; Portelli, C.; Tremayne-Smith, R.

2001-10-01

A standard has been proposed as one of the series of ECSS Standards intended to be applied together for the management, engineering and product assurance in space projects and applications. The requirements in the Standard are defined in terms of what must be accomplished, rather than in terms of how to organise and perform the necessary work. This allows existing organisational structures and methods within agencies and industry to be applied where they are effective, and for such structures and methods to evolve as necessary, without the need for rewriting the standards. The Standard comprises management requirements, design requirements and operational requirements. The standard was prepared by the European Debris Mitigation Standard Working Group (EDMSWG) involving members from ASI, BNSC, CNES, DLR and ESA.

Synthesis of Sustainable Energy Supply Chain by the P-Graph Framework

EPA Science Inventory

The present work proposes a computer-aided methodology for designing sustainable supply chains in terms of sustainability metrics by utilizing the P-graph framework. The methodology is an outcome of the collaboration between the Office of Research and Development (ORD) of the U.S...

Eigenvalue asymptotics for the damped wave equation on metric graphs

NASA Astrophysics Data System (ADS)

Freitas, Pedro; Lipovský, Jiří

2017-09-01

We consider the linear damped wave equation on finite metric graphs and analyse its spectral properties with an emphasis on the asymptotic behaviour of eigenvalues. In the case of equilateral graphs and standard coupling conditions we show that there is only a finite number of high-frequency abscissas, whose location is solely determined by the averages of the damping terms on each edge. We further describe some of the possible behaviour when the edge lengths are no longer necessarily equal but remain commensurate.

New methods for analyzing semantic graph based assessments in science education

NASA Astrophysics Data System (ADS)

Vikaros, Lance Steven

This research investigated how the scoring of semantic graphs (known by many as concept maps) could be improved and automated in order to address issues of inter-rater reliability and scalability. As part of the NSF funded SENSE-IT project to introduce secondary school science students to sensor networks (NSF Grant No. 0833440), semantic graphs illustrating how temperature change affects water ecology were collected from 221 students across 16 schools. The graphing task did not constrain students' use of terms, as is often done with semantic graph based assessment due to coding and scoring concerns. The graphing software used provided real-time feedback to help students learn how to construct graphs, stay on topic and effectively communicate ideas. The collected graphs were scored by human raters using assessment methods expected to boost reliability, which included adaptations of traditional holistic and propositional scoring methods, use of expert raters, topical rubrics, and criterion graphs. High levels of inter-rater reliability were achieved, demonstrating that vocabulary constraints may not be necessary after all. To investigate a new approach to automating the scoring of graphs, thirty-two different graph features characterizing graphs' structure, semantics, configuration and process of construction were then used to predict human raters' scoring of graphs in order to identify feature patterns correlated to raters' evaluations of graphs' topical accuracy and complexity. Results led to the development of a regression model able to predict raters' scoring with 77% accuracy, with 46% accuracy expected when used to score new sets of graphs, as estimated via cross-validation tests. Although such performance is comparable to other graph and essay based scoring systems, cross-context testing of the model and methods used to develop it would be needed before it could be recommended for widespread use. Still, the findings suggest techniques for improving the reliability and scalability of semantic graph based assessments without requiring constraint of how ideas are expressed.

Addressable configurations of DNA nanostructures for rewritable memory

PubMed Central

Levchenko, Oksana; Patel, Dhruv S.; MacIsaac, Molly

2017-01-01

Abstract DNA serves as nature's information storage molecule, and has been the primary focus of engineered systems for biological computing and data storage. Here we combine recent efforts in DNA self-assembly and toehold-mediated strand displacement to develop a rewritable multi-bit DNA memory system. The system operates by encoding information in distinct and reversible conformations of a DNA nanoswitch and decoding by gel electrophoresis. We demonstrate a 5-bit system capable of writing, erasing, and rewriting binary representations of alphanumeric symbols, as well as compatibility with ‘OR’ and ‘AND’ logic operations. Our strategy is simple to implement, requiring only a single mixing step at room temperature for each operation and standard gel electrophoresis to read the data. We envision such systems could find use in covert product labeling and barcoding, as well as secure messaging and authentication when combined with previously developed encryption strategies. Ultimately, this type of memory has exciting potential in biomedical sciences as data storage can be coupled to sensing of biological molecules. PMID:28977499

Printable and Rewritable Full Block Copolymer Structural Color.

PubMed

Kang, Han Sol; Lee, Jinseong; Cho, Suk Man; Park, Tae Hyun; Kim, Min Ju; Park, Chanho; Lee, Seung Won; Kim, Kang Lib; Ryu, Du Yeol; Huh, June; Thomas, Edwin L; Park, Cheolmin

2017-08-01

Structural colors (SCs) of photonic crystals (PCs) arise from selective constructive interference of incident light. Here, an ink-jet printable and rewritable block copolymer (BCP) SC display is demonstrated, which can be quickly written and erased over 50 times with resolution nearly equivalent to that obtained with a commercial office ink-jet printer. Moreover, the writing process employs an easily modified printer for position- and concentration-controlled deposition of a single, colorless, water-based ink containing a reversible crosslinking agent, ammonium persulfate. Deposition of the ink onto a self-assembled BCP PC film comprising a 1D stack of alternating layers enables differential swelling of the written BCP film and produces a full-colored SC display of characters and images. Furthermore, the information can be readily erased and the system can be reset by application of hydrogen bromide. Subsequently, new information can be rewritten, resulting in a chemically rewritable BCP SC display. © 2017 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

OLSVis: an animated, interactive visual browser for bio-ontologies

PubMed Central

2012-01-01

Background More than one million terms from biomedical ontologies and controlled vocabularies are available through the Ontology Lookup Service (OLS). Although OLS provides ample possibility for querying and browsing terms, the visualization of parts of the ontology graphs is rather limited and inflexible. Results We created the OLSVis web application, a visualiser for browsing all ontologies available in the OLS database. OLSVis shows customisable subgraphs of the OLS ontologies. Subgraphs are animated via a real-time force-based layout algorithm which is fully interactive: each time the user makes a change, e.g. browsing to a new term, hiding, adding, or dragging terms, the algorithm performs smooth and only essential reorganisations of the graph. This assures an optimal viewing experience, because subsequent screen layouts are not grossly altered, and users can easily navigate through the graph. URL: http://ols.wordvis.com Conclusions The OLSVis web application provides a user-friendly tool to visualise ontologies from the OLS repository. It broadens the possibilities to investigate and select ontology subgraphs through a smooth visualisation method. PMID:22646023

Evolutionary Games of Multiplayer Cooperation on Graphs

PubMed Central

Arranz, Jordi; Traulsen, Arne

2016-01-01

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

Optimal Multiple Surface Segmentation With Shape and Context Priors

PubMed Central

Bai, Junjie; Garvin, Mona K.; Sonka, Milan; Buatti, John M.; Wu, Xiaodong

2014-01-01

Segmentation of multiple surfaces in medical images is a challenging problem, further complicated by the frequent presence of weak boundary evidence, large object deformations, and mutual influence between adjacent objects. This paper reports a novel approach to multi-object segmentation that incorporates both shape and context prior knowledge in a 3-D graph-theoretic framework to help overcome the stated challenges. We employ an arc-based graph representation to incorporate a wide spectrum of prior information through pair-wise energy terms. In particular, a shape-prior term is used to penalize local shape changes and a context-prior term is used to penalize local surface-distance changes from a model of the expected shape and surface distances, respectively. The globally optimal solution for multiple surfaces is obtained by computing a maximum flow in a low-order polynomial time. The proposed method was validated on intraretinal layer segmentation of optical coherence tomography images and demonstrated statistically significant improvement of segmentation accuracy compared to our earlier graph-search method that was not utilizing shape and context priors. The mean unsigned surface positioning errors obtained by the conventional graph-search approach (6.30 ± 1.58 μm) was improved to 5.14 ± 0.99 μm when employing our new method with shape and context priors. PMID:23193309

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

PubMed Central

Elmetwaly, Shereef; Schlick, Tamar

2014-01-01

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

Bounded-Degree Approximations of Stochastic Networks

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

Quinn, Christopher J.; Pinar, Ali; Kiyavash, Negar

2017-06-01

We propose algorithms to approximate directed information graphs. Directed information graphs are probabilistic graphical models that depict causal dependencies between stochastic processes in a network. The proposed algorithms identify optimal and near-optimal approximations in terms of Kullback-Leibler divergence. The user-chosen sparsity trades off the quality of the approximation against visual conciseness and computational tractability. One class of approximations contains graphs with speci ed in-degrees. Another class additionally requires that the graph is connected. For both classes, we propose algorithms to identify the optimal approximations and also near-optimal approximations, using a novel relaxation of submodularity. We also propose algorithms to identifymore » the r-best approximations among these classes, enabling robust decision making.« less

International Conference on Computing Methods in Applied Sciences and Engineering (9th) Held in Paris, France on 29 January-2 February 1990

DTIC Science & Technology

1990-02-02

National Aero-Space Plane NTC no time counter TSS-2 Tethered Satellite System - 2 VHS variable hard sphere VSL viscous shock-layer Introduction With...required at each time step to evaluate the mass fractions Yi+’ it is shown in [21] that the matrix of this linear system is an M-matrix (see e.g. [42]), and...first rewrite system (4.7)- (4.8) under the following form, separating the time -dependent, convective, diffusive and reactive terms: VW’ + F(W)r + G(,W

Cycle/Cocycle Oblique Projections on Oriented Graphs

NASA Astrophysics Data System (ADS)

Polettini, Matteo

2015-01-01

It is well known that the edge vector space of an oriented graph can be decomposed in terms of cycles and cocycles (alias cuts, or bonds), and that a basis for the cycle and the cocycle spaces can be generated by adding and removing edges to an arbitrarily chosen spanning tree. In this paper, we show that the edge vector space can also be decomposed in terms of cycles and the generating edges of cocycles (called cochords), or of cocycles and the generating edges of cycles (called chords). From this observation follows a construction in terms of oblique complementary projection operators. We employ this algebraic construction to prove several properties of unweighted Kirchhoff-Symanzik matrices, encoding the mutual superposition between cycles and cocycles. In particular, we prove that dual matrices of planar graphs have the same spectrum (up to multiplicities). We briefly comment on how this construction provides a refined formalization of Kirchhoff's mesh analysis of electrical circuits, which has lately been applied to generic thermodynamic networks.

PRISM 3: expanded prediction of natural product chemical structures from microbial genomes

PubMed Central

Skinnider, Michael A.; Merwin, Nishanth J.; Johnston, Chad W.

2017-01-01

Abstract Microbial natural products represent a rich resource of pharmaceutically and industrially important compounds. Genome sequencing has revealed that the majority of natural products remain undiscovered, and computational methods to connect biosynthetic gene clusters to their corresponding natural products therefore have the potential to revitalize natural product discovery. Previously, we described PRediction Informatics for Secondary Metabolomes (PRISM), a combinatorial approach to chemical structure prediction for genetically encoded nonribosomal peptides and type I and II polyketides. Here, we present a ground-up rewrite of the PRISM structure prediction algorithm to derive prediction of natural products arising from non-modular biosynthetic paradigms. Within this new version, PRISM 3, natural product scaffolds are modeled as chemical graphs, permitting structure prediction for aminocoumarins, antimetabolites, bisindoles and phosphonate natural products, and building upon the addition of ribosomally synthesized and post-translationally modified peptides. Further, with the addition of cluster detection for 11 new cluster types, PRISM 3 expands to detect 22 distinct natural product cluster types. Other major modifications to PRISM include improved sequence input and ORF detection, user-friendliness and output. Distribution of PRISM 3 over a 300-core server grid improves the speed and capacity of the web application. PRISM 3 is available at http://magarveylab.ca/prism/. PMID:28460067

A Factor Graph Approach to Automated GO Annotation

PubMed Central

Spetale, Flavio E.; Tapia, Elizabeth; Krsticevic, Flavia; Roda, Fernando; Bulacio, Pilar

2016-01-01

As volume of genomic data grows, computational methods become essential for providing a first glimpse onto gene annotations. Automated Gene Ontology (GO) annotation methods based on hierarchical ensemble classification techniques are particularly interesting when interpretability of annotation results is a main concern. In these methods, raw GO-term predictions computed by base binary classifiers are leveraged by checking the consistency of predefined GO relationships. Both formal leveraging strategies, with main focus on annotation precision, and heuristic alternatives, with main focus on scalability issues, have been described in literature. In this contribution, a factor graph approach to the hierarchical ensemble formulation of the automated GO annotation problem is presented. In this formal framework, a core factor graph is first built based on the GO structure and then enriched to take into account the noisy nature of GO-term predictions. Hence, starting from raw GO-term predictions, an iterative message passing algorithm between nodes of the factor graph is used to compute marginal probabilities of target GO-terms. Evaluations on Saccharomyces cerevisiae, Arabidopsis thaliana and Drosophila melanogaster protein sequences from the GO Molecular Function domain showed significant improvements over competing approaches, even when protein sequences were naively characterized by their physicochemical and secondary structure properties or when loose noisy annotation datasets were considered. Based on these promising results and using Arabidopsis thaliana annotation data, we extend our approach to the identification of most promising molecular function annotations for a set of proteins of unknown function in Solanum lycopersicum. PMID:26771463

A Factor Graph Approach to Automated GO Annotation.

PubMed

Spetale, Flavio E; Tapia, Elizabeth; Krsticevic, Flavia; Roda, Fernando; Bulacio, Pilar

2016-01-01

As volume of genomic data grows, computational methods become essential for providing a first glimpse onto gene annotations. Automated Gene Ontology (GO) annotation methods based on hierarchical ensemble classification techniques are particularly interesting when interpretability of annotation results is a main concern. In these methods, raw GO-term predictions computed by base binary classifiers are leveraged by checking the consistency of predefined GO relationships. Both formal leveraging strategies, with main focus on annotation precision, and heuristic alternatives, with main focus on scalability issues, have been described in literature. In this contribution, a factor graph approach to the hierarchical ensemble formulation of the automated GO annotation problem is presented. In this formal framework, a core factor graph is first built based on the GO structure and then enriched to take into account the noisy nature of GO-term predictions. Hence, starting from raw GO-term predictions, an iterative message passing algorithm between nodes of the factor graph is used to compute marginal probabilities of target GO-terms. Evaluations on Saccharomyces cerevisiae, Arabidopsis thaliana and Drosophila melanogaster protein sequences from the GO Molecular Function domain showed significant improvements over competing approaches, even when protein sequences were naively characterized by their physicochemical and secondary structure properties or when loose noisy annotation datasets were considered. Based on these promising results and using Arabidopsis thaliana annotation data, we extend our approach to the identification of most promising molecular function annotations for a set of proteins of unknown function in Solanum lycopersicum.

Rewriting magnetic phase change memory by laser heating

NASA Astrophysics Data System (ADS)

Timmerwilke, John; Liou, Sy-Hwang; Cheng, Shu Fan; Edelstein, Alan S.

2016-04-01

Magnetic phase change memory (MAG PCM) consists of bits with different magnetic permeability values. The bits are read by measuring their effect on a magnetic probe field. Previously low permeability crystalline bits had been written in high permeability amorphous films of Metglas via laser heating. Here data is presented showing that by applying short laser pulses with the appropriate power to previously crystallized regions they can first be vitrified and then again crystallized. Thus, MAG PCM is rewriteable. Technical issues in processing the bits are discussed and results on thermal modeling are presented.

From Number Lines to Graphs in the Coordinate Plane: Investigating Problem Solving across Mathematical Representations

ERIC Educational Resources Information Center

Earnest, Darrell

2015-01-01

This article reports on students' problem-solving approaches across three representations--number lines, coordinate planes, and function graphs--the axes of which conventional mathematics treats in terms of consistent geometric and numeric coordinations. I consider these representations to be a part of a "hierarchical representational…

Automatic extraction of protein point mutations using a graph bigram association.

PubMed

Lee, Lawrence C; Horn, Florence; Cohen, Fred E

2007-02-02

Protein point mutations are an essential component of the evolutionary and experimental analysis of protein structure and function. While many manually curated databases attempt to index point mutations, most experimentally generated point mutations and the biological impacts of the changes are described in the peer-reviewed published literature. We describe an application, Mutation GraB (Graph Bigram), that identifies, extracts, and verifies point mutations from biomedical literature. The principal problem of point mutation extraction is to link the point mutation with its associated protein and organism of origin. Our algorithm uses a graph-based bigram traversal to identify these relevant associations and exploits the Swiss-Prot protein database to verify this information. The graph bigram method is different from other models for point mutation extraction in that it incorporates frequency and positional data of all terms in an article to drive the point mutation-protein association. Our method was tested on 589 articles describing point mutations from the G protein-coupled receptor (GPCR), tyrosine kinase, and ion channel protein families. We evaluated our graph bigram metric against a word-proximity metric for term association on datasets of full-text literature in these three different protein families. Our testing shows that the graph bigram metric achieves a higher F-measure for the GPCRs (0.79 versus 0.76), protein tyrosine kinases (0.72 versus 0.69), and ion channel transporters (0.76 versus 0.74). Importantly, in situations where more than one protein can be assigned to a point mutation and disambiguation is required, the graph bigram metric achieves a precision of 0.84 compared with the word distance metric precision of 0.73. We believe the graph bigram search metric to be a significant improvement over previous search metrics for point mutation extraction and to be applicable to text-mining application requiring the association of words.

On the Existence of t-Identifying Codes in Undirected De Bruijn Networks

DTIC Science & Technology

2015-08-04

remaining cases remain open. Additionally, we show that the eccentricity of the undirected non-binary de Bruijn graph is n. 15. SUBJECT TERMS...Additionally, we show that the eccentricity of the undirected non-binary de Bruijn graph is n. 1 Introduction and Background Let x ∈ V (G), and...we must have d(y, x) = n + 2. In other words, Theorem 2.5 tells us the eccentricity of every node in the graph B(d, n) is n for d ≥ 3, and so the

Large-scale DCMs for resting-state fMRI.

PubMed

Razi, Adeel; Seghier, Mohamed L; Zhou, Yuan; McColgan, Peter; Zeidman, Peter; Park, Hae-Jeong; Sporns, Olaf; Rees, Geraint; Friston, Karl J

2017-01-01

This paper considers the identification of large directed graphs for resting-state brain networks based on biophysical models of distributed neuronal activity, that is, effective connectivity . This identification can be contrasted with functional connectivity methods based on symmetric correlations that are ubiquitous in resting-state functional MRI (fMRI). We use spectral dynamic causal modeling (DCM) to invert large graphs comprising dozens of nodes or regions. The ensuing graphs are directed and weighted, hence providing a neurobiologically plausible characterization of connectivity in terms of excitatory and inhibitory coupling. Furthermore, we show that the use of to discover the most likely sparse graph (or model) from a parent (e.g., fully connected) graph eschews the arbitrary thresholding often applied to large symmetric (functional connectivity) graphs. Using empirical fMRI data, we show that spectral DCM furnishes connectivity estimates on large graphs that correlate strongly with the estimates provided by stochastic DCM. Furthermore, we increase the efficiency of model inversion using functional connectivity modes to place prior constraints on effective connectivity. In other words, we use a small number of modes to finesse the potentially redundant parameterization of large DCMs. We show that spectral DCM-with functional connectivity priors-is ideally suited for directed graph theoretic analyses of resting-state fMRI. We envision that directed graphs will prove useful in understanding the psychopathology and pathophysiology of neurodegenerative and neurodevelopmental disorders. We will demonstrate the utility of large directed graphs in clinical populations in subsequent reports, using the procedures described in this paper.

A comparative study of theoretical graph models for characterizing structural networks of human brain.

PubMed

Li, Xiaojin; Hu, Xintao; Jin, Changfeng; Han, Junwei; Liu, Tianming; Guo, Lei; Hao, Wei; Li, Lingjiang

2013-01-01

Previous studies have investigated both structural and functional brain networks via graph-theoretical methods. However, there is an important issue that has not been adequately discussed before: what is the optimal theoretical graph model for describing the structural networks of human brain? In this paper, we perform a comparative study to address this problem. Firstly, large-scale cortical regions of interest (ROIs) are localized by recently developed and validated brain reference system named Dense Individualized Common Connectivity-based Cortical Landmarks (DICCCOL) to address the limitations in the identification of the brain network ROIs in previous studies. Then, we construct structural brain networks based on diffusion tensor imaging (DTI) data. Afterwards, the global and local graph properties of the constructed structural brain networks are measured using the state-of-the-art graph analysis algorithms and tools and are further compared with seven popular theoretical graph models. In addition, we compare the topological properties between two graph models, namely, stickiness-index-based model (STICKY) and scale-free gene duplication model (SF-GD), that have higher similarity with the real structural brain networks in terms of global and local graph properties. Our experimental results suggest that among the seven theoretical graph models compared in this study, STICKY and SF-GD models have better performances in characterizing the structural human brain network.

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

PubMed

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

2009-07-07

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

Band connectivity for topological quantum chemistry: Band structures as a graph theory problem

NASA Astrophysics Data System (ADS)

Bradlyn, Barry; Elcoro, L.; Vergniory, M. G.; Cano, Jennifer; Wang, Zhijun; Felser, C.; Aroyo, M. I.; Bernevig, B. Andrei

2018-01-01

The conventional theory of solids is well suited to describing band structures locally near isolated points in momentum space, but struggles to capture the full, global picture necessary for understanding topological phenomena. In part of a recent paper [B. Bradlyn et al., Nature (London) 547, 298 (2017), 10.1038/nature23268], we have introduced the way to overcome this difficulty by formulating the problem of sewing together many disconnected local k .p band structures across the Brillouin zone in terms of graph theory. In this paper, we give the details of our full theoretical construction. We show that crystal symmetries strongly constrain the allowed connectivities of energy bands, and we employ graph theoretic techniques such as graph connectivity to enumerate all the solutions to these constraints. The tools of graph theory allow us to identify disconnected groups of bands in these solutions, and so identify topologically distinct insulating phases.

Edge Antimagic Total Labeling on Two Copies of Path

NASA Astrophysics Data System (ADS)

Nurdin; Abrar, A. M.; Bhayangkara, A. R. M.; Muliani; Samsir, A. U.; Nahdi, M. R. An

2018-03-01

A graph G = (V(G), E(G)) denotes the vertex set and the edge set, respectively. A (p,q)-graph G is a graph such that |V(G) | = p and |E(G) | = q. Graph of order p and size q is called (a,d)-edge-anti magic total if there exists a bijection f : V(G) U E(G)→ {1,2,..., p + q} such that the edge weights w(u,v) = f(u) + f(uv) + f(v) form an arithmetic sequence {a, a + d, a + 2d,...,a + (q - 1)d} with the first term a and common difference d. Two copies of path is disjoint union of two path graph with same order (Pn ∪Pn ) denoted by 2Pn . In this paper we construct the (a,d)-edge-anti magic total labeling in two copies of path for some differences d.

Fault-tolerant dynamic task graph scheduling

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

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

2014-11-16

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

Graph theory as a proxy for spatially explicit population models in conservation planning.

PubMed

Minor, Emily S; Urban, Dean L

2007-09-01

Spatially explicit population models (SEPMs) are often considered the best way to predict and manage species distributions in spatially heterogeneous landscapes. However, they are computationally intensive and require extensive knowledge of species' biology and behavior, limiting their application in many cases. An alternative to SEPMs is graph theory, which has minimal data requirements and efficient algorithms. Although only recently introduced to landscape ecology, graph theory is well suited to ecological applications concerned with connectivity or movement. This paper compares the performance of graph theory to a SEPM in selecting important habitat patches for Wood Thrush (Hylocichla mustelina) conservation. We use both models to identify habitat patches that act as population sources and persistent patches and also use graph theory to identify patches that act as stepping stones for dispersal. Correlations of patch rankings were very high between the two models. In addition, graph theory offers the ability to identify patches that are very important to habitat connectivity and thus long-term population persistence across the landscape. We show that graph theory makes very similar predictions in most cases and in other cases offers insight not available from the SEPM, and we conclude that graph theory is a suitable and possibly preferable alternative to SEPMs for species conservation in heterogeneous landscapes.

Partitioning sparse matrices with eigenvectors of graphs

NASA Technical Reports Server (NTRS)

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

1990-01-01

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

Weighted graph cuts without eigenvectors a multilevel approach.

PubMed

Dhillon, Inderjit S; Guan, Yuqiang; Kulis, Brian

2007-11-01

A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods. In this paper, we discuss an equivalence between the objective functions used in these seemingly different methods--in particular, a general weighted kernel k-means objective is mathematically equivalent to a weighted graph clustering objective. We exploit this equivalence to develop a fast, high-quality multilevel algorithm that directly optimizes various weighted graph clustering objectives, such as the popular ratio cut, normalized cut, and ratio association criteria. This eliminates the need for any eigenvector computation for graph clustering problems, which can be prohibitive for very large graphs. Previous multilevel graph partitioning methods, such as Metis, have suffered from the restriction of equal-sized clusters; our multilevel algorithm removes this restriction by using kernel k-means to optimize weighted graph cuts. Experimental results show that our multilevel algorithm outperforms a state-of-the-art spectral clustering algorithm in terms of speed, memory usage, and quality. We demonstrate that our algorithm is applicable to large-scale clustering tasks such as image segmentation, social network analysis and gene network analysis.

High-order graph matching based feature selection for Alzheimer's disease identification.

PubMed

Liu, Feng; Suk, Heung-Il; Wee, Chong-Yaw; Chen, Huafu; Shen, Dinggang

2013-01-01

One of the main limitations of l1-norm feature selection is that it focuses on estimating the target vector for each sample individually without considering relations with other samples. However, it's believed that the geometrical relation among target vectors in the training set may provide useful information, and it would be natural to expect that the predicted vectors have similar geometric relations as the target vectors. To overcome these limitations, we formulate this as a graph-matching feature selection problem between a predicted graph and a target graph. In the predicted graph a node is represented by predicted vector that may describe regional gray matter volume or cortical thickness features, and in the target graph a node is represented by target vector that include class label and clinical scores. In particular, we devise new regularization terms in sparse representation to impose high-order graph matching between the target vectors and the predicted ones. Finally, the selected regional gray matter volume and cortical thickness features are fused in kernel space for classification. Using the ADNI dataset, we evaluate the effectiveness of the proposed method and obtain the accuracies of 92.17% and 81.57% in AD and MCI classification, respectively.

GraphMeta: Managing HPC Rich Metadata in Graphs

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

Dai, Dong; Chen, Yong; Carns, Philip

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

Chaotic Traversal (CHAT): Very Large Graphs Traversal Using Chaotic Dynamics

NASA Astrophysics Data System (ADS)

Changaival, Boonyarit; Rosalie, Martin; Danoy, Grégoire; Lavangnananda, Kittichai; Bouvry, Pascal

2017-12-01

Graph Traversal algorithms can find their applications in various fields such as routing problems, natural language processing or even database querying. The exploration can be considered as a first stepping stone into knowledge extraction from the graph which is now a popular topic. Classical solutions such as Breadth First Search (BFS) and Depth First Search (DFS) require huge amounts of memory for exploring very large graphs. In this research, we present a novel memoryless graph traversal algorithm, Chaotic Traversal (CHAT) which integrates chaotic dynamics to traverse large unknown graphs via the Lozi map and the Rössler system. To compare various dynamics effects on our algorithm, we present an original way to perform the exploration of a parameter space using a bifurcation diagram with respect to the topological structure of attractors. The resulting algorithm is an efficient and nonresource demanding algorithm, and is therefore very suitable for partial traversal of very large and/or unknown environment graphs. CHAT performance using Lozi map is proven superior than the, commonly known, Random Walk, in terms of number of nodes visited (coverage percentage) and computation time where the environment is unknown and memory usage is restricted.

Bounds for percolation thresholds on directed and undirected graphs

NASA Astrophysics Data System (ADS)

Hamilton, Kathleen; Pryadko, Leonid

2015-03-01

Percolation theory is an efficient approach to problems with strong disorder, e.g., in quantum or classical transport, composite materials, and diluted magnets. Recently, the growing role of big data in scientific and industrial applications has led to a renewed interest in graph theory as a tool for describing complex connections in various kinds of networks: social, biological, technological, etc. In particular, percolation on graphs has been used to describe internet stability, spread of contagious diseases and computer viruses; related models describe market crashes and viral spread in social networks. We consider site-dependent percolation on directed and undirected graphs, and present several exact bounds for location of the percolation transition in terms of the eigenvalues of matrices associated with graphs, including the adjacency matrix and the Hashimoto matrix used to enumerate non-backtracking walks. These bounds correspond t0 a mean field approximation and become asymptotically exact for graphs with no short cycles. We illustrate this convergence numerically by simulating percolation on several families of graphs with different cycle lengths. This research was supported in part by the NSF Grant PHY-1416578 and by the ARO Grant W911NF-11-1-0027.

A simple method for finding the scattering coefficients of quantum graphs

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

Cottrell, Seth S.

2015-09-15

Quantum walks are roughly analogous to classical random walks, and similar to classical walks they have been used to find new (quantum) algorithms. When studying the behavior of large graphs or combinations of graphs, it is useful to find the response of a subgraph to signals of different frequencies. In doing so, we can replace an entire subgraph with a single vertex with variable scattering coefficients. In this paper, a simple technique for quickly finding the scattering coefficients of any discrete-time quantum graph will be presented. These scattering coefficients can be expressed entirely in terms of the characteristic polynomial ofmore » the graph’s time step operator. This is a marked improvement over previous techniques which have traditionally required finding eigenstates for a given eigenvalue, which is far more computationally costly. With the scattering coefficients we can easily derive the “impulse response” which is the key to predicting the response of a graph to any signal. This gives us a powerful set of tools for rapidly understanding the behavior of graphs or for reducing a large graph into its constituent subgraphs regardless of how they are connected.« less

A Model of Knowledge Based Information Retrieval with Hierarchical Concept Graph.

ERIC Educational Resources Information Center

Kim, Young Whan; Kim, Jin H.

1990-01-01

Proposes a model of knowledge-based information retrieval (KBIR) that is based on a hierarchical concept graph (HCG) which shows relationships between index terms and constitutes a hierarchical thesaurus as a knowledge base. Conceptual distance between a query and an object is discussed and the use of Boolean operators is described. (25…

Evaluation of Teaching the IS-LM Model through a Simulation Program

ERIC Educational Resources Information Center

Pablo-Romero, Maria del Populo; Pozo-Barajas, Rafael; Gomez-Calero, Maria de la Palma

2012-01-01

The IS-ML model is a basic tool used in the teaching of short-term macroeconomics. Teaching is essentially done through the use of graphs. However, the way these graphs are traditionally taught does not allow the learner to easily visualise changes in the curves. The IS-LM simulation program overcomes difficulties encountered in understanding the…

Endowing Hydrochromism to Fluorans via Bioinspired Alteration of Molecular Structures and Microenvironments and Expanding Their Potential for Rewritable Paper.

PubMed

Xi, Guan; Sheng, Lan; Zhang, Ivan; Du, Jiahui; Zhang, Ting; Chen, Qiaonan; Li, Guiying; Zhang, Ying; Song, Yue; Li, Jianhua; Zhang, Yu-Mo; Zhang, Sean Xiao-An

2017-11-01

Interest and effort toward new materials for rewritable paper have increased dramatically because of the exciting advantages for sustainable development and better nature life cycle. Inspired by how nature works within living systems, herein, we have used fluorans, as a concept verification, to endow original acidochromic, basochromic or photochromic molecules with broader properties, such as switchable with solvent, water, heat, electricity, stress, other force, etc., via simplified methods (i.e., via variation of submolecular structure or microenvironments). The hydrochromic visual change and reversible behavior of selected molecules have been explored, and the primary mechanism at the atomic or subatomic level has been hypothesized. In addition, several newly demonstrated hydrochromic fluorans have been utilized for water-jet rewritable paper (WJRP), which exhibit great photostability, high hydrochromic contrast, and fast responsive rate and which can be reused at least 30 times without significant variation. The water-jet prints have good resolution and various colors and can keep legibility after a few months or years. This improved performance is a major step toward practical applications of WJRP.

Addressable configurations of DNA nanostructures for rewritable memory.

PubMed

Chandrasekaran, Arun Richard; Levchenko, Oksana; Patel, Dhruv S; MacIsaac, Molly; Halvorsen, Ken

2017-11-02

DNA serves as nature's information storage molecule, and has been the primary focus of engineered systems for biological computing and data storage. Here we combine recent efforts in DNA self-assembly and toehold-mediated strand displacement to develop a rewritable multi-bit DNA memory system. The system operates by encoding information in distinct and reversible conformations of a DNA nanoswitch and decoding by gel electrophoresis. We demonstrate a 5-bit system capable of writing, erasing, and rewriting binary representations of alphanumeric symbols, as well as compatibility with 'OR' and 'AND' logic operations. Our strategy is simple to implement, requiring only a single mixing step at room temperature for each operation and standard gel electrophoresis to read the data. We envision such systems could find use in covert product labeling and barcoding, as well as secure messaging and authentication when combined with previously developed encryption strategies. Ultimately, this type of memory has exciting potential in biomedical sciences as data storage can be coupled to sensing of biological molecules. © The Author(s) 2017. Published by Oxford University Press on behalf of Nucleic Acids Research.

Graph-based segmentation for RGB-D data using 3-D geometry enhanced superpixels.

PubMed

Yang, Jingyu; Gan, Ziqiao; Li, Kun; Hou, Chunping

2015-05-01

With the advances of depth sensing technologies, color image plus depth information (referred to as RGB-D data hereafter) is more and more popular for comprehensive description of 3-D scenes. This paper proposes a two-stage segmentation method for RGB-D data: 1) oversegmentation by 3-D geometry enhanced superpixels and 2) graph-based merging with label cost from superpixels. In the oversegmentation stage, 3-D geometrical information is reconstructed from the depth map. Then, a K-means-like clustering method is applied to the RGB-D data for oversegmentation using an 8-D distance metric constructed from both color and 3-D geometrical information. In the merging stage, treating each superpixel as a node, a graph-based model is set up to relabel the superpixels into semantically-coherent segments. In the graph-based model, RGB-D proximity, texture similarity, and boundary continuity are incorporated into the smoothness term to exploit the correlations of neighboring superpixels. To obtain a compact labeling, the label term is designed to penalize labels linking to similar superpixels that likely belong to the same object. Both the proposed 3-D geometry enhanced superpixel clustering method and the graph-based merging method from superpixels are evaluated by qualitative and quantitative results. By the fusion of color and depth information, the proposed method achieves superior segmentation performance over several state-of-the-art algorithms.

Search and Graph Database Technologies for Biomedical Semantic Indexing: Experimental Analysis.

PubMed

Segura Bedmar, Isabel; Martínez, Paloma; Carruana Martín, Adrián

2017-12-01

Biomedical semantic indexing is a very useful support tool for human curators in their efforts for indexing and cataloging the biomedical literature. The aim of this study was to describe a system to automatically assign Medical Subject Headings (MeSH) to biomedical articles from MEDLINE. Our approach relies on the assumption that similar documents should be classified by similar MeSH terms. Although previous work has already exploited the document similarity by using a k-nearest neighbors algorithm, we represent documents as document vectors by search engine indexing and then compute the similarity between documents using cosine similarity. Once the most similar documents for a given input document are retrieved, we rank their MeSH terms to choose the most suitable set for the input document. To do this, we define a scoring function that takes into account the frequency of the term into the set of retrieved documents and the similarity between the input document and each retrieved document. In addition, we implement guidelines proposed by human curators to annotate MEDLINE articles; in particular, the heuristic that says if 3 MeSH terms are proposed to classify an article and they share the same ancestor, they should be replaced by this ancestor. The representation of the MeSH thesaurus as a graph database allows us to employ graph search algorithms to quickly and easily capture hierarchical relationships such as the lowest common ancestor between terms. Our experiments show promising results with an F1 of 69% on the test dataset. To the best of our knowledge, this is the first work that combines search and graph database technologies for the task of biomedical semantic indexing. Due to its horizontal scalability, ElasticSearch becomes a real solution to index large collections of documents (such as the bibliographic database MEDLINE). Moreover, the use of graph search algorithms for accessing MeSH information could provide a support tool for cataloging MEDLINE abstracts in real time. ©Isabel Segura Bedmar, Paloma Martínez, Adrián Carruana Martín. Originally published in JMIR Medical Informatics (http://medinform.jmir.org), 01.12.2017.

Loop series for discrete statistical models on graphs

NASA Astrophysics Data System (ADS)

Chertkov, Michael; Chernyak, Vladimir Y.

2006-06-01

In this paper we present the derivation details, logic, and motivation for the three loop calculus introduced in Chertkov and Chernyak (2006 Phys. Rev. E 73 065102(R)). Generating functions for each of the three interrelated discrete statistical models are expressed in terms of a finite series. The first term in the series corresponds to the Bethe-Peierls belief-propagation (BP) contribution; the other terms are labelled by loops on the factor graph. All loop contributions are simple rational functions of spin correlation functions calculated within the BP approach. We discuss two alternative derivations of the loop series. One approach implements a set of local auxiliary integrations over continuous fields with the BP contribution corresponding to an integrand saddle-point value. The integrals are replaced by sums in the complementary approach, briefly explained in Chertkov and Chernyak (2006 Phys. Rev. E 73 065102(R)). Local gauge symmetry transformations that clarify an important invariant feature of the BP solution are revealed in both approaches. The individual terms change under the gauge transformation while the partition function remains invariant. The requirement for all individual terms to be nonzero only for closed loops in the factor graph (as opposed to paths with loose ends) is equivalent to fixing the first term in the series to be exactly equal to the BP contribution. Further applications of the loop calculus to problems in statistical physics, computer and information sciences are discussed.

Complexity of chemical graphs in terms of size, branching, and cyclicity.

PubMed

Balaban, A T; Mills, D; Kodali, V; Basak, S C

2006-08-01

Chemical graph complexity depends on many factors, but the main ones are size, branching, and cyclicity. Some molecular descriptors embrace together all these three parameters, which cannot then be disentangled. The topological index J (and its refinements that include accounting for bond multiplicity and the presence of heteroatoms) was designed to compensate in a significant measure for graph size and cyclicity, and therefore it contains information mainly on branching. In order to separate these factors, two new indices (F and G) related with J are proposed, which allow to group together graphs with the same size into families of constitutional formulas differing in their branching and cyclicity. A comparison with other topological indices revealed that a few other topological indices vary similarly with index G, notably DN2S4 among the triplet indices, and TOTOP among the indices contained in the Molconn-Z program. This comparison involved all possible chemical graphs (i.e. connected planar graphs with vertex degrees not higher than four) with four through six vertices, and all possible alkanes with four through nine carbon atoms.

Visibility Graph Based Time Series Analysis.

PubMed

Stephen, Mutua; Gu, Changgui; Yang, Huijie

2015-01-01

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

Graph drawing using tabu search coupled with path relinking.

PubMed

Dib, Fadi K; Rodgers, Peter

2018-01-01

Graph drawing, or the automatic layout of graphs, is a challenging problem. There are several search based methods for graph drawing which are based on optimizing an objective function which is formed from a weighted sum of multiple criteria. In this paper, we propose a new neighbourhood search method which uses a tabu search coupled with path relinking to optimize such objective functions for general graph layouts with undirected straight lines. To our knowledge, before our work, neither of these methods have been previously used in general multi-criteria graph drawing. Tabu search uses a memory list to speed up searching by avoiding previously tested solutions, while the path relinking method generates new solutions by exploring paths that connect high quality solutions. We use path relinking periodically within the tabu search procedure to speed up the identification of good solutions. We have evaluated our new method against the commonly used neighbourhood search optimization techniques: hill climbing and simulated annealing. Our evaluation examines the quality of the graph layout (objective function's value) and the speed of layout in terms of the number of evaluated solutions required to draw a graph. We also examine the relative scalability of each method. Our experimental results were applied to both random graphs and a real-world dataset. We show that our method outperforms both hill climbing and simulated annealing by producing a better layout in a lower number of evaluated solutions. In addition, we demonstrate that our method has greater scalability as it can layout larger graphs than the state-of-the-art neighbourhood search methods. Finally, we show that similar results can be produced in a real world setting by testing our method against a standard public graph dataset.

Graph drawing using tabu search coupled with path relinking

PubMed Central

Rodgers, Peter

2018-01-01

Graph drawing, or the automatic layout of graphs, is a challenging problem. There are several search based methods for graph drawing which are based on optimizing an objective function which is formed from a weighted sum of multiple criteria. In this paper, we propose a new neighbourhood search method which uses a tabu search coupled with path relinking to optimize such objective functions for general graph layouts with undirected straight lines. To our knowledge, before our work, neither of these methods have been previously used in general multi-criteria graph drawing. Tabu search uses a memory list to speed up searching by avoiding previously tested solutions, while the path relinking method generates new solutions by exploring paths that connect high quality solutions. We use path relinking periodically within the tabu search procedure to speed up the identification of good solutions. We have evaluated our new method against the commonly used neighbourhood search optimization techniques: hill climbing and simulated annealing. Our evaluation examines the quality of the graph layout (objective function’s value) and the speed of layout in terms of the number of evaluated solutions required to draw a graph. We also examine the relative scalability of each method. Our experimental results were applied to both random graphs and a real-world dataset. We show that our method outperforms both hill climbing and simulated annealing by producing a better layout in a lower number of evaluated solutions. In addition, we demonstrate that our method has greater scalability as it can layout larger graphs than the state-of-the-art neighbourhood search methods. Finally, we show that similar results can be produced in a real world setting by testing our method against a standard public graph dataset. PMID:29746576

A halochromic stimuli-responsive reversible fluorescence switching 3, 4, 9, 10-perylene tetracarboxylic acid dye for fabricating rewritable platform

NASA Astrophysics Data System (ADS)

Hariharan, P. S.; Pitchaimani, J.; Madhu, Vedichi; Anthony, Savarimuthu Philip

2017-02-01

3, 4, 9, 10-perylene tetracarboxylic acid (PTCA), a strongly fluorescent water soluble dye with halochromic functionality showed pH dependent reversible fluorescence switching. The strong fluorescence of PTCA (Φf = 0.67) in basic medium was completely quenched upon acidification. The fluorescent PTCA has been transferred on to a solid substrate (filter paper and glass plate) that also showed reversible off-on fluorescence switching by acid/base and drying/water vapor exposure. The reversible fluorescence switching of PTCA could be of potential interest for fabricating rewritable fluorescent medium.

GOGrapher: A Python library for GO graph representation and analysis

PubMed Central

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

2009-01-01

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

Fractal dimensions of graph of Weierstrass-type function and local Hölder exponent spectra

NASA Astrophysics Data System (ADS)

Otani, Atsuya

2018-01-01

We study several fractal properties of the Weierstrass-type function where τ :[0, 1)\\to[0, 1) is a cookie cutter map with possibly fractal repeller, and λ and g are functions with proper regularity. In the first part, we determine the box dimension of the graph of W and Hausdorff dimension of its randomised version. In the second part, the Hausdorff spectrum of the local Hölder exponent is characterised in terms of thermodynamic formalism. Furthermore, in the randomised case, a novel formula for the lifted Hausdorff spectrum on the graph is provided.

Educational network comparative analysis of small groups: Short- and long-term communications

NASA Astrophysics Data System (ADS)

Berg, D. B.; Zvereva, O. M.; Nazarova, Yu. Yu.; Chepurov, E. G.; Kokovin, A. V.; Ranyuk, S. V.

2017-11-01

The present study is devoted to the discussion of small group communication network structures. These communications were observed in student groups, where actors were united with a regular educational activity. The comparative analysis was carried out for networks of short-term (1 hour) and long-term (4 weeks) communications, it was based on seven structural parameters, and consisted of two stages. At the first stage, differences between the network graphs were examined, and the random corresponding Bernoulli graphs were built. At the second stage, revealed differences were compared. Calculations were performed using UCINET software framework. It was found out that networks of long-term and short-term communications are quite different: the structure of a short-term communication network is close to a random one, whereas the most of long-term communication network parameters differ from the corresponding random ones by more than 30%. This difference can be explained by strong "noisiness" of a short-term communication network, and the lack of social in it.

Local Higher-Order Graph Clustering

PubMed Central

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

2018-01-01

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

Analysis of the Relevance of Posts in Asynchronous Discussions

ERIC Educational Resources Information Center

Azevedo, Breno T.; Reategui, Eliseo; Behar, Patrícia A.

2014-01-01

This paper presents ForumMiner, a tool for the automatic analysis of students' posts in asynchronous discussions. ForumMiner uses a text mining system to extract graphs from texts that are given to students as a basis for their discussion. These graphs contain the most relevant terms found in the texts, as well as the relationships between them.…

MEDRank: using graph-based concept ranking to index biomedical texts

PubMed Central

Herskovic, Jorge R.; Cohen, Trevor; Subramanian, Devika; Iyengar, M. Sriram; Smith, Jack W.; Bernstam, Elmer V.

2011-01-01

BACKGROUND As the volume of biomedical text increases exponentially, automatic indexing becomes increasingly important. However, existing approaches do not distinguish central (or core) concepts from concepts that were mentioned in passing. We focus on the problem of indexing MEDLINE records, a process that is currently performed by highly-trained humans at the National Library of Medicine (NLM). NLM indexers are assisted by a system called the Medical Text Indexer (MTI) that suggests candidate indexing terms. OBJECTIVE To improve the ability of MTI to select the core terms in MEDLINE abstracts. These core concepts are deemed to be most important and are designated as “major headings” by MEDLINE indexers. We introduce and evaluate a graph-based indexing methodology called MEDRank that generates concept graphs from biomedical text and then ranks the concepts within these graphs to identify the most important ones. METHODS We insert a MEDRank step into the MTI and compare MTI’s output with and without MEDRank to the MEDLINE indexers’ selected terms for a sample of 11,803 PubMed Central articles. We also tested whether human raters prefer terms generated by the MEDLINE indexers, MTI without MEDRank, and MTI with MEDRank for a sample of 36 PubMed Central articles. RESULTS MEDRank improved recall of major headings designated by 30% over MTI without MEDRank (0.489 vs 0.376). Overall recall was only slightly (6.5%) higher (0.490 vs 0.460) as was F2 (3%, 0.408 vs 0.396). However, overall precision was 3.9% lower (0.268 vs 0.279). Human raters preferred terms generated by MTI with MEDRank over terms generated by MTI without MEDRank (by an average of 1.00 more term per article), and preferred terms generated by MTI with MEDRank and the MEDLINE indexers at the same rate. CONCLUSIONS The addition of MEDRank to MTI significantly improved the retrieval of core concepts in MEDLINE abstracts and more closely matched human expectations compared to MTI without MEDRank. In addition, MEDRank slightly improved overall recall and F2. PMID:21439897

MEDRank: using graph-based concept ranking to index biomedical texts.

PubMed

Herskovic, Jorge R; Cohen, Trevor; Subramanian, Devika; Iyengar, M Sriram; Smith, Jack W; Bernstam, Elmer V

2011-06-01

As the volume of biomedical text increases exponentially, automatic indexing becomes increasingly important. However, existing approaches do not distinguish central (or core) concepts from concepts that were mentioned in passing. We focus on the problem of indexing MEDLINE records, a process that is currently performed by highly trained humans at the National Library of Medicine (NLM). NLM indexers are assisted by a system called the Medical Text Indexer (MTI) that suggests candidate indexing terms. To improve the ability of MTI to select the core terms in MEDLINE abstracts. These core concepts are deemed to be most important and are designated as "major headings" by MEDLINE indexers. We introduce and evaluate a graph-based indexing methodology called MEDRank that generates concept graphs from biomedical text and then ranks the concepts within these graphs to identify the most important ones. We insert a MEDRank step into the MTI and compare MTI's output with and without MEDRank to the MEDLINE indexers' selected terms for a sample of 11,803 PubMed Central articles. We also tested whether human raters prefer terms generated by the MEDLINE indexers, MTI without MEDRank, and MTI with MEDRank for a sample of 36 PubMed Central articles. MEDRank improved recall of major headings designated by 30% over MTI without MEDRank (0.489 vs. 0.376). Overall recall was only slightly (6.5%) higher (0.490 vs. 0.460) as was F(2) (3%, 0.408 vs. 0.396). However, overall precision was 3.9% lower (0.268 vs. 0.279). Human raters preferred terms generated by MTI with MEDRank over terms generated by MTI without MEDRank (by an average of 1.00 more term per article), and preferred terms generated by MTI with MEDRank and the MEDLINE indexers at the same rate. The addition of MEDRank to MTI significantly improved the retrieval of core concepts in MEDLINE abstracts and more closely matched human expectations compared to MTI without MEDRank. In addition, MEDRank slightly improved overall recall and F(2). Copyright © 2011 Elsevier Ireland Ltd. All rights reserved.

A general framework for regularized, similarity-based image restoration.

PubMed

Kheradmand, Amin; Milanfar, Peyman

2014-12-01

Any image can be represented as a function defined on a weighted graph, in which the underlying structure of the image is encoded in kernel similarity and associated Laplacian matrices. In this paper, we develop an iterative graph-based framework for image restoration based on a new definition of the normalized graph Laplacian. We propose a cost function, which consists of a new data fidelity term and regularization term derived from the specific definition of the normalized graph Laplacian. The normalizing coefficients used in the definition of the Laplacian and associated regularization term are obtained using fast symmetry preserving matrix balancing. This results in some desired spectral properties for the normalized Laplacian such as being symmetric, positive semidefinite, and returning zero vector when applied to a constant image. Our algorithm comprises of outer and inner iterations, where in each outer iteration, the similarity weights are recomputed using the previous estimate and the updated objective function is minimized using inner conjugate gradient iterations. This procedure improves the performance of the algorithm for image deblurring, where we do not have access to a good initial estimate of the underlying image. In addition, the specific form of the cost function allows us to render the spectral analysis for the solutions of the corresponding linear equations. In addition, the proposed approach is general in the sense that we have shown its effectiveness for different restoration problems, including deblurring, denoising, and sharpening. Experimental results verify the effectiveness of the proposed algorithm on both synthetic and real examples.

A shortest-path graph kernel for estimating gene product semantic similarity.

PubMed

Alvarez, Marco A; Qi, Xiaojun; Yan, Changhui

2011-07-29

Existing methods for calculating semantic similarity between gene products using the Gene Ontology (GO) often rely on external resources, which are not part of the ontology. Consequently, changes in these external resources like biased term distribution caused by shifting of hot research topics, will affect the calculation of semantic similarity. One way to avoid this problem is to use semantic methods that are "intrinsic" to the ontology, i.e. independent of external knowledge. We present a shortest-path graph kernel (spgk) method that relies exclusively on the GO and its structure. In spgk, a gene product is represented by an induced subgraph of the GO, which consists of all the GO terms annotating it. Then a shortest-path graph kernel is used to compute the similarity between two graphs. In a comprehensive evaluation using a benchmark dataset, spgk compares favorably with other methods that depend on external resources. Compared with simUI, a method that is also intrinsic to GO, spgk achieves slightly better results on the benchmark dataset. Statistical tests show that the improvement is significant when the resolution and EC similarity correlation coefficient are used to measure the performance, but is insignificant when the Pfam similarity correlation coefficient is used. Spgk uses a graph kernel method in polynomial time to exploit the structure of the GO to calculate semantic similarity between gene products. It provides an alternative to both methods that use external resources and "intrinsic" methods with comparable performance.

Multi-phase simultaneous segmentation of tumor in lung 4D-CT data with context information.

PubMed

Shen, Zhengwen; Wang, Huafeng; Xi, Weiwen; Deng, Xiaogang; Chen, Jin; Zhang, Yu

2017-01-01

Lung 4D computed tomography (4D-CT) plays an important role in high-precision radiotherapy because it characterizes respiratory motion, which is crucial for accurate target definition. However, the manual segmentation of a lung tumor is a heavy workload for doctors because of the large number of lung 4D-CT data slices. Meanwhile, tumor segmentation is still a notoriously challenging problem in computer-aided diagnosis. In this paper, we propose a new method based on an improved graph cut algorithm with context information constraint to find a convenient and robust approach of lung 4D-CT tumor segmentation. We combine all phases of the lung 4D-CT into a global graph, and construct a global energy function accordingly. The sub-graph is first constructed for each phase. A context cost term is enforced to achieve segmentation results in every phase by adding a context constraint between neighboring phases. A global energy function is finally constructed by combining all cost terms. The optimization is achieved by solving a max-flow/min-cut problem, which leads to simultaneous and robust segmentation of the tumor in all the lung 4D-CT phases. The effectiveness of our approach is validated through experiments on 10 different lung 4D-CT cases. The comparison with the graph cut without context constraint, the level set method and the graph cut with star shape prior demonstrates that the proposed method obtains more accurate and robust segmentation results.

Disentangling giant component and finite cluster contributions in sparse random matrix spectra.

PubMed

Kühn, Reimer

2016-04-01

We describe a method for disentangling giant component and finite cluster contributions to sparse random matrix spectra, using sparse symmetric random matrices defined on Erdős-Rényi graphs as an example and test bed. Our methods apply to sparse matrices defined in terms of arbitrary graphs in the configuration model class, as long as they have finite mean degree.

Fluctuation Relations for Currents

NASA Astrophysics Data System (ADS)

Sinitsyn, Nikolai; Akimov, Alexei; Chernyak, Vladimir; Chertkov, Michael

2011-03-01

We consider a non-equilibrium statistical system on a graph or a network. Identical particles are injected, interact with each other, traverse, and leave the graph in a stochastic manner described in terms of Poisson rates, possibly strongly dependent on time and instantaneous occupation numbers at the nodes of the graph. We show that the system demonstrates a profound statistical symmetry, leading to new Fluctuation Relations that originate from the supersymmetry and the principle of the geometric universality of currents rather than from the relations between probabilities of forward and reverse trajectories. NSF/ECCS-0925618, NSF/CHE-0808910 and DOE at LANL under Contract No. DE-AC52-06NA25396.

Rapidly Responsive and Flexible Chiral Nematic Cellulose Nanocrystal Composites as Multifunctional Rewritable Photonic Papers with Eco-Friendly Inks.

PubMed

Wan, Hao; Li, Xiaofeng; Zhang, Liang; Li, Xiaopeng; Liu, Pengfei; Jiang, Zhiguo; Yu, Zhong-Zhen

2018-02-14

Rapidly responsive and flexible photonic papers are manufactured by coassembly of cellulose nanocrystals (CNCs) and waterborne polyurethane (WPU) latex for fully taking advantage of the chiral nematic structure of CNCs and the flexibility of WPU elastomer. The resulting CNC/WPU composite papers exhibit not only tunable iridescent colors by adjusting the helical pitch size, but also instant optical responses to water and wet gas, ascribed to the easy chain movement of the elastomeric WPU that does not restrict the fast water absorption-induced swelling of CNCs. By choosing water or NaCl aqueous solutions as inks, the colorful patterns on the CNC/WPU photonic paper can be made temporary, durable, or even disguisable. In addition, the photonic paper is simultaneously rewritable for all these three types of patterns, and the disguisable patterns, which are invisible at normal times and show up under stimuli, exhibit a quick reveal conversion just by exhaling on the paper. The rewritability, rapid responsibility, easy fabrication, and the eco-friendly nature of the inks make the flexible photonic paper/ink combination highly promising in sensors, displays, and photonic circuits.

Erasure and formation of femtosecond laser-induced nanostructures

NASA Astrophysics Data System (ADS)

Zimmermann, F.; Plech, A.; Richter, Sören; Tünnermann, A.; Nolte, S.

2015-03-01

The local inscription of strong birefringence by ultrashort laser pulses facilitates the fabrication of manifold photonic devices, such as data storage devices. One intriguing feature of these nanograting-based data units is to delete and rewrite new nanograting voxels by changing the laser polarization orientation during inscription. However, up to now no comprehensive picture of this complex physical process exists. Thus we performed optical retardance measurements as well as microscopic analyses, such as small-angle X-ray scattering (SAXS) and scanning electron microscopy (SEM) to address this issue. Our results reveal that only few laser pulses already lead to an erasure of nanometric pores which is mapped by the total (X-ray) scattering volume as well as by the strong reduction of the initial form birefringence. Simultaneously, new nanostructures form which arrange in individual grating planes with ongoing irradiation. However, since the rewrite process is no ideal mechanism some of the old sheets remain, which perturb the quality of the new nanograting. When rewriting multiple times the glass becomes even more porous due to repetitive annealing and quenching. This promotes the formation of new inhomogeneities and in turn leads to an increase in optical retardance.

Optimized Graph Learning Using Partial Tags and Multiple Features for Image and Video Annotation.

PubMed

Song, Jingkuan; Gao, Lianli; Nie, Feiping; Shen, Heng Tao; Yan, Yan; Sebe, Nicu

2016-11-01

In multimedia annotation, due to the time constraints and the tediousness of manual tagging, it is quite common to utilize both tagged and untagged data to improve the performance of supervised learning when only limited tagged training data are available. This is often done by adding a geometry-based regularization term in the objective function of a supervised learning model. In this case, a similarity graph is indispensable to exploit the geometrical relationships among the training data points, and the graph construction scheme essentially determines the performance of these graph-based learning algorithms. However, most of the existing works construct the graph empirically and are usually based on a single feature without using the label information. In this paper, we propose a semi-supervised annotation approach by learning an optimized graph (OGL) from multi-cues (i.e., partial tags and multiple features), which can more accurately embed the relationships among the data points. Since OGL is a transductive method and cannot deal with novel data points, we further extend our model to address the out-of-sample issue. Extensive experiments on image and video annotation show the consistent superiority of OGL over the state-of-the-art methods.

Overview and extensions of a system for routing directed graphs on SIMD architectures

NASA Technical Reports Server (NTRS)

Tomboulian, Sherryl

1988-01-01

Many problems can be described in terms of directed graphs that contain a large number of vertices where simple computations occur using data from adjacent vertices. A method is given for parallelizing such problems on an SIMD machine model that uses only nearest neighbor connections for communication, and has no facility for local indirect addressing. Each vertex of the graph will be assigned to a processor in the machine. Rules for a labeling are introduced that support the use of a simple algorithm for movement of data along the edges of the graph. Additional algorithms are defined for addition and deletion of edges. Modifying or adding a new edge takes the same time as parallel traversal. This combination of architecture and algorithms defines a system that is relatively simple to build and can do fast graph processing. All edges can be traversed in parallel in time O(T), where T is empirically proportional to the average path length in the embedding times the average degree of the graph. Additionally, researchers present an extension to the above method which allows for enhanced performance by allowing some broadcasting capabilities.

PRISM 3: expanded prediction of natural product chemical structures from microbial genomes.

PubMed

Skinnider, Michael A; Merwin, Nishanth J; Johnston, Chad W; Magarvey, Nathan A

2017-07-03

Microbial natural products represent a rich resource of pharmaceutically and industrially important compounds. Genome sequencing has revealed that the majority of natural products remain undiscovered, and computational methods to connect biosynthetic gene clusters to their corresponding natural products therefore have the potential to revitalize natural product discovery. Previously, we described PRediction Informatics for Secondary Metabolomes (PRISM), a combinatorial approach to chemical structure prediction for genetically encoded nonribosomal peptides and type I and II polyketides. Here, we present a ground-up rewrite of the PRISM structure prediction algorithm to derive prediction of natural products arising from non-modular biosynthetic paradigms. Within this new version, PRISM 3, natural product scaffolds are modeled as chemical graphs, permitting structure prediction for aminocoumarins, antimetabolites, bisindoles and phosphonate natural products, and building upon the addition of ribosomally synthesized and post-translationally modified peptides. Further, with the addition of cluster detection for 11 new cluster types, PRISM 3 expands to detect 22 distinct natural product cluster types. Other major modifications to PRISM include improved sequence input and ORF detection, user-friendliness and output. Distribution of PRISM 3 over a 300-core server grid improves the speed and capacity of the web application. PRISM 3 is available at http://magarveylab.ca/prism/. © The Author(s) 2017. Published by Oxford University Press on behalf of Nucleic Acids Research.

Visibility Graph Based Time Series Analysis

PubMed Central

Stephen, Mutua; Gu, Changgui; Yang, Huijie

2015-01-01

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

Exploring information from the topology beneath the Gene Ontology terms to improve semantic similarity measures.

PubMed

Zhang, Shu-Bo; Lai, Jian-Huang

2016-07-15

Measuring the similarity between pairs of biological entities is important in molecular biology. The introduction of Gene Ontology (GO) provides us with a promising approach to quantifying the semantic similarity between two genes or gene products. This kind of similarity measure is closely associated with the GO terms annotated to biological entities under consideration and the structure of the GO graph. However, previous works in this field mainly focused on the upper part of the graph, and seldom concerned about the lower part. In this study, we aim to explore information from the lower part of the GO graph for better semantic similarity. We proposed a framework to quantify the similarity measure beneath a term pair, which takes into account both the information two ancestral terms share and the probability that they co-occur with their common descendants. The effectiveness of our approach was evaluated against seven typical measurements on public platform CESSM, protein-protein interaction and gene expression datasets. Experimental results consistently show that the similarity derived from the lower part contributes to better semantic similarity measure. The promising features of our approach are the following: (1) it provides a mirror model to characterize the information two ancestral terms share with respect to their common descendant; (2) it quantifies the probability that two terms co-occur with their common descendant in an efficient way; and (3) our framework can effectively capture the similarity measure beneath two terms, which can serve as an add-on to improve traditional semantic similarity measure between two GO terms. The algorithm was implemented in Matlab and is freely available from http://ejl.org.cn/bio/GOBeneath/. Copyright © 2016 Elsevier B.V. All rights reserved.

The Ponzano-Regge Model and Parametric Representation

NASA Astrophysics Data System (ADS)

Li, Dan

2014-04-01

We give a parametric representation of the effective noncommutative field theory derived from a -deformation of the Ponzano-Regge model and define a generalized Kirchhoff polynomial with -correction terms, obtained in a -linear approximation. We then consider the corresponding graph hypersurfaces and the question of how the presence of the correction term affects their motivic nature. We look in particular at the tetrahedron graph, which is the basic case of relevance to quantum gravity. With the help of computer calculations, we verify that the number of points over finite fields of the corresponding hypersurface does not fit polynomials with integer coefficients, hence the hypersurface of the tetrahedron is not polynomially countable. This shows that the correction term can change significantly the motivic properties of the hypersurfaces, with respect to the classical case.

Hybrid coexpression link similarity graph clustering for mining biological modules from multiple gene expression datasets.

PubMed

Salem, Saeed; Ozcaglar, Cagri

2014-01-01

Advances in genomic technologies have enabled the accumulation of vast amount of genomic data, including gene expression data for multiple species under various biological and environmental conditions. Integration of these gene expression datasets is a promising strategy to alleviate the challenges of protein functional annotation and biological module discovery based on a single gene expression data, which suffers from spurious coexpression. We propose a joint mining algorithm that constructs a weighted hybrid similarity graph whose nodes are the coexpression links. The weight of an edge between two coexpression links in this hybrid graph is a linear combination of the topological similarities and co-appearance similarities of the corresponding two coexpression links. Clustering the weighted hybrid similarity graph yields recurrent coexpression link clusters (modules). Experimental results on Human gene expression datasets show that the reported modules are functionally homogeneous as evident by their enrichment with biological process GO terms and KEGG pathways.

Topology and static response of interaction networks in molecular biology

PubMed Central

Radulescu, Ovidiu; Lagarrigue, Sandrine; Siegel, Anne; Veber, Philippe; Le Borgne, Michel

2005-01-01

We introduce a mathematical framework describing static response of networks occurring in molecular biology. This formalism has many similarities with the Laplace–Kirchhoff equations for electrical networks. We introduce the concept of graph boundary and we show how the response of the biological networks to external perturbations can be related to the Dirichlet or Neumann problems for the corresponding equations on the interaction graph. Solutions to these two problems are given in terms of path moduli (measuring path rigidity with respect to the propagation of interaction along the graph). Path moduli are related to loop products in the interaction graph via generalized Mason–Coates formulae. We apply our results to two specific biological examples: the lactose operon and the genetic regulation of lipogenesis. Our applications show consistency with experimental results and in the case of lipogenesis check some hypothesis on the behaviour of hepatic fatty acids on fasting. PMID:16849230

Generalized monogamy of contextual inequalities from the no-disturbance principle.

PubMed

Ramanathan, Ravishankar; Soeda, Akihito; Kurzyński, Paweł; Kaszlikowski, Dagomir

2012-08-03

In this Letter, we demonstrate that the property of monogamy of Bell violations seen for no-signaling correlations in composite systems can be generalized to the monogamy of contextuality in single systems obeying the Gleason property of no disturbance. We show how one can construct monogamies for contextual inequalities by using the graph-theoretic technique of vertex decomposition of a graph representing a set of measurements into subgraphs of suitable independence numbers that themselves admit a joint probability distribution. After establishing that all the subgraphs that are chordal graphs admit a joint probability distribution, we formulate a precise graph-theoretic condition that gives rise to the monogamy of contextuality. We also show how such monogamies arise within quantum theory for a single four-dimensional system and interpret violation of these relations in terms of a violation of causality. These monogamies can be tested with current experimental techniques.

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

PubMed

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

2008-12-08

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

The many faces of graph dynamics

NASA Astrophysics Data System (ADS)

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

2017-06-01

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

Separating OR, SUM, and XOR Circuits.

PubMed

Find, Magnus; Göös, Mika; Järvisalo, Matti; Kaski, Petteri; Koivisto, Mikko; Korhonen, Janne H

2016-08-01

Given a boolean n × n matrix A we consider arithmetic circuits for computing the transformation x ↦ Ax over different semirings. Namely, we study three circuit models: monotone OR-circuits, monotone SUM-circuits (addition of non-negative integers), and non-monotone XOR-circuits (addition modulo 2). Our focus is on separating OR-circuits from the two other models in terms of circuit complexity: We show how to obtain matrices that admit OR-circuits of size O ( n ), but require SUM-circuits of size Ω( n 3/2 /log 2 n ).We consider the task of rewriting a given OR-circuit as a XOR-circuit and prove that any subquadratic-time algorithm for this task violates the strong exponential time hypothesis.

Energy Minimization of Discrete Protein Titration State Models Using Graph Theory.

PubMed

Purvine, Emilie; Monson, Kyle; Jurrus, Elizabeth; Star, Keith; Baker, Nathan A

2016-08-25

There are several applications in computational biophysics that require the optimization of discrete interacting states, for example, amino acid titration states, ligand oxidation states, or discrete rotamer angles. Such optimization can be very time-consuming as it scales exponentially in the number of sites to be optimized. In this paper, we describe a new polynomial time algorithm for optimization of discrete states in macromolecular systems. This algorithm was adapted from image processing and uses techniques from discrete mathematics and graph theory to restate the optimization problem in terms of "maximum flow-minimum cut" graph analysis. The interaction energy graph, a graph in which vertices (amino acids) and edges (interactions) are weighted with their respective energies, is transformed into a flow network in which the value of the minimum cut in the network equals the minimum free energy of the protein and the cut itself encodes the state that achieves the minimum free energy. Because of its deterministic nature and polynomial time performance, this algorithm has the potential to allow for the ionization state of larger proteins to be discovered.

Energy Minimization of Discrete Protein Titration State Models Using Graph Theory

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

Purvine, Emilie AH; Monson, Kyle E.; Jurrus, Elizabeth R.

There are several applications in computational biophysics which require the optimization of discrete interacting states; e.g., amino acid titration states, ligand oxidation states, or discrete rotamer angles. Such optimization can be very time-consuming as it scales exponentially in the number of sites to be optimized. In this paper, we describe a new polynomial-time algorithm for optimization of discrete states in macromolecular systems. This algorithm was adapted from image processing and uses techniques from discrete mathematics and graph theory to restate the optimization problem in terms of maximum flow-minimum cut graph analysis. The interaction energy graph, a graph in which verticesmore » (amino acids) and edges (interactions) are weighted with their respective energies, is transformed into a flow network in which the value of the minimum cut in the network equals the minimum free energy of the protein, and the cut itself encodes the state that achieves the minimum free energy. Because of its deterministic nature and polynomial-time performance, this algorithm has the potential to allow for the ionization state of larger proteins to be discovered.« less

Energy Minimization of Discrete Protein Titration State Models Using Graph Theory

PubMed Central

Purvine, Emilie; Monson, Kyle; Jurrus, Elizabeth; Star, Keith; Baker, Nathan A.

2016-01-01

There are several applications in computational biophysics which require the optimization of discrete interacting states; e.g., amino acid titration states, ligand oxidation states, or discrete rotamer angles. Such optimization can be very time-consuming as it scales exponentially in the number of sites to be optimized. In this paper, we describe a new polynomial-time algorithm for optimization of discrete states in macromolecular systems. This algorithm was adapted from image processing and uses techniques from discrete mathematics and graph theory to restate the optimization problem in terms of “maximum flow-minimum cut” graph analysis. The interaction energy graph, a graph in which vertices (amino acids) and edges (interactions) are weighted with their respective energies, is transformed into a flow network in which the value of the minimum cut in the network equals the minimum free energy of the protein, and the cut itself encodes the state that achieves the minimum free energy. Because of its deterministic nature and polynomial-time performance, this algorithm has the potential to allow for the ionization state of larger proteins to be discovered. PMID:27089174

On the calculation of resonances by analytic continuation of eigenvalues from the stabilization graph

NASA Astrophysics Data System (ADS)

Haritan, Idan; Moiseyev, Nimrod

2017-07-01

Resonances play a major role in a large variety of fields in physics and chemistry. Accordingly, there is a growing interest in methods designed to calculate them. Recently, Landau et al. proposed a new approach to analytically dilate a single eigenvalue from the stabilization graph into the complex plane. This approach, termed Resonances Via Padé (RVP), utilizes the Padé approximant and is based on a unique analysis of the stabilization graph. Yet, analytic continuation of eigenvalues from the stabilization graph into the complex plane is not a new idea. In 1975, Jordan suggested an analytic continuation method based on the branch point structure of the stabilization graph. The method was later modified by McCurdy and McNutt, and it is still being used today. We refer to this method as the Truncated Characteristic Polynomial (TCP) method. In this manuscript, we perform an in-depth comparison between the RVP and the TCP methods. We demonstrate that while both methods are important and complementary, the advantage of one method over the other is problem-dependent. Illustrative examples are provided in the manuscript.

Visualization of Documents and Concepts in Neuroinformatics with the 3D-SE Viewer

PubMed Central

Naud, Antoine; Usui, Shiro; Ueda, Naonori; Taniguchi, Tatsuki

2007-01-01

A new interactive visualization tool is proposed for mining text data from various fields of neuroscience. Applications to several text datasets are presented to demonstrate the capability of the proposed interactive tool to visualize complex relationships between pairs of lexical entities (with some semantic contents) such as terms, keywords, posters, or papers' abstracts. Implemented as a Java applet, this tool is based on the spherical embedding (SE) algorithm, which was designed for the visualization of bipartite graphs. Items such as words and documents are linked on the basis of occurrence relationships, which can be represented in a bipartite graph. These items are visualized by embedding the vertices of the bipartite graph on spheres in a three-dimensional (3-D) space. The main advantage of the proposed visualization tool is that 3-D layouts can convey more information than planar or linear displays of items or graphs. Different kinds of information extracted from texts, such as keywords, indexing terms, or topics are visualized, allowing interactive browsing of various fields of research featured by keywords, topics, or research teams. A typical use of the 3D-SE viewer is quick browsing of topics displayed on a sphere, then selecting one or several item(s) displays links to related terms on another sphere representing, e.g., documents or abstracts, and provides direct online access to the document source in a database, such as the Visiome Platform or the SfN Annual Meeting. Developed as a Java applet, it operates as a tool on top of existing resources. PMID:18974802

Visualization of Documents and Concepts in Neuroinformatics with the 3D-SE Viewer.

PubMed

Naud, Antoine; Usui, Shiro; Ueda, Naonori; Taniguchi, Tatsuki

2007-01-01

A new interactive visualization tool is proposed for mining text data from various fields of neuroscience. Applications to several text datasets are presented to demonstrate the capability of the proposed interactive tool to visualize complex relationships between pairs of lexical entities (with some semantic contents) such as terms, keywords, posters, or papers' abstracts. Implemented as a Java applet, this tool is based on the spherical embedding (SE) algorithm, which was designed for the visualization of bipartite graphs. Items such as words and documents are linked on the basis of occurrence relationships, which can be represented in a bipartite graph. These items are visualized by embedding the vertices of the bipartite graph on spheres in a three-dimensional (3-D) space. The main advantage of the proposed visualization tool is that 3-D layouts can convey more information than planar or linear displays of items or graphs. Different kinds of information extracted from texts, such as keywords, indexing terms, or topics are visualized, allowing interactive browsing of various fields of research featured by keywords, topics, or research teams. A typical use of the 3D-SE viewer is quick browsing of topics displayed on a sphere, then selecting one or several item(s) displays links to related terms on another sphere representing, e.g., documents or abstracts, and provides direct online access to the document source in a database, such as the Visiome Platform or the SfN Annual Meeting. Developed as a Java applet, it operates as a tool on top of existing resources.

A New Analysis of Resting State Connectivity and Graph Theory Reveals Distinctive Short-Term Modulations due to Whisker Stimulation in Rats.

PubMed

Kreitz, Silke; de Celis Alonso, Benito; Uder, Michael; Hess, Andreas

2018-01-01

Resting state (RS) connectivity has been increasingly studied in healthy and diseased brains in humans and animals. This paper presents a new method to analyze RS data from fMRI that combines multiple seed correlation analysis with graph-theory (MSRA). We characterize and evaluate this new method in relation to two other graph-theoretical methods and ICA. The graph-theoretical methods calculate cross-correlations of regional average time-courses, one using seed regions of the same size (SRCC) and the other using whole brain structure regions (RCCA). We evaluated the reproducibility, power, and capacity of these methods to characterize short-term RS modulation to unilateral physiological whisker stimulation in rats. Graph-theoretical networks found with the MSRA approach were highly reproducible, and their communities showed large overlaps with ICA components. Additionally, MSRA was the only one of all tested methods that had the power to detect significant RS modulations induced by whisker stimulation that are controlled by family-wise error rate (FWE). Compared to the reduced resting state network connectivity during task performance, these modulations implied decreased connectivity strength in the bilateral sensorimotor and entorhinal cortex. Additionally, the contralateral ventromedial thalamus (part of the barrel field related lemniscal pathway) and the hypothalamus showed reduced connectivity. Enhanced connectivity was observed in the amygdala, especially the contralateral basolateral amygdala (involved in emotional learning processes). In conclusion, MSRA is a powerful analytical approach that can reliably detect tiny modulations of RS connectivity. It shows a great promise as a method for studying RS dynamics in healthy and pathological conditions.

A New Analysis of Resting State Connectivity and Graph Theory Reveals Distinctive Short-Term Modulations due to Whisker Stimulation in Rats

PubMed Central

Kreitz, Silke; de Celis Alonso, Benito; Uder, Michael; Hess, Andreas

2018-01-01

Resting state (RS) connectivity has been increasingly studied in healthy and diseased brains in humans and animals. This paper presents a new method to analyze RS data from fMRI that combines multiple seed correlation analysis with graph-theory (MSRA). We characterize and evaluate this new method in relation to two other graph-theoretical methods and ICA. The graph-theoretical methods calculate cross-correlations of regional average time-courses, one using seed regions of the same size (SRCC) and the other using whole brain structure regions (RCCA). We evaluated the reproducibility, power, and capacity of these methods to characterize short-term RS modulation to unilateral physiological whisker stimulation in rats. Graph-theoretical networks found with the MSRA approach were highly reproducible, and their communities showed large overlaps with ICA components. Additionally, MSRA was the only one of all tested methods that had the power to detect significant RS modulations induced by whisker stimulation that are controlled by family-wise error rate (FWE). Compared to the reduced resting state network connectivity during task performance, these modulations implied decreased connectivity strength in the bilateral sensorimotor and entorhinal cortex. Additionally, the contralateral ventromedial thalamus (part of the barrel field related lemniscal pathway) and the hypothalamus showed reduced connectivity. Enhanced connectivity was observed in the amygdala, especially the contralateral basolateral amygdala (involved in emotional learning processes). In conclusion, MSRA is a powerful analytical approach that can reliably detect tiny modulations of RS connectivity. It shows a great promise as a method for studying RS dynamics in healthy and pathological conditions. PMID:29875622

The rewritable effects of bonded magnet for large starting torque and high efficiency in the small power single-phase written pole motor

NASA Astrophysics Data System (ADS)

Choi, Jae-Hak; Lee, Sung-Ho

2009-04-01

This paper presents a single-phase written pole motor using a bonded ring magnet for the small power home application. The motor has an exciter pole structure inside the stator and hybrid characteristics of an induction motor and permanent magnet motor. The design parameters and operating characteristics of the hybrid concept motor are investigated to increase starting torque and efficiency, which is most important for the small power home application. Larger starting torque and higher efficiency than those of the conventional induction motor could be obtained by using the rewritable characteristics of bonded magnet on the starting and running conditions.

TOMML: A Rule Language for Structured Data

NASA Astrophysics Data System (ADS)

Cirstea, Horatiu; Moreau, Pierre-Etienne; Reilles, Antoine

We present the TOM language that extends JAVA with the purpose of providing high level constructs inspired by the rewriting community. TOM bridges thus the gap between a general purpose language and high level specifications based on rewriting. This approach was motivated by the promotion of rule based techniques and their integration in large scale applications. Powerful matching capabilities along with a rich strategy language are among TOM's strong features that make it easy to use and competitive with respect to other rule based languages. TOM is thus a natural choice for querying and transforming structured data and in particular XML documents [1]. We present here its main XML oriented features and illustrate its use on several examples.

New formulae for Zagreb indices

NASA Astrophysics Data System (ADS)

Cangul, Ismail Naci; Yurttas, Aysun; Togan, Muge; Cevik, Ahmet Sinan

2017-07-01

In this paper, we study with some graph descriptors also called topological indices. These descriptors are useful in determination of some properties of chemical structures and preferred to some earlier descriptors as they are more practical. Especially the first and second Zagreb indices together with the first and second multiplicative Zagreb indices are considered and they are calculated in terms of the smallest and largest vertex degrees and vertex number for some well-known classes of graphs.

On Gammelgaard's Formula for a Star Product with Separation of Variables

NASA Astrophysics Data System (ADS)

Karabegov, Alexander

2013-08-01

We show that Gammelgaard's formula expressing a star product with separation of variables on a pseudo-Kähler manifold in terms of directed graphs without cycles is equivalent to an inversion formula for an operator on a formal Fock space. We prove this inversion formula directly and thus offer an alternative approach to Gammelgaard's formula which gives more insight into the question why the directed graphs in his formula have no cycles.

Left-ventricle segmentation in real-time 3D echocardiography using a hybrid active shape model and optimal graph search approach

NASA Astrophysics Data System (ADS)

Zhang, Honghai; Abiose, Ademola K.; Campbell, Dwayne N.; Sonka, Milan; Martins, James B.; Wahle, Andreas

2010-03-01

Quantitative analysis of the left ventricular shape and motion patterns associated with left ventricular mechanical dyssynchrony (LVMD) is essential for diagnosis and treatment planning in congestive heart failure. Real-time 3D echocardiography (RT3DE) used for LVMD analysis is frequently limited by heavy speckle noise or partially incomplete data, thus a segmentation method utilizing learned global shape knowledge is beneficial. In this study, the endocardial surface of the left ventricle (LV) is segmented using a hybrid approach combining active shape model (ASM) with optimal graph search. The latter is used to achieve landmark refinement in the ASM framework. Optimal graph search translates the 3D segmentation into the detection of a minimum-cost closed set in a graph and can produce a globally optimal result. Various information-gradient, intensity distributions, and regional-property terms-are used to define the costs for the graph search. The developed method was tested on 44 RT3DE datasets acquired from 26 LVMD patients. The segmentation accuracy was assessed by surface positioning error and volume overlap measured for the whole LV as well as 16 standard LV regions. The segmentation produced very good results that were not achievable using ASM or graph search alone.

The Full Ward-Takahashi Identity for Colored Tensor Models

NASA Astrophysics Data System (ADS)

Pérez-Sánchez, Carlos I.

2018-03-01

Colored tensor models (CTM) is a random geometrical approach to quantum gravity. We scrutinize the structure of the connected correlation functions of general CTM-interactions and organize them by boundaries of Feynman graphs. For rank- D interactions including, but not restricted to, all melonic φ^4 -vertices—to wit, solely those quartic vertices that can lead to dominant spherical contributions in the large- N expansion—the aforementioned boundary graphs are shown to be precisely all (possibly disconnected) vertex-bipartite regularly edge- D-colored graphs. The concept of CTM-compatible boundary-graph automorphism is introduced and an auxiliary graph calculus is developed. With the aid of these constructs, certain U (∞)-invariance of the path integral measure is fully exploited in order to derive a strong Ward-Takahashi Identity for CTMs with a symmetry-breaking kinetic term. For the rank-3 φ^4 -theory, we get the exact integral-like equation for the 2-point function. Similarly, exact equations for higher multipoint functions can be readily obtained departing from this full Ward-Takahashi identity. Our results hold for some Group Field Theories as well. Altogether, our non-perturbative approach trades some graph theoretical methods for analytical ones. We believe that these tools can be extended to tensorial SYK-models.

Current phase relation from graphs and diagrams and application to thick ferromagnetic Josephson junctions

NASA Astrophysics Data System (ADS)

Margaris, I.; Paltoglou, V.; Flytzanis, N.

2018-05-01

In this work we present a method of representing terms in the current-phase-relation of a ballistic Josephson junction by combinations of diagrams, used in previous work to represent an equivalent of the matching condition determinant of the junction. This is accomplished by the expansion of the logarithm of this determinant in Taylor series and keeping track of surviving terms, i.e. terms that do not annihilate each other. The types of the surviving terms are represented by connected graphs, whose points represent diagrammatic terms of the determinant expansion. Then the theory is applied to obtain approximations of the current-phase relation of relatively thick ballistic ferromagnetic Josephson junctions with non-collinear magnetizations. This demonstrates the versatility of the method in developing approximations schemes and providing physical insight into the nature of contributions to the supercurrent from the available particle excitations in the junction. We also discuss the strong second harmonic contribution to the supercurrent in junctions with three mutually orthogonal magnetization vectors and a weak intermediate ferromagnet.

An Overview of the Runtime Verification Tool Java PathExplorer

NASA Technical Reports Server (NTRS)

Havelund, Klaus; Rosu, Grigore; Clancy, Daniel (Technical Monitor)

2002-01-01

We present an overview of the Java PathExplorer runtime verification tool, in short referred to as JPAX. JPAX can monitor the execution of a Java program and check that it conforms with a set of user provided properties formulated in temporal logic. JPAX can in addition analyze the program for concurrency errors such as deadlocks and data races. The concurrency analysis requires no user provided specification. The tool facilitates automated instrumentation of a program's bytecode, which when executed will emit an event stream, the execution trace, to an observer. The observer dispatches the incoming event stream to a set of observer processes, each performing a specialized analysis, such as the temporal logic verification, the deadlock analysis and the data race analysis. Temporal logic specifications can be formulated by the user in the Maude rewriting logic, where Maude is a high-speed rewriting system for equational logic, but here extended with executable temporal logic. The Maude rewriting engine is then activated as an event driven monitoring process. Alternatively, temporal specifications can be translated into efficient automata, which check the event stream. JPAX can be used during program testing to gain increased information about program executions, and can potentially furthermore be applied during operation to survey safety critical systems.

New developments in optical phase-change memory

NASA Astrophysics Data System (ADS)

Ovshinsky, Stanford R.; Czubatyj, Wolodymyr

2001-02-01

Phase change technology has progressed from the original invention of Ovshinsky to become the leading choice for rewritable optical disks. ECD's early work in phase change materials and methods for operating in a direct overwrite fashion were crucial to the successes that have been achieved. Since the introduction of the first rewritable phase change products in 1991, the market has expanded from CD-RW into rewritable DVD with creative work going on worldwide. Phase change technology is ideally suited to address the continuous demand for increased storage capacity. First, laser beams can be focused to ever-smaller spot sizes using shorter wavelength lasers and higher performance optics. Blue lasers are now commercially viable and high numerical aperture and near field lenses have been demonstrated. Second, multilevel approaches can be used to increase capacity by a factor of three or more with concomitant increases in data transfer rate. In addition, ECD has decreased manufacturing costs through the use of innovative production technology. These factors combine to accelerate the widespread use of phase change technology. As in all our technologies, such as thin film photovoltaics, nickel metal hydride batteries, hydrogen storage systems, fuel cells, electrical memory, etc., we have invented the materials, the products, the production machines and the production processes for high rate, low-cost manufacture.

Low-flow frequency curves for selected long-term stream gaging stations in eastern United States

USGS Publications Warehouse

Hardison, Clayton H.; Martin, Robert O.R.

1963-01-01

Curves showing the magnitude and frequency of annual low flow at 85 streamgaging stations located in 17 States east and 5 States west of the Mississippi River have been smoothed and adjusted to one of four long-term periods. They are presented to show the similarity and dissimilarity of curves even in the same State and to provide background information for studies of the statistical properties of low-flow frequency curves and for studies of the relation between hydrologic environment and low flow. The results are presented as greatly reduced graphs to facilitate comparison and are summarized in tables from which expanded graphs can be plotted.

Visibility graph analysis of very short-term heart rate variability during sleep

NASA Astrophysics Data System (ADS)

Hou, F. Z.; Li, F. W.; Wang, J.; Yan, F. R.

2016-09-01

Based on a visibility-graph algorithm, complex networks were constructed from very short-term heart rate variability (HRV) during different sleep stages. Network measurements progressively changed from rapid eye movement (REM) sleep to light sleep and then deep sleep, exhibiting promising ability for sleep assessment. Abnormal activation of the cardiovascular controls with enhanced 'small-world' couplings and altered fractal organization during REM sleep indicates that REM could be a potential risk factor for adverse cardiovascular event, especially in males, older individuals, and people who are overweight. Additionally, an apparent influence of gender, aging, and obesity on sleep was demonstrated in healthy adults, which may be helpful for establishing expected sleep-HRV patterns in different populations.

Calculating massive 3-loop graphs for operator matrix elements by the method of hyperlogarithms

NASA Astrophysics Data System (ADS)

Ablinger, Jakob; Blümlein, Johannes; Raab, Clemens; Schneider, Carsten; Wißbrock, Fabian

2014-08-01

We calculate convergent 3-loop Feynman diagrams containing a single massive loop equipped with twist τ=2 local operator insertions corresponding to spin N. They contribute to the massive operator matrix elements in QCD describing the massive Wilson coefficients for deep-inelastic scattering at large virtualities. Diagrams of this kind can be computed using an extended version of the method of hyperlogarithms, originally being designed for massless Feynman diagrams without operators. The method is applied to Benz- and V-type graphs, belonging to the genuine 3-loop topologies. In case of the V-type graphs with five massive propagators, new types of nested sums and iterated integrals emerge. The sums are given in terms of finite binomially and inverse binomially weighted generalized cyclotomic sums, while the 1-dimensionally iterated integrals are based on a set of ∼30 square-root valued letters. We also derive the asymptotic representations of the nested sums and present the solution for N∈C. Integrals with a power-like divergence in N-space ∝aN,a∈R,a>1, for large values of N emerge. They still possess a representation in x-space, which is given in terms of root-valued iterated integrals in the present case. The method of hyperlogarithms is also used to calculate higher moments for crossed box graphs with different operator insertions.

Determining the semantic similarities among Gene Ontology terms.

PubMed

Taha, Kamal

2013-05-01

We present in this paper novel techniques that determine the semantic relationships among GeneOntology (GO) terms. We implemented these techniques in a prototype system called GoSE, which resides between user application and GO database. Given a set S of GO terms, GoSE would return another set S' of GO terms, where each term in S' is semantically related to each term in S. Most current research is focused on determining the semantic similarities among GO ontology terms based solely on their IDs and proximity to one another in the GO graph structure, while overlooking the contexts of the terms, which may lead to erroneous results. The context of a GO term T is the set of other terms, whose existence in the GO graph structure is dependent on T. We propose novel techniques that determine the contexts of terms based on the concept of existence dependency. We present a stack-based sort-merge algorithm employing these techniques for determining the semantic similarities among GO terms.We evaluated GoSE experimentally and compared it with three existing methods. The results of measuring the semantic similarities among genes in KEGG and Pfam pathways retrieved from the DBGET and Sanger Pfam databases, respectively, have shown that our method outperforms the other three methods in recall and precision.

Automatic segmentation of nine retinal layer boundaries in OCT images of non-exudative AMD patients using deep learning and graph search

PubMed Central

Fang, Leyuan; Cunefare, David; Wang, Chong; Guymer, Robyn H.; Li, Shutao; Farsiu, Sina

2017-01-01

We present a novel framework combining convolutional neural networks (CNN) and graph search methods (termed as CNN-GS) for the automatic segmentation of nine layer boundaries on retinal optical coherence tomography (OCT) images. CNN-GS first utilizes a CNN to extract features of specific retinal layer boundaries and train a corresponding classifier to delineate a pilot estimate of the eight layers. Next, a graph search method uses the probability maps created from the CNN to find the final boundaries. We validated our proposed method on 60 volumes (2915 B-scans) from 20 human eyes with non-exudative age-related macular degeneration (AMD), which attested to effectiveness of our proposed technique. PMID:28663902

Automatic segmentation of nine retinal layer boundaries in OCT images of non-exudative AMD patients using deep learning and graph search.

PubMed

Fang, Leyuan; Cunefare, David; Wang, Chong; Guymer, Robyn H; Li, Shutao; Farsiu, Sina

2017-05-01

We present a novel framework combining convolutional neural networks (CNN) and graph search methods (termed as CNN-GS) for the automatic segmentation of nine layer boundaries on retinal optical coherence tomography (OCT) images. CNN-GS first utilizes a CNN to extract features of specific retinal layer boundaries and train a corresponding classifier to delineate a pilot estimate of the eight layers. Next, a graph search method uses the probability maps created from the CNN to find the final boundaries. We validated our proposed method on 60 volumes (2915 B-scans) from 20 human eyes with non-exudative age-related macular degeneration (AMD), which attested to effectiveness of our proposed technique.

Local adjacency metric dimension of sun graph and stacked book graph

NASA Astrophysics Data System (ADS)

Yulisda Badri, Alifiah; Darmaji

2018-03-01

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

Big Data Clustering via Community Detection and Hyperbolic Network Embedding in IoT Applications.

PubMed

Karyotis, Vasileios; Tsitseklis, Konstantinos; Sotiropoulos, Konstantinos; Papavassiliou, Symeon

2018-04-15

In this paper, we present a novel data clustering framework for big sensory data produced by IoT applications. Based on a network representation of the relations among multi-dimensional data, data clustering is mapped to node clustering over the produced data graphs. To address the potential very large scale of such datasets/graphs that test the limits of state-of-the-art approaches, we map the problem of data clustering to a community detection one over the corresponding data graphs. Specifically, we propose a novel computational approach for enhancing the traditional Girvan-Newman (GN) community detection algorithm via hyperbolic network embedding. The data dependency graph is embedded in the hyperbolic space via Rigel embedding, allowing more efficient computation of edge-betweenness centrality needed in the GN algorithm. This allows for more efficient clustering of the nodes of the data graph in terms of modularity, without sacrificing considerable accuracy. In order to study the operation of our approach with respect to enhancing GN community detection, we employ various representative types of artificial complex networks, such as scale-free, small-world and random geometric topologies, and frequently-employed benchmark datasets for demonstrating its efficacy in terms of data clustering via community detection. Furthermore, we provide a proof-of-concept evaluation by applying the proposed framework over multi-dimensional datasets obtained from an operational smart-city/building IoT infrastructure provided by the Federated Interoperable Semantic IoT/cloud Testbeds and Applications (FIESTA-IoT) testbed federation. It is shown that the proposed framework can be indeed used for community detection/data clustering and exploited in various other IoT applications, such as performing more energy-efficient smart-city/building sensing.

3D segmentation of lung CT data with graph-cuts: analysis of parameter sensitivities

NASA Astrophysics Data System (ADS)

Cha, Jung won; Dunlap, Neal; Wang, Brian; Amini, Amir

2016-03-01

Lung boundary image segmentation is important for many tasks including for example in development of radiation treatment plans for subjects with thoracic malignancies. In this paper, we describe a method and parameter settings for accurate 3D lung boundary segmentation based on graph-cuts from X-ray CT data1. Even though previously several researchers have used graph-cuts for image segmentation, to date, no systematic studies have been performed regarding the range of parameter that give accurate results. The energy function in the graph-cuts algorithm requires 3 suitable parameter settings: K, a large constant for assigning seed points, c, the similarity coefficient for n-links, and λ, the terminal coefficient for t-links. We analyzed the parameter sensitivity with four lung data sets from subjects with lung cancer using error metrics. Large values of K created artifacts on segmented images, and relatively much larger value of c than the value of λ influenced the balance between the boundary term and the data term in the energy function, leading to unacceptable segmentation results. For a range of parameter settings, we performed 3D image segmentation, and in each case compared the results with the expert-delineated lung boundaries. We used simple 6-neighborhood systems for n-link in 3D. The 3D image segmentation took 10 minutes for a 512x512x118 ~ 512x512x190 lung CT image volume. Our results indicate that the graph-cuts algorithm was more sensitive to the K and λ parameter settings than to the C parameter and furthermore that amongst the range of parameters tested, K=5 and λ=0.5 yielded good results.

Big Data Clustering via Community Detection and Hyperbolic Network Embedding in IoT Applications

PubMed Central

Sotiropoulos, Konstantinos

2018-01-01

In this paper, we present a novel data clustering framework for big sensory data produced by IoT applications. Based on a network representation of the relations among multi-dimensional data, data clustering is mapped to node clustering over the produced data graphs. To address the potential very large scale of such datasets/graphs that test the limits of state-of-the-art approaches, we map the problem of data clustering to a community detection one over the corresponding data graphs. Specifically, we propose a novel computational approach for enhancing the traditional Girvan–Newman (GN) community detection algorithm via hyperbolic network embedding. The data dependency graph is embedded in the hyperbolic space via Rigel embedding, allowing more efficient computation of edge-betweenness centrality needed in the GN algorithm. This allows for more efficient clustering of the nodes of the data graph in terms of modularity, without sacrificing considerable accuracy. In order to study the operation of our approach with respect to enhancing GN community detection, we employ various representative types of artificial complex networks, such as scale-free, small-world and random geometric topologies, and frequently-employed benchmark datasets for demonstrating its efficacy in terms of data clustering via community detection. Furthermore, we provide a proof-of-concept evaluation by applying the proposed framework over multi-dimensional datasets obtained from an operational smart-city/building IoT infrastructure provided by the Federated Interoperable Semantic IoT/cloud Testbeds and Applications (FIESTA-IoT) testbed federation. It is shown that the proposed framework can be indeed used for community detection/data clustering and exploited in various other IoT applications, such as performing more energy-efficient smart-city/building sensing. PMID:29662043

FUSE: a profit maximization approach for functional summarization of biological networks.

PubMed

Seah, Boon-Siew; Bhowmick, Sourav S; Dewey, C Forbes; Yu, Hanry

2012-03-21

The availability of large-scale curated protein interaction datasets has given rise to the opportunity to investigate higher level organization and modularity within the protein interaction network (PPI) using graph theoretic analysis. Despite the recent progress, systems level analysis of PPIS remains a daunting task as it is challenging to make sense out of the deluge of high-dimensional interaction data. Specifically, techniques that automatically abstract and summarize PPIS at multiple resolutions to provide high level views of its functional landscape are still lacking. We present a novel data-driven and generic algorithm called FUSE (Functional Summary Generator) that generates functional maps of a PPI at different levels of organization, from broad process-process level interactions to in-depth complex-complex level interactions, through a pro t maximization approach that exploits Minimum Description Length (MDL) principle to maximize information gain of the summary graph while satisfying the level of detail constraint. We evaluate the performance of FUSE on several real-world PPIS. We also compare FUSE to state-of-the-art graph clustering methods with GO term enrichment by constructing the biological process landscape of the PPIS. Using AD network as our case study, we further demonstrate the ability of FUSE to quickly summarize the network and identify many different processes and complexes that regulate it. Finally, we study the higher-order connectivity of the human PPI. By simultaneously evaluating interaction and annotation data, FUSE abstracts higher-order interaction maps by reducing the details of the underlying PPI to form a functional summary graph of interconnected functional clusters. Our results demonstrate its effectiveness and superiority over state-of-the-art graph clustering methods with GO term enrichment.

Nonvolatile gate effect in a ferroelectric-semiconductor quantum well.

PubMed

Stolichnov, Igor; Colla, Enrico; Setter, Nava; Wojciechowski, Tomasz; Janik, Elzbieta; Karczewski, Grzegorz

2006-12-15

Field effect transistors with ferroelectric gates would make ideal rewritable nonvolatile memories were it not for the severe problems in integrating the ferroelectric oxide directly on the semiconductor channel. We propose a powerful way to avoid these problems using a gate material that is ferroelectric and semiconducting simultaneously. First, ferroelectricity in semiconductor (Cd,Zn)Te films is proven and studied using modified piezoforce scanning probe microscopy. Then, a rewritable field effect device is demonstrated by local poling of the (Cd,Zn)Te layer of a (Cd,Zn)Te/CdTe quantum well, provoking a reversible, nonvolatile change in the resistance of the 2D electron gas. The results point to a potential new family of nanoscale one-transistor memories.

Segmentation of anterior cruciate ligament in knee MR images using graph cuts with patient-specific shape constraints and label refinement.

PubMed

Lee, Hansang; Hong, Helen; Kim, Junmo

2014-12-01

We propose a graph-cut-based segmentation method for the anterior cruciate ligament (ACL) in knee MRI with a novel shape prior and label refinement. As the initial seeds for graph cuts, candidates for the ACL and the background are extracted from knee MRI roughly by means of adaptive thresholding with Gaussian mixture model fitting. The extracted ACL candidate is segmented iteratively by graph cuts with patient-specific shape constraints. Two shape constraints termed fence and neighbor costs are suggested such that the graph cuts prevent any leakage into adjacent regions with similar intensity. The segmented ACL label is refined by means of superpixel classification. Superpixel classification makes the segmented label propagate into missing inhomogeneous regions inside the ACL. In the experiments, the proposed method segmented the ACL with Dice similarity coefficient of 66.47±7.97%, average surface distance of 2.247±0.869, and root mean squared error of 3.538±1.633, which increased the accuracy by 14.8%, 40.3%, and 37.6% from the Boykov model, respectively. Copyright © 2014 Elsevier Ltd. All rights reserved.

Information extraction and knowledge graph construction from geoscience literature

NASA Astrophysics Data System (ADS)

Wang, Chengbin; Ma, Xiaogang; Chen, Jianguo; Chen, Jingwen

2018-03-01

Geoscience literature published online is an important part of open data, and brings both challenges and opportunities for data analysis. Compared with studies of numerical geoscience data, there are limited works on information extraction and knowledge discovery from textual geoscience data. This paper presents a workflow and a few empirical case studies for that topic, with a focus on documents written in Chinese. First, we set up a hybrid corpus combining the generic and geology terms from geology dictionaries to train Chinese word segmentation rules of the Conditional Random Fields model. Second, we used the word segmentation rules to parse documents into individual words, and removed the stop-words from the segmentation results to get a corpus constituted of content-words. Third, we used a statistical method to analyze the semantic links between content-words, and we selected the chord and bigram graphs to visualize the content-words and their links as nodes and edges in a knowledge graph, respectively. The resulting graph presents a clear overview of key information in an unstructured document. This study proves the usefulness of the designed workflow, and shows the potential of leveraging natural language processing and knowledge graph technologies for geoscience.

Co-occurrence graphs for word sense disambiguation in the biomedical domain.

PubMed

Duque, Andres; Stevenson, Mark; Martinez-Romo, Juan; Araujo, Lourdes

2018-05-01

Word sense disambiguation is a key step for many natural language processing tasks (e.g. summarization, text classification, relation extraction) and presents a challenge to any system that aims to process documents from the biomedical domain. In this paper, we present a new graph-based unsupervised technique to address this problem. The knowledge base used in this work is a graph built with co-occurrence information from medical concepts found in scientific abstracts, and hence adapted to the specific domain. Unlike other unsupervised approaches based on static graphs such as UMLS, in this work the knowledge base takes the context of the ambiguous terms into account. Abstracts downloaded from PubMed are used for building the graph and disambiguation is performed using the personalized PageRank algorithm. Evaluation is carried out over two test datasets widely explored in the literature. Different parameters of the system are also evaluated to test robustness and scalability. Results show that the system is able to outperform state-of-the-art knowledge-based systems, obtaining more than 10% of accuracy improvement in some cases, while only requiring minimal external resources. Copyright © 2018 Elsevier B.V. All rights reserved.

1 / n Expansion for the Number of Matchings on Regular Graphs and Monomer-Dimer Entropy

NASA Astrophysics Data System (ADS)

Pernici, Mario

2017-08-01

Using a 1 / n expansion, that is an expansion in descending powers of n, for the number of matchings in regular graphs with 2 n vertices, we study the monomer-dimer entropy for two classes of graphs. We study the difference between the extensive monomer-dimer entropy of a random r-regular graph G (bipartite or not) with 2 n vertices and the average extensive entropy of r-regular graphs with 2 n vertices, in the limit n → ∞. We find a series expansion for it in the numbers of cycles; with probability 1 it converges for dimer density p < 1 and, for G bipartite, it diverges as |ln(1-p)| for p → 1. In the case of regular lattices, we similarly expand the difference between the specific monomer-dimer entropy on a lattice and the one on the Bethe lattice; we write down its Taylor expansion in powers of p through the order 10, expressed in terms of the number of totally reducible walks which are not tree-like. We prove through order 6 that its expansion coefficients in powers of p are non-negative.

Precalculus teachers' perspectives on using graphing calculators: an example from one curriculum

NASA Astrophysics Data System (ADS)

Karadeniz, Ilyas; Thompson, Denisse R.

2018-01-01

Graphing calculators are hand-held technological tools currently used in mathematics classrooms. Teachers' perspectives on using graphing calculators are important in terms of exploring what teachers think about using such technology in advanced mathematics courses, particularly precalculus courses. A descriptive intrinsic case study was conducted to analyse the perspectives of 11 teachers using graphing calculators with potential Computer Algebra System (CAS) capability while teaching Functions, Statistics, and Trigonometry, a precalculus course for 11th-grade students developed by the University of Chicago School Mathematics Project. Data were collected from multiple sources as part of a curriculum evaluation study conducted during the 2007-2008 school year. Although all teachers were using the same curriculum that integrated CAS into the instructional materials, teachers had mixed views about the technology. Graphing calculator features were used much more than CAS features, with many teachers concerned about the use of CAS because of pressures from external assessments. In addition, several teachers found it overwhelming to learn a new technology at the same time they were learning a new curriculum. The results have implications for curriculum developers and others working with teachers to update curriculum and the use of advanced technologies simultaneously.

Hybrid coexpression link similarity graph clustering for mining biological modules from multiple gene expression datasets

PubMed Central

2014-01-01

Background Advances in genomic technologies have enabled the accumulation of vast amount of genomic data, including gene expression data for multiple species under various biological and environmental conditions. Integration of these gene expression datasets is a promising strategy to alleviate the challenges of protein functional annotation and biological module discovery based on a single gene expression data, which suffers from spurious coexpression. Results We propose a joint mining algorithm that constructs a weighted hybrid similarity graph whose nodes are the coexpression links. The weight of an edge between two coexpression links in this hybrid graph is a linear combination of the topological similarities and co-appearance similarities of the corresponding two coexpression links. Clustering the weighted hybrid similarity graph yields recurrent coexpression link clusters (modules). Experimental results on Human gene expression datasets show that the reported modules are functionally homogeneous as evident by their enrichment with biological process GO terms and KEGG pathways. PMID:25221624

On transitions in the behaviour of tabu search algorithm TabuCol for graph colouring

NASA Astrophysics Data System (ADS)

Chalupa, D.

2018-01-01

Even though tabu search is one of the most popular metaheuristic search strategies, its understanding in terms of behavioural transitions and parameter tuning is still very limited. In this paper, we present a theoretical and experimental study of a popular tabu search algorithm TabuCol for graph colouring. We show that for some instances, there are sharp transitions in the behaviour of TabuCol, depending on the value of tabu tenure parameter. The location of this transition depends on graph structure and may also depend on its size. This is further supported by an experimental study of success rate profiles, which we define as an empirical measure of these transitions. We study the success rate profiles for a range of graph colouring instances, from 2-colouring of trees and forests to several instances from the DIMACS benchmark. These reveal that TabuCol may exhibit a spectrum of different behaviours ranging from simple transitions to highly complex probabilistic behaviour.

Site- and bond-percolation thresholds in K_{n,n}-based lattices: Vulnerability of quantum annealers to random qubit and coupler failures on chimera topologies.

PubMed

Melchert, O; Katzgraber, Helmut G; Novotny, M A

2016-04-01

We estimate the critical thresholds of bond and site percolation on nonplanar, effectively two-dimensional graphs with chimeralike topology. The building blocks of these graphs are complete and symmetric bipartite subgraphs of size 2n, referred to as K_{n,n} graphs. For the numerical simulations we use an efficient union-find-based algorithm and employ a finite-size scaling analysis to obtain the critical properties for both bond and site percolation. We report the respective percolation thresholds for different sizes of the bipartite subgraph and verify that the associated universality class is that of standard two-dimensional percolation. For the canonical chimera graph used in the D-Wave Systems Inc. quantum annealer (n=4), we discuss device failure in terms of network vulnerability, i.e., we determine the critical fraction of qubits and couplers that can be absent due to random failures prior to losing large-scale connectivity throughout the device.

New massive gravity and AdS(4) counterterms.

PubMed

Jatkar, Dileep P; Sinha, Aninda

2011-04-29

We show that the recently proposed Dirac-Born-Infeld extension of new massive gravity emerges naturally as a counterterm in four-dimensional anti-de Sitter space (AdS(4)). The resulting on-shell Euclidean action is independent of the cutoff at zero temperature. We also find that the same choice of counterterm gives the usual area law for the AdS(4) Schwarzschild black hole entropy in a cutoff-independent manner. The parameter values of the resulting counterterm action correspond to a c=0 theory in the context of the duality between AdS(3) gravity and two-dimensional conformal field theory. We rewrite this theory in terms of the gauge field that is used to recast 3D gravity as a Chern-Simons theory.

Separating OR, SUM, and XOR Circuits☆

PubMed Central

Find, Magnus; Göös, Mika; Järvisalo, Matti; Kaski, Petteri; Koivisto, Mikko; Korhonen, Janne H.

2017-01-01

Given a boolean n × n matrix A we consider arithmetic circuits for computing the transformation x ↦ Ax over different semirings. Namely, we study three circuit models: monotone OR-circuits, monotone SUM-circuits (addition of non-negative integers), and non-monotone XOR-circuits (addition modulo 2). Our focus is on separating OR-circuits from the two other models in terms of circuit complexity: We show how to obtain matrices that admit OR-circuits of size O(n), but require SUM-circuits of size Ω(n3/2/log2n).We consider the task of rewriting a given OR-circuit as a XOR-circuit and prove that any subquadratic-time algorithm for this task violates the strong exponential time hypothesis. PMID:28529379

Approximate inference on planar graphs using loop calculus and belief progagation

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

Chertkov, Michael; Gomez, Vicenc; Kappen, Hilbert

We introduce novel results for approximate inference on planar graphical models using the loop calculus framework. The loop calculus (Chertkov and Chernyak, 2006b) allows to express the exact partition function Z of a graphical model as a finite sum of terms that can be evaluated once the belief propagation (BP) solution is known. In general, full summation over all correction terms is intractable. We develop an algorithm for the approach presented in Chertkov et al. (2008) which represents an efficient truncation scheme on planar graphs and a new representation of the series in terms of Pfaffians of matrices. We analyzemore » in detail both the loop series and the Pfaffian series for models with binary variables and pairwise interactions, and show that the first term of the Pfaffian series can provide very accurate approximations. The algorithm outperforms previous truncation schemes of the loop series and is competitive with other state-of-the-art methods for approximate inference.« less

Acoustic Inverse Scattering for Breast Cancer Microcalcification Detection. Addendum

DTIC Science & Technology

2011-12-01

the center. To conserve space, few are shown here. A graph comparing the spatial location and the error in reconstruction will follow...following graphs show the error in reconstruction as a function of position of the object along the x-axis, y-axis and the diagonal in the fourth quadrant of...the well-known Kirchhoff – Poisson formulas (see, e.g., Refs. [33,34]) allow one to rep- resent the solution p(x,t) in terms of the spherical means

Evolutionary dynamics on graphs: Efficient method for weak selection

NASA Astrophysics Data System (ADS)

Fu, Feng; Wang, Long; Nowak, Martin A.; Hauert, Christoph

2009-04-01

Investigating the evolutionary dynamics of game theoretical interactions in populations where individuals are arranged on a graph can be challenging in terms of computation time. Here, we propose an efficient method to study any type of game on arbitrary graph structures for weak selection. In this limit, evolutionary game dynamics represents a first-order correction to neutral evolution. Spatial correlations can be empirically determined under neutral evolution and provide the basis for formulating the game dynamics as a discrete Markov process by incorporating a detailed description of the microscopic dynamics based on the neutral correlations. This framework is then applied to one of the most intriguing questions in evolutionary biology: the evolution of cooperation. We demonstrate that the degree heterogeneity of a graph impedes cooperation and that the success of tit for tat depends not only on the number of rounds but also on the degree of the graph. Moreover, considering the mutation-selection equilibrium shows that the symmetry of the stationary distribution of states under weak selection is skewed in favor of defectors for larger selection strengths. In particular, degree heterogeneity—a prominent feature of scale-free networks—generally results in a more pronounced increase in the critical benefit-to-cost ratio required for evolution to favor cooperation as compared to regular graphs. This conclusion is corroborated by an analysis of the effects of population structures on the fixation probabilities of strategies in general 2×2 games for different types of graphs. Computer simulations confirm the predictive power of our method and illustrate the improved accuracy as compared to previous studies.

Multiple kernels learning-based biological entity relationship extraction method.

PubMed

Dongliang, Xu; Jingchang, Pan; Bailing, Wang

2017-09-20

Automatic extracting protein entity interaction information from biomedical literature can help to build protein relation network and design new drugs. There are more than 20 million literature abstracts included in MEDLINE, which is the most authoritative textual database in the field of biomedicine, and follow an exponential growth over time. This frantic expansion of the biomedical literature can often be difficult to absorb or manually analyze. Thus efficient and automated search engines are necessary to efficiently explore the biomedical literature using text mining techniques. The P, R, and F value of tag graph method in Aimed corpus are 50.82, 69.76, and 58.61%, respectively. The P, R, and F value of tag graph kernel method in other four evaluation corpuses are 2-5% higher than that of all-paths graph kernel. And The P, R and F value of feature kernel and tag graph kernel fuse methods is 53.43, 71.62 and 61.30%, respectively. The P, R and F value of feature kernel and tag graph kernel fuse methods is 55.47, 70.29 and 60.37%, respectively. It indicated that the performance of the two kinds of kernel fusion methods is better than that of simple kernel. In comparison with the all-paths graph kernel method, the tag graph kernel method is superior in terms of overall performance. Experiments show that the performance of the multi-kernels method is better than that of the three separate single-kernel method and the dual-mutually fused kernel method used hereof in five corpus sets.

Evolving faceted surfaces: From continuum modeling, to geometric simulation, to mean-field theory

NASA Astrophysics Data System (ADS)

Norris, Scott A.

We first consider the directional solidification, in two dimensions, of a dilute binary alloy having a large anisotropy of surface energy, where the sample is pulled in a high-energy direction such that the planar state is thermodynamically prohibited. Analyses including reduction of dynamics, matched asymptotic analysis, and energy minimization are used to show that the interface assumes a faceted profile with small wavelength. Questions on stability and other dynamic behavior lead to the derivation of a facet-velocity law. This shows the that faceted steady solutions are stable in the absence of constitutional supercooling, while in its presence, coarsening replaces cell formation as the mechanism of instability. We next proceed to introduce a computational-geometry tool which, given a facet-velocity law, performs large-scale simulations of fully-faceted coarsening surfaces, first in the special case with only three allowed facet orientations (threefold symmetry), and then for arbitrary surfaces. Topological events including coarsening are comprehensively considered, and are treated explicitly by our method using both a priori knowledge of event outcomes and a novel graph-rewriting algorithm. While careful attention must be paid to both non-unique topological events and the imposition of a discrete time-stepping scheme, the resulting method allows rapid simulation of large surfaces and easy extraction of statistical data. Example statistics are provided for the threefold case based on simulations totaling one million facets. Finally, a mean-field theory is developed for the scale-invariant length distributions observed during the coarsening of one-dimensional faceted surfaces. This theory closely follows the LSW theory of Ostwald ripening in two-phase systems, but the mechanism of coarsening in faceted surfaces requires the derivation of additional terms to model the coalescence of facets. The model is solved by the exponential distribution, but agreement with experiment is limited by the assumption that neighboring facet lengths are uncorrelated. However, the method concisely describes the essential processes operating in the scaling state, illuminates a clear path for future refinement, and offers a generic framework for the investigation of faceted surfaces evolving under arbitrary dynamics.

A Prediction Error-driven Retrieval Procedure for Destabilizing and Rewriting Maladaptive Reward Memories in Hazardous Drinkers

PubMed Central

Das, Ravi K.; Gale, Grace; Hennessy, Vanessa; Kamboj, Sunjeev K.

2018-01-01

Maladaptive reward memories (MRMs) can become unstable following retrieval under certain conditions, allowing their modification by subsequent new learning. However, robust (well-rehearsed) and chronologically old MRMs, such as those underlying substance use disorders, do not destabilize easily when retrieved. A key determinate of memory destabilization during retrieval is prediction error (PE). We describe a retrieval procedure for alcohol MRMs in hazardous drinkers that specifically aims to maximize the generation of PE and therefore the likelihood of MRM destabilization. The procedure requires explicitly generating the expectancy of alcohol consumption and then violating this expectancy (withholding alcohol) following the presentation of a brief set of prototypical alcohol cue images (retrieval + PE). Control procedures involve presenting the same cue images, but allow alcohol to be consumed, generating minimal PE (retrieval-no PE) or generate PE without retrieval of alcohol MRMs, by presenting orange juice cues (no retrieval + PE). Subsequently, we describe a multisensory disgust-based counterconditioning procedure to probe MRM destabilization by re-writing alcohol cue-reward associations prior to reconsolidation. This procedure pairs alcohol cues with images invoking pathogen disgust and an extremely bitter-tasting solution (denatonium benzoate), generating gustatory disgust. Following retrieval + PE, but not no retrieval + PE or retrieval-no PE, counterconditioning produces evidence of MRM rewriting as indexed by lasting reductions in alcohol cue valuation, attentional capture, and alcohol craving. PMID:29364255

Nitrogen-doped partially reduced graphene oxide rewritable nonvolatile memory.

PubMed

Seo, Sohyeon; Yoon, Yeoheung; Lee, Junghyun; Park, Younghun; Lee, Hyoyoung

2013-04-23

As memory materials, two-dimensional (2D) carbon materials such as graphene oxide (GO)-based materials have attracted attention due to a variety of advantageous attributes, including their solution-processability and their potential for highly scalable device fabrication for transistor-based memory and cross-bar memory arrays. In spite of this, the use of GO-based materials has been limited, primarily due to uncontrollable oxygen functional groups. To induce the stable memory effect by ionic charges of a negatively charged carboxylic acid group of partially reduced graphene oxide (PrGO), a positively charged pyridinium N that served as a counterion to the negatively charged carboxylic acid was carefully introduced on the PrGO framework. Partially reduced N-doped graphene oxide (PrGODMF) in dimethylformamide (DMF) behaved as a semiconducting nonvolatile memory material. Its optical energy band gap was 1.7-2.1 eV and contained a sp2 C═C framework with 45-50% oxygen-functionalized carbon density and 3% doped nitrogen atoms. In particular, rewritable nonvolatile memory characteristics were dependent on the proportion of pyridinum N, and as the proportion of pyridinium N atom decreased, the PrGODMF film lost memory behavior. Polarization of charged PrGODMF containing pyridinium N and carboxylic acid under an electric field produced N-doped PrGODMF memory effects that followed voltage-driven rewrite-read-erase-read processes.

Matrix models and stochastic growth in Donaldson-Thomas theory

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

Szabo, Richard J.; Tierz, Miguel; Departamento de Analisis Matematico, Facultad de Ciencias Matematicas, Universidad Complutense de Madrid, Plaza de Ciencias 3, 28040 Madrid

We show that the partition functions which enumerate Donaldson-Thomas invariants of local toric Calabi-Yau threefolds without compact divisors can be expressed in terms of specializations of the Schur measure. We also discuss the relevance of the Hall-Littlewood and Jack measures in the context of BPS state counting and study the partition functions at arbitrary points of the Kaehler moduli space. This rewriting in terms of symmetric functions leads to a unitary one-matrix model representation for Donaldson-Thomas theory. We describe explicitly how this result is related to the unitary matrix model description of Chern-Simons gauge theory. This representation is used tomore » show that the generating functions for Donaldson-Thomas invariants are related to tau-functions of the integrable Toda and Toeplitz lattice hierarchies. The matrix model also leads to an interpretation of Donaldson-Thomas theory in terms of non-intersecting paths in the lock-step model of vicious walkers. We further show that these generating functions can be interpreted as normalization constants of a corner growth/last-passage stochastic model.« less

Maximal cuts and differential equations for Feynman integrals. An application to the three-loop massive banana graph

NASA Astrophysics Data System (ADS)

Primo, Amedeo; Tancredi, Lorenzo

2017-08-01

We consider the calculation of the master integrals of the three-loop massive banana graph. In the case of equal internal masses, the graph is reduced to three master integrals which satisfy an irreducible system of three coupled linear differential equations. The solution of the system requires finding a 3 × 3 matrix of homogeneous solutions. We show how the maximal cut can be used to determine all entries of this matrix in terms of products of elliptic integrals of first and second kind of suitable arguments. All independent solutions are found by performing the integration which defines the maximal cut on different contours. Once the homogeneous solution is known, the inhomogeneous solution can be obtained by use of Euler's variation of constants.

Pinching parameters for open (super) strings

NASA Astrophysics Data System (ADS)

Playle, Sam; Sciuto, Stefano

2018-02-01

We present an approach to the parametrization of (super) Schottky space obtained by sewing together three-punctured discs with strips. Different cubic ribbon graphs classify distinct sets of pinching parameters; we show how they are mapped onto each other. The parametrization is particularly well-suited to describing the region within (super) moduli space where open bosonic or Neveu-Schwarz string propagators become very long and thin, which dominates the IR behaviour of string theories. We show how worldsheet objects such as the Green's function converge to graph theoretic objects such as the Symanzik polynomials in the α ' → 0 limit, allowing us to see how string theory reproduces the sum over Feynman graphs. The (super) string measure takes on a simple and elegant form when expressed in terms of these parameters.

Can We Recognize an Innovation? Perspective from an Evolving Network Model

NASA Astrophysics Data System (ADS)

Jain, Sanjay; Krishna, Sandeep

"Innovations" are central to the evolution of societies and the evolution of life. But what constitutes an innovation? We can often agree after the event, when its consequences and impact over a long term are known, whether something was an innovation, and whether it was a "big" innovation or a "minor" one. But can we recognize an innovation "on the fly" as it appears? Successful entrepreneurs often can. Is it possible to formalize that intuition? We discuss this question in the setting of a mathematical model of evolving networks. The model exhibits self-organization , growth, stasis, and collapse of a complex system with many interacting components, reminiscent of real-world phenomena. A notion of "innovation" is formulated in terms of graph-theoretic constructs and other dynamical variables of the model. A new node in the graph gives rise to an innovation, provided it links up "appropriately" with existing nodes; in this view innovation necessarily depends upon the existing context. We show that innovations, as defined by us, play a major role in the birth, growth, and destruction of organizational structures. Furthermore, innovations can be categorized in terms of their graph-theoretic structure as they appear. Different structural classes of innovation have potentially different qualitative consequences for the future evolution of the system, some minor and some major. Possible general lessons from this specific model are briefly discussed.

Graph Theoretical Analysis of Functional Brain Networks: Test-Retest Evaluation on Short- and Long-Term Resting-State Functional MRI Data

PubMed Central

Wang, Jin-Hui; Zuo, Xi-Nian; Gohel, Suril; Milham, Michael P.; Biswal, Bharat B.; He, Yong

2011-01-01

Graph-based computational network analysis has proven a powerful tool to quantitatively characterize functional architectures of the brain. However, the test-retest (TRT) reliability of graph metrics of functional networks has not been systematically examined. Here, we investigated TRT reliability of topological metrics of functional brain networks derived from resting-state functional magnetic resonance imaging data. Specifically, we evaluated both short-term (<1 hour apart) and long-term (>5 months apart) TRT reliability for 12 global and 6 local nodal network metrics. We found that reliability of global network metrics was overall low, threshold-sensitive and dependent on several factors of scanning time interval (TI, long-term>short-term), network membership (NM, networks excluding negative correlations>networks including negative correlations) and network type (NT, binarized networks>weighted networks). The dependence was modulated by another factor of node definition (ND) strategy. The local nodal reliability exhibited large variability across nodal metrics and a spatially heterogeneous distribution. Nodal degree was the most reliable metric and varied the least across the factors above. Hub regions in association and limbic/paralimbic cortices showed moderate TRT reliability. Importantly, nodal reliability was robust to above-mentioned four factors. Simulation analysis revealed that global network metrics were extremely sensitive (but varying degrees) to noise in functional connectivity and weighted networks generated numerically more reliable results in compared with binarized networks. For nodal network metrics, they showed high resistance to noise in functional connectivity and no NT related differences were found in the resistance. These findings provide important implications on how to choose reliable analytical schemes and network metrics of interest. PMID:21818285

Historical contingency in fluviokarst landscape evolution

NASA Astrophysics Data System (ADS)

Phillips, Jonathan D.

2018-02-01

Lateral and vertical erosion at meander bends in the Kentucky River gorge area has created a series of strath terraces on the interior of incised meander bends. These represent a chronosequence of fluviokarst landscape evolution from the youngest valley side transition zone near the valley bottom to the oldest upland surface. This five-part chronosequence (not including the active river channel and floodplain) was analyzed in terms of the landforms that occur at each stage or surface. These include dolines, uvalas, karst valleys, pocket valleys, unincised channels, incised channels, and cliffs (smaller features such as swallets and shafts also occur). Landform coincidence analysis shows higher coincidence indices (CI) than would be expected based on an idealized chronosequence. CI values indicate genetic relationships (common causality) among some landforms and unexpected persistence of some features on older surfaces. The idealized and two observed chronosequences were also represented as graphs and analyzed using algebraic graph theory. The two field sites yielded graphs more complex and with less historical contingency than the idealized sequence. Indeed, some of the spectral graph measures for the field sites more closely approximate a purely hypothetical no-historical-contingency benchmark graph. The deviations of observations from the idealized expectations, and the high levels of graph complexity both point to potential transitions among landform types as being the dominant phenomenon, rather than canalization along a particular evolutionary pathway. As the base level of both the fluvial and karst landforms is lowered as the meanders expand, both fluvial and karst denudation are rejuvenated, and landform transitions remain active.

Multiscale weighted colored graphs for protein flexibility and rigidity analysis

NASA Astrophysics Data System (ADS)

Bramer, David; Wei, Guo-Wei

2018-02-01

Protein structural fluctuation, measured by Debye-Waller factors or B-factors, is known to correlate to protein flexibility and function. A variety of methods has been developed for protein Debye-Waller factor prediction and related applications to domain separation, docking pose ranking, entropy calculation, hinge detection, stability analysis, etc. Nevertheless, none of the current methodologies are able to deliver an accuracy of 0.7 in terms of the Pearson correlation coefficients averaged over a large set of proteins. In this work, we introduce a paradigm-shifting geometric graph model, multiscale weighted colored graph (MWCG), to provide a new generation of computational algorithms to significantly change the current status of protein structural fluctuation analysis. Our MWCG model divides a protein graph into multiple subgraphs based on interaction types between graph nodes and represents the protein rigidity by generalized centralities of subgraphs. MWCGs not only predict the B-factors of protein residues but also accurately analyze the flexibility of all atoms in a protein. The MWCG model is validated over a number of protein test sets and compared with many standard methods. An extensive numerical study indicates that the proposed MWCG offers an accuracy of over 0.8 and thus provides perhaps the first reliable method for estimating protein flexibility and B-factors. It also simultaneously predicts all-atom flexibility in a molecule.

Shocks and finite-time singularities in Hele-Shaw flow

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

Teodorescu, Razvan; Wiegmann, P; Lee, S-y

Hele-Shaw flow at vanishing surface tension is ill-defined. In finite time, the flow develops cusplike singularities. We show that the ill-defined problem admits a weak dispersive solution when singularities give rise to a graph of shock waves propagating in the viscous fluid. The graph of shocks grows and branches. Velocity and pressure jump across the shock. We formulate a few simple physical principles which single out the dispersive solution and interpret shocks as lines of decompressed fluid. We also formulate the dispersive solution in algebro-geometrical terms as an evolution of Krichever-Boutroux complex curve. We study in details the most genericmore » (2,3) cusp singularity which gives rise to an elementary branching event. This solution is self-similar and expressed in terms of elliptic functions.« less

To zoom or not to zoom: do we have enough pixels?

NASA Astrophysics Data System (ADS)

Youngworth, Richard N.; Herman, Eric

2015-09-01

Common lexicon in imaging systems includes the frequently used term digital zoom. Of course this term is somewhat of a misnomer as there is no actual zooming in such systems. Instead, digital zoom describes the zoom effect that comes with an image rewriting or reprinting that perhaps can be more accurately described as cropping and enlarging an image (a pixel remapping) for viewing. If done properly, users of the overall hybrid digital-optical system do not know the methodology employed. Hence the essential question, pondered and manipulated since the advent of mature digital image science, really becomes "do we have enough pixels to avoid optical zoom." This paper discusses known imaging factors for hybrid digital-optical systems, most notably resolution considerations. The paper is fundamentally about communication, and thereby includes information useful to the greater consumer, technical, and business community who all have an interest in understanding the key technical details that have driven the amazing technology and development of zoom systems.

Information-optimal genome assembly via sparse read-overlap graphs.

PubMed

Shomorony, Ilan; Kim, Samuel H; Courtade, Thomas A; Tse, David N C

2016-09-01

In the context of third-generation long-read sequencing technologies, read-overlap-based approaches are expected to play a central role in the assembly step. A fundamental challenge in assembling from a read-overlap graph is that the true sequence corresponds to a Hamiltonian path on the graph, and, under most formulations, the assembly problem becomes NP-hard, restricting practical approaches to heuristics. In this work, we avoid this seemingly fundamental barrier by first setting the computational complexity issue aside, and seeking an algorithm that targets information limits In particular, we consider a basic feasibility question: when does the set of reads contain enough information to allow unambiguous reconstruction of the true sequence? Based on insights from this information feasibility question, we present an algorithm-the Not-So-Greedy algorithm-to construct a sparse read-overlap graph. Unlike most other assembly algorithms, Not-So-Greedy comes with a performance guarantee: whenever information feasibility conditions are satisfied, the algorithm reduces the assembly problem to an Eulerian path problem on the resulting graph, and can thus be solved in linear time. In practice, this theoretical guarantee translates into assemblies of higher quality. Evaluations on both simulated reads from real genomes and a PacBio Escherichia coli K12 dataset demonstrate that Not-So-Greedy compares favorably with standard string graph approaches in terms of accuracy of the resulting read-overlap graph and contig N50. Available at github.com/samhykim/nsg courtade@eecs.berkeley.edu or dntse@stanford.edu Supplementary data are available at Bioinformatics online. © The Author 2016. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

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

Demeure, I.M.

The research presented here is concerned with representation techniques and tools to support the design, prototyping, simulation, and evaluation of message-based parallel, distributed computations. The author describes ParaDiGM-Parallel, Distributed computation Graph Model-a visual representation technique for parallel, message-based distributed computations. ParaDiGM provides several views of a computation depending on the aspect of concern. It is made of two complementary submodels, the DCPG-Distributed Computing Precedence Graph-model, and the PAM-Process Architecture Model-model. DCPGs are precedence graphs used to express the functionality of a computation in terms of tasks, message-passing, and data. PAM graphs are used to represent the partitioning of a computationmore » into schedulable units or processes, and the pattern of communication among those units. There is a natural mapping between the two models. He illustrates the utility of ParaDiGM as a representation technique by applying it to various computations (e.g., an adaptive global optimization algorithm, the client-server model). ParaDiGM representations are concise. They can be used in documenting the design and the implementation of parallel, distributed computations, in describing such computations to colleagues, and in comparing and contrasting various implementations of the same computation. He then describes VISA-VISual Assistant, a software tool to support the design, prototyping, and simulation of message-based parallel, distributed computations. VISA is based on the ParaDiGM model. In particular, it supports the editing of ParaDiGM graphs to describe the computations of interest, and the animation of these graphs to provide visual feedback during simulations. The graphs are supplemented with various attributes, simulation parameters, and interpretations which are procedures that can be executed by VISA.« less

THE PEAKS AND GEOMETRY OF FITNESS LANDSCAPES

PubMed Central

CRONA, KRISTINA; GREENE, DEVIN; BARLOW, MIRIAM

2012-01-01

Fitness landscapes are central in the theory of adaptation. Recent work compares global and local properties of fitness landscapes. It has been shown that multi-peaked fitness landscapes have a local property called reciprocal sign epistasis interactions. The converse is not true. We show that no condition phrased in terms of reciprocal sign epistasis interactions only, implies multiple peaks. We give a sufficient condition for multiple peaks phrased in terms of two-way interactions. This result is surprising since it has been claimed that no sufficient local condition for multiple peaks exist. We show that our result cannot be generalized to sufficient conditions for three or more peaks. Our proof depends on fitness graphs, where nodes represent genotypes and where arrows point toward more fit genotypes. We also use fitness graphs in order to give a new brief proof of the equivalent characterizations of fitness landscapes lacking genetic constraints on accessible mutational trajectories. We compare a recent geometric classification of fitness landscape based on triangulations of polytopes with qualitative aspects of gene interactions. One observation is that fitness graphs provide information not contained in the geometric classification. We argue that a qualitative perspective may help relating theory of fitness landscapes and empirical observations. PMID:23036916

Unsupervised chunking based on graph propagation from bilingual corpus.

PubMed

Zhu, Ling; Wong, Derek F; Chao, Lidia S

2014-01-01

This paper presents a novel approach for unsupervised shallow parsing model trained on the unannotated Chinese text of parallel Chinese-English corpus. In this approach, no information of the Chinese side is applied. The exploitation of graph-based label propagation for bilingual knowledge transfer, along with an application of using the projected labels as features in unsupervised model, contributes to a better performance. The experimental comparisons with the state-of-the-art algorithms show that the proposed approach is able to achieve impressive higher accuracy in terms of F-score.

Localisation in a Growth Model with Interaction

NASA Astrophysics Data System (ADS)

Costa, M.; Menshikov, M.; Shcherbakov, V.; Vachkovskaia, M.

2018-05-01

This paper concerns the long term behaviour of a growth model describing a random sequential allocation of particles on a finite cycle graph. The model can be regarded as a reinforced urn model with graph-based interaction. It is motivated by cooperative sequential adsorption, where adsorption rates at a site depend on the configuration of existing particles in the neighbourhood of that site. Our main result is that, with probability one, the growth process will eventually localise either at a single site, or at a pair of neighbouring sites.

Next generation data harmonization

NASA Astrophysics Data System (ADS)

Armstrong, Chandler; Brown, Ryan M.; Chaves, Jillian; Czerniejewski, Adam; Del Vecchio, Justin; Perkins, Timothy K.; Rudnicki, Ron; Tauer, Greg

2015-05-01

Analysts are presented with a never ending stream of data sources. Often, subsets of data sources to solve problems are easily identified but the process to align data sets is time consuming. However, many semantic technologies do allow for fast harmonization of data to overcome these problems. These include ontologies that serve as alignment targets, visual tools and natural language processing that generate semantic graphs in terms of the ontologies, and analytics that leverage these graphs. This research reviews a developed prototype that employs all these approaches to perform analysis across disparate data sources documenting violent, extremist events.

Localisation in a Growth Model with Interaction

NASA Astrophysics Data System (ADS)

Costa, M.; Menshikov, M.; Shcherbakov, V.; Vachkovskaia, M.

2018-06-01

This paper concerns the long term behaviour of a growth model describing a random sequential allocation of particles on a finite cycle graph. The model can be regarded as a reinforced urn model with graph-based interaction. It is motivated by cooperative sequential adsorption, where adsorption rates at a site depend on the configuration of existing particles in the neighbourhood of that site. Our main result is that, with probability one, the growth process will eventually localise either at a single site, or at a pair of neighbouring sites.

Resistance Distances and Kirchhoff Index in Generalised Join Graphs

NASA Astrophysics Data System (ADS)

Chen, Haiyan

2017-03-01

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

Multiplex visibility graphs to investigate recurrent neural network dynamics

NASA Astrophysics Data System (ADS)

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

2017-03-01

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

Multiplex visibility graphs to investigate recurrent neural network dynamics

PubMed Central

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

2017-01-01

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

Effects of self-graphing and goal setting on the math fact fluency of students with disabilities.

PubMed

Figarola, Patricia M; Gunter, Philip L; Reffel, Julia M; Worth, Susan R; Hummel, John; Gerber, Brian L

2008-01-01

We evaluated the impact of goal setting and students' participation in graphing their own performance data on the rate of math fact calculations. Participants were 3 students with mild disabilities in the first and second grades; 2 of the 3 students were also identified with Attention-Deficit/Hyperactivity Disorder (ADHD). They were taught to use Microsoft Excel® software to graph their rate of correct calculations when completing timed, independent practice sheets consisting of single-digit mathematics problems. Two students' rates of correct calculations nearly always met or exceeded the aim line established for their correct calculations. Additional interventions were required for the third student. Results are discussed in terms of implications and future directions for increasing the use of evaluation components in classrooms for students at risk for behavior disorders and academic failure.

Assembly planning based on subassembly extraction

NASA Technical Reports Server (NTRS)

Lee, Sukhan; Shin, Yeong Gil

1990-01-01

A method is presented for the automatic determination of assembly partial orders from a liaison graph representation of an assembly through the extraction of preferred subassemblies. In particular, the authors show how to select a set of tentative subassemblies by decomposing a liaison graph into a set of subgraphs based on feasibility and difficulty of disassembly, how to evaluate each of the tentative subassemblies in terms of assembly cost using the subassembly selection indices, and how to construct a hierarchical partial order graph (HPOG) as an assembly plan. The method provides an approach to assembly planning by identifying spatial parallelism in assembly as a means of constructing temporal relationships among assembly operations and solves the problem of finding a cost-effective assembly plan in a flexible environment. A case study of the assembly planning of a mechanical assembly is presented.

Diffusion-based recommendation with trust relations on tripartite graphs

NASA Astrophysics Data System (ADS)

Wang, Ximeng; Liu, Yun; Zhang, Guangquan; Xiong, Fei; Lu, Jie

2017-08-01

The diffusion-based recommendation approach is a vital branch in recommender systems, which successfully applies physical dynamics to make recommendations for users on bipartite or tripartite graphs. Trust links indicate users’ social relations and can provide the benefit of reducing data sparsity. However, traditional diffusion-based algorithms only consider rating links when making recommendations. In this paper, the complementarity of users’ implicit and explicit trust is exploited, and a novel resource-allocation strategy is proposed, which integrates these two kinds of trust relations on tripartite graphs. Through empirical studies on three benchmark datasets, our proposed method obtains better performance than most of the benchmark algorithms in terms of accuracy, diversity and novelty. According to the experimental results, our method is an effective and reasonable way to integrate additional features into the diffusion-based recommendation approach.

What Works for Me.

ERIC Educational Resources Information Center

Wolf, Lori; And Others

1994-01-01

Offers 11 classroom tips from teachers for a variety of activities, including fictional movie reviews, haiku writing, questions to develop student journals, handouts, rewriting stories, and a "dirty trick" to get better research topics. (SR)

Audre's daughter: Black lesbian steganography in Dee Rees' Pariah and Audre Lorde's Zami: A New Spelling of My Name.

PubMed

Kang, Nancy

2016-01-01

This article argues that African-American director Dee Rees' critically acclaimed debut Pariah (2011) is a rewriting of lesbian poet-activist Audre Lorde's iconic "bio-mythography" Zami: A New Spelling of My Name (1982). The article examines how Rees' work creatively and subtly re-envisions Lorde's Zami by way of deeply rooted and often cleverly camouflaged patterns, resonances, and contrasts. Shared topics include naming, mother-daughter bonds, the role of clothing in identity formation, domestic abuse, queer time, and lesbian, gay, bisexual, and transgender legacy discourse construction. What emerges between the visual and written texts is a hidden language of connection--what may be termed Black lesbian steganography--which proves thought-provoking to viewers and readers alike.

Gravitational Scattering Amplitudes and Closed String Field Theory in the Proper-Time Gauge

NASA Astrophysics Data System (ADS)

Lee, Taejin

2018-01-01

We construct a covariant closed string field theory by extending recent works on the covariant open string field theory in the proper-time gauge. Rewriting the string scattering amplitudes generated by the closed string field theory in terms of the Polyakov string path integrals, we identify the Fock space representations of the closed string vertices. We show that the Fock space representations of the closed string field theory may be completely factorized into those of the open string field theory. It implies that the well known Kawai-Lewellen-Tye (KLT) relations of the first quantized string theory may be promoted to the second quantized closed string theory. We explicitly calculate the scattering amplitudes of three gravitons by using the closed string field theory in the proper-time gauge.

Two-point correlators revisited: fast and slow scales in multifield models of inflation

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

Ghersi, José T. Gálvez; Frolov, Andrei V., E-mail: joseg@sfu.ca, E-mail: frolov@sfu.ca

2017-05-01

We study the structure of two-point correlators of the inflationary field fluctuations in order to improve the accuracy and efficiency of the existing methods to calculate primordial spectra. We present a description motivated by the separation of the fast and slow evolving components of the spectrum which is based on Cholesky decomposition of the field correlator matrix. Our purpose is to rewrite all the relevant equations of motion in terms of slowly varying quantities. This is important in order to consider the contribution from high-frequency modes to the spectrum without affecting computational performance. The slow-roll approximation is not required tomore » reproduce the main distinctive features in the power spectrum for each specific model of inflation.« less

Improving Child Outcomes with Data-Based Decision Making: Graphing Data

ERIC Educational Resources Information Center

Hojnoski, Robin L.; Gischlar, Karen L.; Missall, Kristen N.

2009-01-01

Child performance data collected frequently in natural settings are important for monitoring progress toward short-term and long-term goals and are an essential component of instruction designed to improve outcomes for children. Organizing child performance data into graphic displays can promote the systematic use of data in educational decision…

Experiencing "Macbeth": From Text Rendering to Multicultural Performance.

ERIC Educational Resources Information Center

Reisin, Gail

1993-01-01

Shows how one teacher used innovative methods in teaching William Shakespeare's "Macbeth." Outlines student assignments including text renderings, rewriting a scene from the play, and creating a multicultural scrapbook for the play. (HB)

Electronic paper rewrites the rulebook for displays

NASA Astrophysics Data System (ADS)

Graham-Rowe, Duncan

2007-05-01

Following years of development, electronic paper is now entering ebooks, mobile phones and signs, and, as Duncan Graham-Rowe reports, is starting to gain the market acceptance that it has long strived for.

50 CFR 600.507 - Recordkeeping.

Code of Federal Regulations, 2010 CFR

2010-10-01

... indelible ink, with corrections to be accomplished by lining out and rewriting, rather than erasure. (i) Alternative log formats. As an alternative to the use of the specific formats provided, a Nation may submit a...

50 CFR 600.507 - Recordkeeping.

Code of Federal Regulations, 2011 CFR

2011-10-01

... indelible ink, with corrections to be accomplished by lining out and rewriting, rather than erasure. (i) Alternative log formats. As an alternative to the use of the specific formats provided, a Nation may submit a...

Monitoring Java Programs with Java PathExplorer

NASA Technical Reports Server (NTRS)

Havelund, Klaus; Rosu, Grigore; Clancy, Daniel (Technical Monitor)

2001-01-01

We present recent work on the development Java PathExplorer (JPAX), a tool for monitoring the execution of Java programs. JPAX can be used during program testing to gain increased information about program executions, and can potentially furthermore be applied during operation to survey safety critical systems. The tool facilitates automated instrumentation of a program's late code which will then omit events to an observer during its execution. The observer checks the events against user provided high level requirement specifications, for example temporal logic formulae, and against lower level error detection procedures, for example concurrency related such as deadlock and data race algorithms. High level requirement specifications together with their underlying logics are defined in the Maude rewriting logic, and then can either be directly checked using the Maude rewriting engine, or be first translated to efficient data structures and then checked in Java.

Partial Data Traces: Efficient Generation and Representation

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

Mueller, F; De Supinski, B R; McKee, S A

2001-08-20

Binary manipulation techniques are increasing in popularity. They support program transformations tailored toward certain program inputs, and these transformations have been shown to yield performance gains beyond the scope of static code optimizations without profile-directed feedback. They even deliver moderate gains in the presence of profile-guided optimizations. In addition, transformations can be performed on the entire executable, including library routines. This work focuses on program instrumentation, yet another application of binary manipulation. This paper reports preliminary results on generating partial data traces through dynamic binary rewriting. The contributions are threefold. First, a portable method for extracting precise data traces formore » partial executions of arbitrary applications is developed. Second, a set of hierarchical structures for compactly representing these accesses is developed. Third, an efficient online algorithm to detect regular accesses is introduced. The authors utilize dynamic binary rewriting to selectively collect partial address traces of regions within a program. This allows partial tracing of hot paths for only a short time during program execution in contrast to static rewriting techniques that lack hot path detection and also lack facilities to limit the duration of data collection. Preliminary results show reductions of three orders of a magnitude of inline instrumentation over a dual process approach involving context switching. They also report constant size representations for regular access patters in nested loops. These efforts are part of a larger project to counter the increasing gap between processor and main memory speeds by means of software optimization and hardware enhancements.« less

Animal Adaptation and Acclimatization to Cold

ERIC Educational Resources Information Center

Phillips, R. E.; Watson, C. A.

1977-01-01

This article examines the mechanisms of adaptation and acclimatization of animals to cold temperatures. The differences between the two processes are explained and terms are defined. Graphs and drawings illustrate the article. (MA)

Dynamical modeling and analysis of large cellular regulatory networks

NASA Astrophysics Data System (ADS)

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

2013-06-01

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

Protein-protein interaction inference based on semantic similarity of Gene Ontology terms.

PubMed

Zhang, Shu-Bo; Tang, Qiang-Rong

2016-07-21

Identifying protein-protein interactions is important in molecular biology. Experimental methods to this issue have their limitations, and computational approaches have attracted more and more attentions from the biological community. The semantic similarity derived from the Gene Ontology (GO) annotation has been regarded as one of the most powerful indicators for protein interaction. However, conventional methods based on GO similarity fail to take advantage of the specificity of GO terms in the ontology graph. We proposed a GO-based method to predict protein-protein interaction by integrating different kinds of similarity measures derived from the intrinsic structure of GO graph. We extended five existing methods to derive the semantic similarity measures from the descending part of two GO terms in the GO graph, then adopted a feature integration strategy to combines both the ascending and the descending similarity scores derived from the three sub-ontologies to construct various kinds of features to characterize each protein pair. Support vector machines (SVM) were employed as discriminate classifiers, and five-fold cross validation experiments were conducted on both human and yeast protein-protein interaction datasets to evaluate the performance of different kinds of integrated features, the experimental results suggest the best performance of the feature that combines information from both the ascending and the descending parts of the three ontologies. Our method is appealing for effective prediction of protein-protein interaction. Copyright © 2016 Elsevier Ltd. All rights reserved.

Job Analysis: A Local Government's Experience.

ERIC Educational Resources Information Center

Urbanek, Steve J.

1997-01-01

A county personnel department undertook reclassification of all positions by collecting and using job analysis data to rewrite job descriptions. External pay equity and validated selection procedures resulted with only a modest increase in payroll costs. (SK)

RAG-3D: A search tool for RNA 3D substructures

DOE PAGES

Zahran, Mai; Sevim Bayrak, Cigdem; Elmetwaly, Shereef; ...

2015-08-24

In this study, to address many challenges in RNA structure/function prediction, the characterization of RNA's modular architectural units is required. Using the RNA-As-Graphs (RAG) database, we have previously explored the existence of secondary structure (2D) submotifs within larger RNA structures. Here we present RAG-3D—a dataset of RNA tertiary (3D) structures and substructures plus a web-based search tool—designed to exploit graph representations of RNAs for the goal of searching for similar 3D structural fragments. The objects in RAG-3D consist of 3D structures translated into 3D graphs, cataloged based on the connectivity between their secondary structure elements. Each graph is additionally describedmore » in terms of its subgraph building blocks. The RAG-3D search tool then compares a query RNA 3D structure to those in the database to obtain structurally similar structures and substructures. This comparison reveals conserved 3D RNA features and thus may suggest functional connections. Though RNA search programs based on similarity in sequence, 2D, and/or 3D structural elements are available, our graph-based search tool may be advantageous for illuminating similarities that are not obvious; using motifs rather than sequence space also reduces search times considerably. Ultimately, such substructuring could be useful for RNA 3D structure prediction, structure/function inference and inverse folding.« less

RAG-3D: a search tool for RNA 3D substructures

PubMed Central

Zahran, Mai; Sevim Bayrak, Cigdem; Elmetwaly, Shereef; Schlick, Tamar

2015-01-01

To address many challenges in RNA structure/function prediction, the characterization of RNA's modular architectural units is required. Using the RNA-As-Graphs (RAG) database, we have previously explored the existence of secondary structure (2D) submotifs within larger RNA structures. Here we present RAG-3D—a dataset of RNA tertiary (3D) structures and substructures plus a web-based search tool—designed to exploit graph representations of RNAs for the goal of searching for similar 3D structural fragments. The objects in RAG-3D consist of 3D structures translated into 3D graphs, cataloged based on the connectivity between their secondary structure elements. Each graph is additionally described in terms of its subgraph building blocks. The RAG-3D search tool then compares a query RNA 3D structure to those in the database to obtain structurally similar structures and substructures. This comparison reveals conserved 3D RNA features and thus may suggest functional connections. Though RNA search programs based on similarity in sequence, 2D, and/or 3D structural elements are available, our graph-based search tool may be advantageous for illuminating similarities that are not obvious; using motifs rather than sequence space also reduces search times considerably. Ultimately, such substructuring could be useful for RNA 3D structure prediction, structure/function inference and inverse folding. PMID:26304547

Primitive graphs with small exponent and small scrambling index

NASA Astrophysics Data System (ADS)

Surbakti, Ita Y.; Suwilo, Saib; Butar-butar, Ericha A.; Oktaviani, Helda

2018-01-01

A connected graph G is primitive provide there is a positive integer k such that for each pair of vertices u and v there is a uv-walk of length k. The smallest of such positive integer k is the exponent of G and is denoted by exp(G). The scrambling index of a primitive graph G, denoted by k(G), is the smallest positive integer k such that for each pair of vertices u and v there is a vertex w such that there is a uw-walk and a vw-walk of length k. By an n-chainring CR(n) we mean a graph obtained from an n-cycle by replacing each edge of the n-cycle by a triangle. By a (q,p)-dory, D(q,p), we mean a graph with vertex set V(D(q,p)) = V(P q × P p ) ∪ {w 1, w 2} and edge set E(D(q,p)) = E(P q × Pp ) ∪ {w 1 - (u i ,v 1) : i = 1, 2,…, q}∪{w 2 -(u i ,vp ) : i = 1, 2,…, q}, where Pn is a path on n vertices. We discus the exponent and scrambling index of an n- chainring and (q, p)-dory. We present formulae for exponent and scrambling index in terms of their diameter.

Brain gray matter structural network in myotonic dystrophy type 1.

PubMed

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

2017-01-01

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

RAG-3D: A search tool for RNA 3D substructures

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

Zahran, Mai; Sevim Bayrak, Cigdem; Elmetwaly, Shereef

In this study, to address many challenges in RNA structure/function prediction, the characterization of RNA's modular architectural units is required. Using the RNA-As-Graphs (RAG) database, we have previously explored the existence of secondary structure (2D) submotifs within larger RNA structures. Here we present RAG-3D—a dataset of RNA tertiary (3D) structures and substructures plus a web-based search tool—designed to exploit graph representations of RNAs for the goal of searching for similar 3D structural fragments. The objects in RAG-3D consist of 3D structures translated into 3D graphs, cataloged based on the connectivity between their secondary structure elements. Each graph is additionally describedmore » in terms of its subgraph building blocks. The RAG-3D search tool then compares a query RNA 3D structure to those in the database to obtain structurally similar structures and substructures. This comparison reveals conserved 3D RNA features and thus may suggest functional connections. Though RNA search programs based on similarity in sequence, 2D, and/or 3D structural elements are available, our graph-based search tool may be advantageous for illuminating similarities that are not obvious; using motifs rather than sequence space also reduces search times considerably. Ultimately, such substructuring could be useful for RNA 3D structure prediction, structure/function inference and inverse folding.« less

Directed network modules

NASA Astrophysics Data System (ADS)

Palla, Gergely; Farkas, Illés J.; Pollner, Péter; Derényi, Imre; Vicsek, Tamás

2007-06-01

A search technique locating network modules, i.e. internally densely connected groups of nodes in directed networks is introduced by extending the clique percolation method originally proposed for undirected networks. After giving a suitable definition for directed modules we investigate their percolation transition in the Erdos-Rényi graph both analytically and numerically. We also analyse four real-world directed networks, including Google's own web-pages, an email network, a word association graph and the transcriptional regulatory network of the yeast Saccharomyces cerevisiae. The obtained directed modules are validated by additional information available for the nodes. We find that directed modules of real-world graphs inherently overlap and the investigated networks can be classified into two major groups in terms of the overlaps between the modules. Accordingly, in the word-association network and Google's web-pages, overlaps are likely to contain in-hubs, whereas the modules in the email and transcriptional regulatory network tend to overlap via out-hubs.

FPFH-based graph matching for 3D point cloud registration

NASA Astrophysics Data System (ADS)

Zhao, Jiapeng; Li, Chen; Tian, Lihua; Zhu, Jihua

2018-04-01

Correspondence detection is a vital step in point cloud registration and it can help getting a reliable initial alignment. In this paper, we put forward an advanced point feature-based graph matching algorithm to solve the initial alignment problem of rigid 3D point cloud registration with partial overlap. Specifically, Fast Point Feature Histograms are used to determine the initial possible correspondences firstly. Next, a new objective function is provided to make the graph matching more suitable for partially overlapping point cloud. The objective function is optimized by the simulated annealing algorithm for final group of correct correspondences. Finally, we present a novel set partitioning method which can transform the NP-hard optimization problem into a O(n3)-solvable one. Experiments on the Stanford and UWA public data sets indicates that our method can obtain better result in terms of both accuracy and time cost compared with other point cloud registration methods.

The geometry of on-shell diagrams

NASA Astrophysics Data System (ADS)

Franco, Sebastián; Galloni, Daniele; Mariotti, Alberto

2014-08-01

The fundamental role of on-shell diagrams in quantum field theory has been recently recognized. On-shell diagrams, or equivalently bipartite graphs, provide a natural bridge connecting gauge theory to powerful mathematical structures such as the Grassmannian. We perform a detailed investigation of the combinatorial and geometric objects associated to these graphs. We mainly focus on their relation to polytopes and toric geometry, the Grassmannian and its stratification. Our work extends the current understanding of these connections along several important fronts, most notably eliminating restrictions imposed by planarity, positivity, reducibility and edge removability. We illustrate our ideas with several explicit examples and introduce concrete methods that considerably simplify computations. We consider it highly likely that the structures unveiled in this article will arise in the on-shell study of scattering amplitudes beyond the planar limit. Our results can be conversely regarded as an expansion in the understanding of the Grassmannian in terms of bipartite graphs.

Effects of Self-Graphing and Goal Setting on the Math Fact Fluency of Students with Disabilities

PubMed Central

Figarola, Patricia M; Gunter, Philip L; Reffel, Julia M; Worth, Susan R; Hummel, John; Gerber, Brian L

2008-01-01

We evaluated the impact of goal setting and students' participation in graphing their own performance data on the rate of math fact calculations. Participants were 3 students with mild disabilities in the first and second grades; 2 of the 3 students were also identified with Attention-Deficit/Hyperactivity Disorder (ADHD). They were taught to use Microsoft Excel® software to graph their rate of correct calculations when completing timed, independent practice sheets consisting of single-digit mathematics problems. Two students' rates of correct calculations nearly always met or exceeded the aim line established for their correct calculations. Additional interventions were required for the third student. Results are discussed in terms of implications and future directions for increasing the use of evaluation components in classrooms for students at risk for behavior disorders and academic failure. PMID:22477686

Salient object detection: manifold-based similarity adaptation approach

NASA Astrophysics Data System (ADS)

Zhou, Jingbo; Ren, Yongfeng; Yan, Yunyang; Gao, Shangbing

2014-11-01

A saliency detection algorithm based on manifold-based similarity adaptation is proposed. The proposed algorithm is divided into three steps. First, we segment an input image into superpixels, which are represented as the nodes in a graph. Second, a new similarity measurement is used in the proposed algorithm. The weight matrix of the graph, which indicates the similarities between the nodes, uses a similarity-based method. It also captures the manifold structure of the image patches, in which the graph edges are determined in a data adaptive manner in terms of both similarity and manifold structure. Then, we use local reconstruction method as a diffusion method to obtain the saliency maps. The objective function in the proposed method is based on local reconstruction, with which estimated weights capture the manifold structure. Experiments on four bench-mark databases demonstrate the accuracy and robustness of the proposed method.

Graph-associated entanglement cost of a multipartite state in exact and finite-block-length approximate constructions

NASA Astrophysics Data System (ADS)

Yamasaki, Hayata; Soeda, Akihito; Murao, Mio

2017-09-01

We introduce and analyze graph-associated entanglement cost, a generalization of the entanglement cost of quantum states to multipartite settings. We identify a necessary and sufficient condition for any multipartite entangled state to be constructible when quantum communication between the multiple parties is restricted to a quantum network represented by a tree. The condition for exact state construction is expressed in terms of the Schmidt ranks of the state defined with respect to edges of the tree. We also study approximate state construction and provide a second-order asymptotic analysis.

Health literacy in vascular and interventional radiology: a comparative analysis of online patient education resources.

PubMed

Hansberry, David R; Kraus, Carl; Agarwal, Nitin; Baker, Stephen R; Gonzales, Sharon F

2014-08-01

The Internet is frequently accessed by patients as a resource for medical knowledge. However, the provided material is typically written at a level well above the recommended 7th grade level. A clear understanding of the capabilities, limitations, risks, and benefits of interventional radiology by patients, both current and prospective, is hindered when the textual information offered to the public is pitched at a level of sophistication too high for general comprehension. In January 2013, all 25 patient education resources from the Cardiovascular and Interventional Radiology Society of Europe (CIRSE) Web site ( http://www.cirse.org ) and all 31 resources from the Society of Interventional Radiology (SIR) Web site ( http://www.sirweb.org ) were analyzed for their specific level of readability using ten quantitative scales: Flesch Reading Ease, Flesch-Kincaid Grade Level, Simple Measure of Gobbledygook, Gunning fog index, New Fog Count, Coleman-Liau index, FORCAST formula, Fry graph, Raygor Readability Estimate, and New Dale-Chall. Collectively, the patient education resources on the CIRSE Web site are written at the 12.3 grade level, while the resources on the SIR Web site are written at the 14.5 grade level. Educational health care materials available on both the CIRSE and the SIR Web sites are presented in language in the aggregate that could be too difficult for many lay people to fully understand. Given the complex nature of vascular and interventional radiology, it may be advantageous to rewrite these educational resources at a lower reading level to increase comprehension.

Reconfigurable optical assembly of nanostructures

PubMed Central

Montelongo, Yunuen; Yetisen, Ali K.; Butt, Haider; Yun, Seok-Hyun

2016-01-01

Arrangements of nanostructures in well-defined patterns are the basis of photonic crystals, metamaterials and holograms. Furthermore, rewritable optical materials can be achieved by dynamically manipulating nanoassemblies. Here we demonstrate a mechanism to configure plasmonic nanoparticles (NPs) in polymer media using nanosecond laser pulses. The mechanism relies on optical forces produced by the interference of laser beams, which allow NPs to migrate to lower-energy configurations. The resulting NP arrangements are stable without any external energy source, but erasable and rewritable by additional recording pulses. We demonstrate reconfigurable optical elements including multilayer Bragg diffraction gratings, volumetric photonic crystals and lenses, as well as dynamic holograms of three-dimensional virtual objects. We aim to expand the applications of optical forces, which have been mostly restricted to optical tweezers. Holographic assemblies of nanoparticles will allow a new generation of programmable composites for tunable metamaterials, data storage devices, sensors and displays. PMID:27337216

A kilobyte rewritable atomic memory

NASA Astrophysics Data System (ADS)

Kalff, Floris; Rebergen, Marnix; Fahrenfort, Nora; Girovsky, Jan; Toskovic, Ranko; Lado, Jose; FernáNdez-Rossier, JoaquíN.; Otte, Sander

The ability to manipulate individual atoms by means of scanning tunneling microscopy (STM) opens op opportunities for storage of digital data on the atomic scale. Recent achievements in this direction include data storage based on bits encoded in the charge state, the magnetic state, or the local presence of single atoms or atomic assemblies. However, a key challenge at this stage is the extension of such technologies into large-scale rewritable bit arrays. We demonstrate a digital atomic-scale memory of up to 1 kilobyte (8000 bits) using an array of individual surface vacancies in a chlorine terminated Cu(100) surface. The chlorine vacancies are found to be stable at temperatures up to 77 K. The memory, crafted using scanning tunneling microscopy at low temperature, can be read and re-written automatically by means of atomic-scale markers, and offers an areal density of 502 Terabits per square inch, outperforming state-of-the-art hard disk drives by three orders of magnitude.

Testing Linear Temporal Logic Formulae on Finite Execution Traces

NASA Technical Reports Server (NTRS)

Havelund, Klaus; Rosu, Grigore; Norvig, Peter (Technical Monitor)

2001-01-01

We present an algorithm for efficiently testing Linear Temporal Logic (LTL) formulae on finite execution traces. The standard models of LTL are infinite traces, reflecting the behavior of reactive and concurrent systems which conceptually may be continuously alive. In most past applications of LTL. theorem provers and model checkers have been used to formally prove that down-scaled models satisfy such LTL specifications. Our goal is instead to use LTL for up-scaled testing of real software applications. Such tests correspond to analyzing the conformance of finite traces against LTL formulae. We first describe what it means for a finite trace to satisfy an LTL property. We then suggest an optimized algorithm based on transforming LTL formulae. The work is done using the Maude rewriting system. which turns out to provide a perfect notation and an efficient rewriting engine for performing these experiments.

Federal employees health benefits: payment of premiums for periods of leave without pay or insufficient pay. Final rule.

PubMed

2007-02-05

The Office of Personnel Management (OPM) is issuing final regulations to rewrite certain sections of the Federal regulations in plain language. These final regulations require Federal agencies to provide employees entering leave without pay (LWOP) status, or whose pay is insufficient to cover their Federal Employees Health Benefits (FEHB) premium payments, written notice of their opportunity to continue their FEHB coverage. Employees who want to continue their enrollment must sign a form agreeing to pay their premiums directly to their agency on a current basis, or to incur a debt to be withheld from their future salary. The purpose of this final regulation is to rewrite the existing regulations to ensure that employees who are entering LWOP status, or whose pay is insufficient to pay their FEHB premiums, are fully informed when they decide whether or not to continue their FEHB coverage.

Naphthalene based AIE active stimuli-responsive material as rewritable media for temporary communication

NASA Astrophysics Data System (ADS)

Pannipara, Mehboobali; Al-Sehemi, Abdullah G.; Kalam, Abul; Asiri, Abdullah M.

2017-10-01

Organic molecules having extended π-conjugated moieties is useful for creating 'dynamic' functional materials by modulating the photophysical properties and molecular packing through non-covalent interactions. Herein, we report the photoluminescence properties of a luminogen, NBA, exhibiting aggregation-induced emission (AIE) characteristics, synthesized by Knoevenagel condensation reaction between 2-Hydroxy naphthaldehyde and malononitrile. NBA emits strongly upon aggregation and in solid state with large Stokes shift whereas it is non emissive in pure solvents. The aggregation induced emission behavior of the compound was carried out in DMSO (good solvent)-water mixture (poor solvent) with water fraction (fw) ranging from 0% to 98%. The AIE property of the luminogen were further exploited for fabricating rewritable fluorescent paper substrates that found applications in security printing and data storage where the written images or letters stored on the filter paper are invisible under normal light.

Perron-Frobenius theorem on the superfluid transition of an ultracold Fermi gas

NASA Astrophysics Data System (ADS)

Sakumichi, Naoyuki; Kawakami, Norio; Ueda, Masahito

2014-05-01

The Perron-Frobenius theorem is applied to identify the superfluid transition of the BCS-BEC crossover based on a cluster expansion method of Lee and Yang. Here, the cluster expansion is a systematic expansion of the equation of state (EOS) in terms of the fugacity z = exp (βμ) as βpλ3 = 2 z +b2z2 +b3z3 + ⋯ , with inverse temperature β =(kB T) - 1 , chemical potential μ, pressure p, and thermal de Broglie length λ =(2 πℏβ / m) 1 / 2 . According to the method of Lee and Yang, EOS is expressed by the Lee-Yang graphs. A singularity of an infinite series of ladder-type Lee-Yang graphs is analyzed. We point out that the singularity is governed by the Perron-Frobenius eigenvalue of a certain primitive matrix which is defined in terms of the two-body cluster functions and the Fermi distribution functions. As a consequence, it is found that there exists a unique fugacity at the phase transition point, which implies that there is no fragmentation of Bose-Einstein condensates of dimers and Cooper pairs at the ladder-approximation level of Lee-Yang graphs. An application to a BEC of strongly bounded dimers is also made.

G-Bean: an ontology-graph based web tool for biomedical literature retrieval

PubMed Central

2014-01-01

Background Currently, most people use NCBI's PubMed to search the MEDLINE database, an important bibliographical information source for life science and biomedical information. However, PubMed has some drawbacks that make it difficult to find relevant publications pertaining to users' individual intentions, especially for non-expert users. To ameliorate the disadvantages of PubMed, we developed G-Bean, a graph based biomedical search engine, to search biomedical articles in MEDLINE database more efficiently. Methods G-Bean addresses PubMed's limitations with three innovations: (1) Parallel document index creation: a multithreaded index creation strategy is employed to generate the document index for G-Bean in parallel; (2) Ontology-graph based query expansion: an ontology graph is constructed by merging four major UMLS (Version 2013AA) vocabularies, MeSH, SNOMEDCT, CSP and AOD, to cover all concepts in National Library of Medicine (NLM) database; a Personalized PageRank algorithm is used to compute concept relevance in this ontology graph and the Term Frequency - Inverse Document Frequency (TF-IDF) weighting scheme is used to re-rank the concepts. The top 500 ranked concepts are selected for expanding the initial query to retrieve more accurate and relevant information; (3) Retrieval and re-ranking of documents based on user's search intention: after the user selects any article from the existing search results, G-Bean analyzes user's selections to determine his/her true search intention and then uses more relevant and more specific terms to retrieve additional related articles. The new articles are presented to the user in the order of their relevance to the already selected articles. Results Performance evaluation with 106 OHSUMED benchmark queries shows that G-Bean returns more relevant results than PubMed does when using these queries to search the MEDLINE database. PubMed could not even return any search result for some OHSUMED queries because it failed to form the appropriate Boolean query statement automatically from the natural language query strings. G-Bean is available at http://bioinformatics.clemson.edu/G-Bean/index.php. Conclusions G-Bean addresses PubMed's limitations with ontology-graph based query expansion, automatic document indexing, and user search intention discovery. It shows significant advantages in finding relevant articles from the MEDLINE database to meet the information need of the user. PMID:25474588

G-Bean: an ontology-graph based web tool for biomedical literature retrieval.

PubMed

Wang, James Z; Zhang, Yuanyuan; Dong, Liang; Li, Lin; Srimani, Pradip K; Yu, Philip S

2014-01-01

Currently, most people use NCBI's PubMed to search the MEDLINE database, an important bibliographical information source for life science and biomedical information. However, PubMed has some drawbacks that make it difficult to find relevant publications pertaining to users' individual intentions, especially for non-expert users. To ameliorate the disadvantages of PubMed, we developed G-Bean, a graph based biomedical search engine, to search biomedical articles in MEDLINE database more efficiently. G-Bean addresses PubMed's limitations with three innovations: (1) Parallel document index creation: a multithreaded index creation strategy is employed to generate the document index for G-Bean in parallel; (2) Ontology-graph based query expansion: an ontology graph is constructed by merging four major UMLS (Version 2013AA) vocabularies, MeSH, SNOMEDCT, CSP and AOD, to cover all concepts in National Library of Medicine (NLM) database; a Personalized PageRank algorithm is used to compute concept relevance in this ontology graph and the Term Frequency - Inverse Document Frequency (TF-IDF) weighting scheme is used to re-rank the concepts. The top 500 ranked concepts are selected for expanding the initial query to retrieve more accurate and relevant information; (3) Retrieval and re-ranking of documents based on user's search intention: after the user selects any article from the existing search results, G-Bean analyzes user's selections to determine his/her true search intention and then uses more relevant and more specific terms to retrieve additional related articles. The new articles are presented to the user in the order of their relevance to the already selected articles. Performance evaluation with 106 OHSUMED benchmark queries shows that G-Bean returns more relevant results than PubMed does when using these queries to search the MEDLINE database. PubMed could not even return any search result for some OHSUMED queries because it failed to form the appropriate Boolean query statement automatically from the natural language query strings. G-Bean is available at http://bioinformatics.clemson.edu/G-Bean/index.php. G-Bean addresses PubMed's limitations with ontology-graph based query expansion, automatic document indexing, and user search intention discovery. It shows significant advantages in finding relevant articles from the MEDLINE database to meet the information need of the user.

Predicting activity approach based on new atoms similarity kernel function.

PubMed

Abu El-Atta, Ahmed H; Moussa, M I; Hassanien, Aboul Ella

2015-07-01

Drug design is a high cost and long term process. To reduce time and costs for drugs discoveries, new techniques are needed. Chemoinformatics field implements the informational techniques and computer science like machine learning and graph theory to discover the chemical compounds properties, such as toxicity or biological activity. This is done through analyzing their molecular structure (molecular graph). To overcome this problem there is an increasing need for algorithms to analyze and classify graph data to predict the activity of molecules. Kernels methods provide a powerful framework which combines machine learning with graph theory techniques. These kernels methods have led to impressive performance results in many several chemoinformatics problems like biological activity prediction. This paper presents a new approach based on kernel functions to solve activity prediction problem for chemical compounds. First we encode all atoms depending on their neighbors then we use these codes to find a relationship between those atoms each other. Then we use relation between different atoms to find similarity between chemical compounds. The proposed approach was compared with many other classification methods and the results show competitive accuracy with these methods. Copyright © 2015 Elsevier Inc. All rights reserved.

Multilabel user classification using the community structure of online networks

PubMed Central

Papadopoulos, Symeon; Kompatsiaris, Yiannis

2017-01-01

We study the problem of semi-supervised, multi-label user classification of networked data in the online social platform setting. We propose a framework that combines unsupervised community extraction and supervised, community-based feature weighting before training a classifier. We introduce Approximate Regularized Commute-Time Embedding (ARCTE), an algorithm that projects the users of a social graph onto a latent space, but instead of packing the global structure into a matrix of predefined rank, as many spectral and neural representation learning methods do, it extracts local communities for all users in the graph in order to learn a sparse embedding. To this end, we employ an improvement of personalized PageRank algorithms for searching locally in each user’s graph structure. Then, we perform supervised community feature weighting in order to boost the importance of highly predictive communities. We assess our method performance on the problem of user classification by performing an extensive comparative study among various recent methods based on graph embeddings. The comparison shows that ARCTE significantly outperforms the competition in almost all cases, achieving up to 35% relative improvement compared to the second best competing method in terms of F1-score. PMID:28278242

Multilabel user classification using the community structure of online networks.

PubMed

Rizos, Georgios; Papadopoulos, Symeon; Kompatsiaris, Yiannis

2017-01-01

We study the problem of semi-supervised, multi-label user classification of networked data in the online social platform setting. We propose a framework that combines unsupervised community extraction and supervised, community-based feature weighting before training a classifier. We introduce Approximate Regularized Commute-Time Embedding (ARCTE), an algorithm that projects the users of a social graph onto a latent space, but instead of packing the global structure into a matrix of predefined rank, as many spectral and neural representation learning methods do, it extracts local communities for all users in the graph in order to learn a sparse embedding. To this end, we employ an improvement of personalized PageRank algorithms for searching locally in each user's graph structure. Then, we perform supervised community feature weighting in order to boost the importance of highly predictive communities. We assess our method performance on the problem of user classification by performing an extensive comparative study among various recent methods based on graph embeddings. The comparison shows that ARCTE significantly outperforms the competition in almost all cases, achieving up to 35% relative improvement compared to the second best competing method in terms of F1-score.

Entropy, complexity, and Markov diagrams for random walk cancer models.

PubMed

Newton, Paul K; Mason, Jeremy; Hurt, Brian; Bethel, Kelly; Bazhenova, Lyudmila; Nieva, Jorge; Kuhn, Peter

2014-12-19

The notion of entropy is used to compare the complexity associated with 12 common cancers based on metastatic tumor distribution autopsy data. We characterize power-law distributions, entropy, and Kullback-Liebler divergence associated with each primary cancer as compared with data for all cancer types aggregated. We then correlate entropy values with other measures of complexity associated with Markov chain dynamical systems models of progression. The Markov transition matrix associated with each cancer is associated with a directed graph model where nodes are anatomical locations where a metastatic tumor could develop, and edge weightings are transition probabilities of progression from site to site. The steady-state distribution corresponds to the autopsy data distribution. Entropy correlates well with the overall complexity of the reduced directed graph structure for each cancer and with a measure of systemic interconnectedness of the graph, called graph conductance. The models suggest that grouping cancers according to their entropy values, with skin, breast, kidney, and lung cancers being prototypical high entropy cancers, stomach, uterine, pancreatic and ovarian being mid-level entropy cancers, and colorectal, cervical, bladder, and prostate cancers being prototypical low entropy cancers, provides a potentially useful framework for viewing metastatic cancer in terms of predictability, complexity, and metastatic potential.

Gaussian covariance graph models accounting for correlated marker effects in genome-wide prediction.

PubMed

Martínez, C A; Khare, K; Rahman, S; Elzo, M A

2017-10-01

Several statistical models used in genome-wide prediction assume uncorrelated marker allele substitution effects, but it is known that these effects may be correlated. In statistics, graphical models have been identified as a useful tool for covariance estimation in high-dimensional problems and it is an area that has recently experienced a great expansion. In Gaussian covariance graph models (GCovGM), the joint distribution of a set of random variables is assumed to be Gaussian and the pattern of zeros of the covariance matrix is encoded in terms of an undirected graph G. In this study, methods adapting the theory of GCovGM to genome-wide prediction were developed (Bayes GCov, Bayes GCov-KR and Bayes GCov-H). In simulated data sets, improvements in correlation between phenotypes and predicted breeding values and accuracies of predicted breeding values were found. Our models account for correlation of marker effects and permit to accommodate general structures as opposed to models proposed in previous studies, which consider spatial correlation only. In addition, they allow incorporation of biological information in the prediction process through its use when constructing graph G, and their extension to the multi-allelic loci case is straightforward. © 2017 Blackwell Verlag GmbH.

Artistic image analysis using graph-based learning approaches.

PubMed

Carneiro, Gustavo

2013-08-01

We introduce a new methodology for the problem of artistic image analysis, which among other tasks, involves the automatic identification of visual classes present in an art work. In this paper, we advocate the idea that artistic image analysis must explore a graph that captures the network of artistic influences by computing the similarities in terms of appearance and manual annotation. One of the novelties of our methodology is the proposed formulation that is a principled way of combining these two similarities in a single graph. Using this graph, we show that an efficient random walk algorithm based on an inverted label propagation formulation produces more accurate annotation and retrieval results compared with the following baseline algorithms: bag of visual words, label propagation, matrix completion, and structural learning. We also show that the proposed approach leads to a more efficient inference and training procedures. This experiment is run on a database containing 988 artistic images (with 49 visual classification problems divided into a multiclass problem with 27 classes and 48 binary problems), where we show the inference and training running times, and quantitative comparisons with respect to several retrieval and annotation performance measures.

Graph analysis of functional brain networks: practical issues in translational neuroscience

PubMed Central

De Vico Fallani, Fabrizio; Richiardi, Jonas; Chavez, Mario; Achard, Sophie

2014-01-01

The brain can be regarded as a network: a connected system where nodes, or units, represent different specialized regions and links, or connections, represent communication pathways. From a functional perspective, communication is coded by temporal dependence between the activities of different brain areas. In the last decade, the abstract representation of the brain as a graph has allowed to visualize functional brain networks and describe their non-trivial topological properties in a compact and objective way. Nowadays, the use of graph analysis in translational neuroscience has become essential to quantify brain dysfunctions in terms of aberrant reconfiguration of functional brain networks. Despite its evident impact, graph analysis of functional brain networks is not a simple toolbox that can be blindly applied to brain signals. On the one hand, it requires the know-how of all the methodological steps of the pipeline that manipulate the input brain signals and extract the functional network properties. On the other hand, knowledge of the neural phenomenon under study is required to perform physiologically relevant analysis. The aim of this review is to provide practical indications to make sense of brain network analysis and contrast counterproductive attitudes. PMID:25180301

Entropy, complexity, and Markov diagrams for random walk cancer models

NASA Astrophysics Data System (ADS)

Newton, Paul K.; Mason, Jeremy; Hurt, Brian; Bethel, Kelly; Bazhenova, Lyudmila; Nieva, Jorge; Kuhn, Peter

2014-12-01

The notion of entropy is used to compare the complexity associated with 12 common cancers based on metastatic tumor distribution autopsy data. We characterize power-law distributions, entropy, and Kullback-Liebler divergence associated with each primary cancer as compared with data for all cancer types aggregated. We then correlate entropy values with other measures of complexity associated with Markov chain dynamical systems models of progression. The Markov transition matrix associated with each cancer is associated with a directed graph model where nodes are anatomical locations where a metastatic tumor could develop, and edge weightings are transition probabilities of progression from site to site. The steady-state distribution corresponds to the autopsy data distribution. Entropy correlates well with the overall complexity of the reduced directed graph structure for each cancer and with a measure of systemic interconnectedness of the graph, called graph conductance. The models suggest that grouping cancers according to their entropy values, with skin, breast, kidney, and lung cancers being prototypical high entropy cancers, stomach, uterine, pancreatic and ovarian being mid-level entropy cancers, and colorectal, cervical, bladder, and prostate cancers being prototypical low entropy cancers, provides a potentially useful framework for viewing metastatic cancer in terms of predictability, complexity, and metastatic potential.

Transfer matrix spectrum for cyclic representations of the 6-vertex reflection algebra by quantum separation of variables

NASA Astrophysics Data System (ADS)

Pezelier, Baptiste

2018-02-01

In this proceeding, we recall the notion of quantum integrable systems on a lattice and then introduce the Sklyanin’s Separation of Variables method. We sum up the main results for the transfer matrix spectral problem for the cyclic representations of the trigonometric 6-vertex reflection algebra associated to the Bazanov-Stroganov Lax operator. These results apply as well to the spectral analysis of the lattice sine-Gordon model with open boundary conditions. The transfer matrix spectrum (both eigenvalues and eigenstates) is completely characterized in terms of the set of solutions to a discrete system of polynomial equations. We state an equivalent characterization as the set of solutions to a Baxter’s like T-Q functional equation, allowing us to rewrite the transfer matrix eigenstates in an algebraic Bethe ansatz form.

A note on Kirchhoff index

NASA Astrophysics Data System (ADS)

Zhou, Bo; Trinajstić, Nenad

2008-03-01

We report lower bounds for the Kirchhoff index of a connected (molecular) graph in terms of its structural parameters such as the number of vertices (atoms), the number of edges (bonds), maximum vertex degree (valency), connectivity and chromatic number.

Time irreversibility and intrinsics revealing of series with complex network approach

NASA Astrophysics Data System (ADS)

Xiong, Hui; Shang, Pengjian; Xia, Jianan; Wang, Jing

2018-06-01

In this work, we analyze time series on the basis of the visibility graph algorithm that maps the original series into a graph. By taking into account the all-round information carried by the signals, the time irreversibility and fractal behavior of series are evaluated from a complex network perspective, and considered signals are further classified from different aspects. The reliability of the proposed analysis is supported by numerical simulations on synthesized uncorrelated random noise, short-term correlated chaotic systems and long-term correlated fractal processes, and by the empirical analysis on daily closing prices of eleven worldwide stock indices. Obtained results suggest that finite size has a significant effect on the evaluation, and that there might be no direct relation between the time irreversibility and long-range correlation of series. Similarity and dissimilarity between stock indices are also indicated from respective regional and global perspectives, showing the existence of multiple features of underlying systems.

An analysis of fuel conserving operational procedures and design modifications for bomber/transport aircraft. Volume I. Executive summary. Final report, 7 June 1976-7 July 1978

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

Aggarwal, R.

1978-07-01

Various proposed improvements in the design and operational procedures for bomber/transport aircraft are evaluated. The evaluation is performed in terms of the estimated savings in fuel consumption and in Direct Operating Cost (DOC). As an aid in the evaluation of design modifications, graphs of fuel and DOC savings as a function of the design parameters are developed. These graphs are based on actual mission trajectory data rather than some type trajectory profile. The actual mission data is presented in terms of histograms which provide statistical information concerning altitude, air speed, take-off weight, landing weights, and mission time. Separate analyses aremore » performed on the following aircraft: the B-52G, the B-52H, the KC-135, the C-141, the C-130, and the C-5A.« less

An analysis of fuel conserving operational procedures and design modifications for bomber/transport aircraft. volume ii. Final report, 7 June 1976-7 July 1978

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

Aggarwal, R.K.

1978-07-01

Various proposed improvements in the design and operational procedures for bomber/transport aircraft are evaluated. The evaluation is performed in terms of the estimated savings in fuel consumption and in Direct Operating Cost (DOC). As an aid in the evaluation of design modifications, graphs of fuel and DOC savings as a function of the design parameters are developed. These graphs are based on actual mission trajectory data rather than some typical trajectory profile. The actual mission data is presented in terms of histograms which provide statistical information concerning altitude, air speed, take-off weight, landing weight, and mission time. Separate analyses aremore » performed on the following aircraft: the B-52G, the B-52H, the KC-135, the C-141, the C-130, and the C-5A. (Author)« less

A Clustering Graph Generator

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

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

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

A comparison of graph- and kernel-based -omics data integration algorithms for classifying complex traits.

PubMed

Yan, Kang K; Zhao, Hongyu; Pang, Herbert

2017-12-06

High-throughput sequencing data are widely collected and analyzed in the study of complex diseases in quest of improving human health. Well-studied algorithms mostly deal with single data source, and cannot fully utilize the potential of these multi-omics data sources. In order to provide a holistic understanding of human health and diseases, it is necessary to integrate multiple data sources. Several algorithms have been proposed so far, however, a comprehensive comparison of data integration algorithms for classification of binary traits is currently lacking. In this paper, we focus on two common classes of integration algorithms, graph-based that depict relationships with subjects denoted by nodes and relationships denoted by edges, and kernel-based that can generate a classifier in feature space. Our paper provides a comprehensive comparison of their performance in terms of various measurements of classification accuracy and computation time. Seven different integration algorithms, including graph-based semi-supervised learning, graph sharpening integration, composite association network, Bayesian network, semi-definite programming-support vector machine (SDP-SVM), relevance vector machine (RVM) and Ada-boost relevance vector machine are compared and evaluated with hypertension and two cancer data sets in our study. In general, kernel-based algorithms create more complex models and require longer computation time, but they tend to perform better than graph-based algorithms. The performance of graph-based algorithms has the advantage of being faster computationally. The empirical results demonstrate that composite association network, relevance vector machine, and Ada-boost RVM are the better performers. We provide recommendations on how to choose an appropriate algorithm for integrating data from multiple sources.

Developing and Evaluating Patient Education Materials.

ERIC Educational Resources Information Center

Monsivais, Diane; Reynolds, Audree

2003-01-01

Discusses the rationale for nurse involvement in the development of patient education materials. Presents guidelines for evaluating existing material, including print and web resources, for credibility and readability. Makes recommendations for rewriting material at an easier-to-read level. (SK)

Inferiority is compex

NASA Astrophysics Data System (ADS)

Wade, Jess

2017-07-01

In Inferior: How Science Got Women Wrong and the New Research That's Rewriting the Story, author Angela Saini puts forward the idea that bad science has been used to endorse the cultural prejudice that women are both biologically and psychologically second rate to men.

Learning by Restorying

ERIC Educational Resources Information Center

Slabon, Wayne A.; Richards, Randy L.; Dennen, Vanessa P.

2014-01-01

In this paper, we introduce restorying, a pedagogical approach based on social constructivism that employs successive iterations of rewriting and discussing personal, student-generated, domain-relevant stories to promote conceptual application, critical thinking, and ill-structured problem solving skills. Using a naturalistic, qualitative case…

Discrete bacteria foraging optimization algorithm for graph based problems - a transition from continuous to discrete

NASA Astrophysics Data System (ADS)

Sur, Chiranjib; Shukla, Anupam

2018-03-01

Bacteria Foraging Optimisation Algorithm is a collective behaviour-based meta-heuristics searching depending on the social influence of the bacteria co-agents in the search space of the problem. The algorithm faces tremendous hindrance in terms of its application for discrete problems and graph-based problems due to biased mathematical modelling and dynamic structure of the algorithm. This had been the key factor to revive and introduce the discrete form called Discrete Bacteria Foraging Optimisation (DBFO) Algorithm for discrete problems which exceeds the number of continuous domain problems represented by mathematical and numerical equations in real life. In this work, we have mainly simulated a graph-based road multi-objective optimisation problem and have discussed the prospect of its utilisation in other similar optimisation problems and graph-based problems. The various solution representations that can be handled by this DBFO has also been discussed. The implications and dynamics of the various parameters used in the DBFO are illustrated from the point view of the problems and has been a combination of both exploration and exploitation. The result of DBFO has been compared with Ant Colony Optimisation and Intelligent Water Drops Algorithms. Important features of DBFO are that the bacteria agents do not depend on the local heuristic information but estimates new exploration schemes depending upon the previous experience and covered path analysis. This makes the algorithm better in combination generation for graph-based problems and combination generation for NP hard problems.

Climate Prediction Center - Forecasts & Outlook Maps, Graphs and Tables

Science.gov Websites

moisture, and a forecast for daily ultraviolet (UV) radiation index. Many of the outlook maps have an watches and warnings to protect life and property from acute short-term threats due to severe weather

Scale-free effect of substitution networks

NASA Astrophysics Data System (ADS)

Li, Ziyu; Yu, Zhouyu; Xi, Lifeng

2018-02-01

In this paper, we construct the growing networks in terms of substitution rule. Roughly speaking, we replace edges of different colors with different initial graphs. Then the evolving networks are constructed. We obtained the free-scale effect of our substitution networks.

A supervoxel-based segmentation method for prostate MR images

NASA Astrophysics Data System (ADS)

Tian, Zhiqiang; Liu, LiZhi; Fei, Baowei

2015-03-01

Accurate segmentation of the prostate has many applications in prostate cancer diagnosis and therapy. In this paper, we propose a "Supervoxel" based method for prostate segmentation. The prostate segmentation problem is considered as assigning a label to each supervoxel. An energy function with data and smoothness terms is used to model the labeling process. The data term estimates the likelihood of a supervoxel belongs to the prostate according to a shape feature. The geometric relationship between two neighboring supervoxels is used to construct a smoothness term. A threedimensional (3D) graph cut method is used to minimize the energy function in order to segment the prostate. A 3D level set is then used to get a smooth surface based on the output of the graph cut. The performance of the proposed segmentation algorithm was evaluated with respect to the manual segmentation ground truth. The experimental results on 12 prostate volumes showed that the proposed algorithm yields a mean Dice similarity coefficient of 86.9%+/-3.2%. The segmentation method can be used not only for the prostate but also for other organs.

Loglines. January - February 2012

DTIC Science & Technology

2012-02-01

to that organization’s lineup since 00 , Lee said. Some of those were already used by commercial industry but simply needed to be brought into the...recently began updating and rewriting the Defense Logistics Acquisition Directive, the document that establishes DLA procedures relating to the

Real Audiences and Contexts for LD Writers.

ERIC Educational Resources Information Center

Stires, Susan

1983-01-01

The process/conference model of writing instruction is described for intermediate-level learning disabled students. Students proceed through several stages of writing (rehearsal, drafting, revising, editing, and rewriting) during which they have conferences with the teacher and eventually publish their writing. (CL)

Rewriting History.

ERIC Educational Resources Information Center

Ramirez, Catherine Clark

1994-01-01

Suggests that the telling of vivid stories can help engage elementary students' emotions and increase the chances of fostering an interest in Texas history. Suggests that incorporating elements of the process approach to writing can merge with social studies objectives in creating a curriculum for wisdom. (RS)

The Schizophrenic Brain: Rewriting the Chapter.

ERIC Educational Resources Information Center

Greenberg, Joel

1979-01-01

Evidence of last two decades indicates schizophrenic disorders related to imbalance of brain chemicals. Recent discovery made of association between chronic schizophrenia and variety of structural abnormalities. Included are frontal lobe reversal and accipital lobe reversal. Computer tomography scans and data presented. (SA)

Melonic Phase Transition in Group Field Theory

NASA Astrophysics Data System (ADS)

Baratin, Aristide; Carrozza, Sylvain; Oriti, Daniele; Ryan, James; Smerlak, Matteo

2014-08-01

Group field theories have recently been shown to admit a 1/N expansion dominated by so-called `melonic graphs', dual to triangulated spheres. In this note, we deepen the analysis of this melonic sector. We obtain a combinatorial formula for the melonic amplitudes in terms of a graph polynomial related to a higher-dimensional generalization of the Kirchhoff tree-matrix theorem. Simple bounds on these amplitudes show the existence of a phase transition driven by melonic interaction processes. We restrict our study to the Boulatov-Ooguri models, which describe topological BF theories and are the basis for the construction of 4-dimensional models of quantum gravity.

On understanding nuclear reaction network flows with branchings on directed graphs

NASA Astrophysics Data System (ADS)

Meyer, Bradley S.

2018-04-01

Nuclear reaction network flow diagrams are useful for understanding which reactions are governing the abundance changes at a particular time during nucleosynthesis. This is especially true when the flows are largely unidirectional, such as during the s-process of nucleosynthesis. In explosive nucleosynthesis, when reaction flows are large, and when forward reactions are nearly balanced by their reverses, reaction flows no longer give a clear picture of the abundance evolution in the network. This paper presents a way of understanding network evolution in terms of sums of branchings on a directed graph, which extends the concept of reaction flows to allow for multiple reaction pathways.

OntoFox: web-based support for ontology reuse

PubMed Central

2010-01-01

Background Ontology development is a rapidly growing area of research, especially in the life sciences domain. To promote collaboration and interoperability between different projects, the OBO Foundry principles require that these ontologies be open and non-redundant, avoiding duplication of terms through the re-use of existing resources. As current options to do so present various difficulties, a new approach, MIREOT, allows specifying import of single terms. Initial implementations allow for controlled import of selected annotations and certain classes of related terms. Findings OntoFox http://ontofox.hegroup.org/ is a web-based system that allows users to input terms, fetch selected properties, annotations, and certain classes of related terms from the source ontologies and save the results using the RDF/XML serialization of the Web Ontology Language (OWL). Compared to an initial implementation of MIREOT, OntoFox allows additional and more easily configurable options for selecting and rewriting annotation properties, and for inclusion of all or a computed subset of terms between low and top level terms. Additional methods for including related classes include a SPARQL-based ontology term retrieval algorithm that extracts terms related to a given set of signature terms and an option to extract the hierarchy rooted at a specified ontology term. OntoFox's output can be directly imported into a developer's ontology. OntoFox currently supports term retrieval from a selection of 15 ontologies accessible via SPARQL endpoints and allows users to extend this by specifying additional endpoints. An OntoFox application in the development of the Vaccine Ontology (VO) is demonstrated. Conclusions OntoFox provides a timely publicly available service, providing different options for users to collect terms from external ontologies, making them available for reuse by import into client OWL ontologies. PMID:20569493

Climate Prediction Center - Forecasts & Outlook Maps, Graphs and Tables

Science.gov Websites

moisture, and a forecast for daily ultraviolet (UV) radiation index. Many of the outlook maps have an acute short-term threats due to severe weather events. Another of the many products available is the GFS

Combination of graph heuristics in producing initial solution of curriculum based course timetabling problem

NASA Astrophysics Data System (ADS)

Wahid, Juliana; Hussin, Naimah Mohd

2016-08-01

The construction of population of initial solution is a crucial task in population-based metaheuristic approach for solving curriculum-based university course timetabling problem because it can affect the convergence speed and also the quality of the final solution. This paper presents an exploration on combination of graph heuristics in construction approach in curriculum based course timetabling problem to produce a population of initial solutions. The graph heuristics were set as single and combination of two heuristics. In addition, several ways of assigning courses into room and timeslot are implemented. All settings of heuristics are then tested on the same curriculum based course timetabling problem instances and are compared with each other in terms of number of population produced. The result shows that combination of saturation degree followed by largest degree heuristic produce the highest number of population of initial solutions. The results from this study can be used in the improvement phase of algorithm that uses population of initial solutions.

Information Retrieval and Graph Analysis Approaches for Book Recommendation.

PubMed

Benkoussas, Chahinez; Bellot, Patrice

2015-01-01

A combination of multiple information retrieval approaches is proposed for the purpose of book recommendation. In this paper, book recommendation is based on complex user's query. We used different theoretical retrieval models: probabilistic as InL2 (Divergence from Randomness model) and language model and tested their interpolated combination. Graph analysis algorithms such as PageRank have been successful in Web environments. We consider the application of this algorithm in a new retrieval approach to related document network comprised of social links. We called Directed Graph of Documents (DGD) a network constructed with documents and social information provided from each one of them. Specifically, this work tackles the problem of book recommendation in the context of INEX (Initiative for the Evaluation of XML retrieval) Social Book Search track. A series of reranking experiments demonstrate that combining retrieval models yields significant improvements in terms of standard ranked retrieval metrics. These results extend the applicability of link analysis algorithms to different environments.

Time reversibility from visibility graphs of nonstationary processes

NASA Astrophysics Data System (ADS)

Lacasa, Lucas; Flanagan, Ryan

2015-08-01

Visibility algorithms are a family of methods to map time series into networks, with the aim of describing the structure of time series and their underlying dynamical properties in graph-theoretical terms. Here we explore some properties of both natural and horizontal visibility graphs associated to several nonstationary processes, and we pay particular attention to their capacity to assess time irreversibility. Nonstationary signals are (infinitely) irreversible by definition (independently of whether the process is Markovian or producing entropy at a positive rate), and thus the link between entropy production and time series irreversibility has only been explored in nonequilibrium stationary states. Here we show that the visibility formalism naturally induces a new working definition of time irreversibility, which allows us to quantify several degrees of irreversibility for stationary and nonstationary series, yielding finite values that can be used to efficiently assess the presence of memory and off-equilibrium dynamics in nonstationary processes without the need to differentiate or detrend them. We provide rigorous results complemented by extensive numerical simulations on several classes of stochastic processes.

Information Retrieval and Graph Analysis Approaches for Book Recommendation

PubMed Central

Benkoussas, Chahinez; Bellot, Patrice

2015-01-01

A combination of multiple information retrieval approaches is proposed for the purpose of book recommendation. In this paper, book recommendation is based on complex user's query. We used different theoretical retrieval models: probabilistic as InL2 (Divergence from Randomness model) and language model and tested their interpolated combination. Graph analysis algorithms such as PageRank have been successful in Web environments. We consider the application of this algorithm in a new retrieval approach to related document network comprised of social links. We called Directed Graph of Documents (DGD) a network constructed with documents and social information provided from each one of them. Specifically, this work tackles the problem of book recommendation in the context of INEX (Initiative for the Evaluation of XML retrieval) Social Book Search track. A series of reranking experiments demonstrate that combining retrieval models yields significant improvements in terms of standard ranked retrieval metrics. These results extend the applicability of link analysis algorithms to different environments. PMID:26504899

Robust Joint Graph Sparse Coding for Unsupervised Spectral Feature Selection.

PubMed

Zhu, Xiaofeng; Li, Xuelong; Zhang, Shichao; Ju, Chunhua; Wu, Xindong

2017-06-01

In this paper, we propose a new unsupervised spectral feature selection model by embedding a graph regularizer into the framework of joint sparse regression for preserving the local structures of data. To do this, we first extract the bases of training data by previous dictionary learning methods and, then, map original data into the basis space to generate their new representations, by proposing a novel joint graph sparse coding (JGSC) model. In JGSC, we first formulate its objective function by simultaneously taking subspace learning and joint sparse regression into account, then, design a new optimization solution to solve the resulting objective function, and further prove the convergence of the proposed solution. Furthermore, we extend JGSC to a robust JGSC (RJGSC) via replacing the least square loss function with a robust loss function, for achieving the same goals and also avoiding the impact of outliers. Finally, experimental results on real data sets showed that both JGSC and RJGSC outperformed the state-of-the-art algorithms in terms of k -nearest neighbor classification performance.

Ring system-based chemical graph generation for de novo molecular design

NASA Astrophysics Data System (ADS)

Miyao, Tomoyuki; Kaneko, Hiromasa; Funatsu, Kimito

2016-05-01

Generating chemical graphs in silico by combining building blocks is important and fundamental in virtual combinatorial chemistry. A premise in this area is that generated structures should be irredundant as well as exhaustive. In this study, we develop structure generation algorithms regarding combining ring systems as well as atom fragments. The proposed algorithms consist of three parts. First, chemical structures are generated through a canonical construction path. During structure generation, ring systems can be treated as reduced graphs having fewer vertices than those in the original ones. Second, diversified structures are generated by a simple rule-based generation algorithm. Third, the number of structures to be generated can be estimated with adequate accuracy without actual exhaustive generation. The proposed algorithms were implemented in structure generator Molgilla. As a practical application, Molgilla generated chemical structures mimicking rosiglitazone in terms of a two dimensional pharmacophore pattern. The strength of the algorithms lies in simplicity and flexibility. Therefore, they may be applied to various computer programs regarding structure generation by combining building blocks.

Unapparent Information Revelation: Text Mining for Counterterrorism

NASA Astrophysics Data System (ADS)

Srihari, Rohini K.

Unapparent information revelation (UIR) is a special case of text mining that focuses on detecting possible links between concepts across multiple text documents by generating an evidence trail explaining the connection. A traditional search involving, for example, two or more person names will attempt to find documents mentioning both these individuals. This research focuses on a different interpretation of such a query: what is the best evidence trail across documents that explains a connection between these individuals? For example, all may be good golfers. A generalization of this task involves query terms representing general concepts (e.g. indictment, foreign policy). Previous approaches to this problem have focused on graph mining involving hyperlinked documents, and link analysis exploiting named entities. A new robust framework is presented, based on (i) generating concept chain graphs, a hybrid content representation, (ii) performing graph matching to select candidate subgraphs, and (iii) subsequently using graphical models to validate hypotheses using ranked evidence trails. We adapt the DUC data set for cross-document summarization to evaluate evidence trails generated by this approach

Stream gage descriptions and streamflow statistics for sites in the Tigris River and Euphrates River Basins, Iraq

USGS Publications Warehouse

Saleh, Dina K.

2010-01-01

Statistical summaries of streamflow data for all long-term streamflow-gaging stations in the Tigris River and Euphrates River Basins in Iraq are presented in this report. The summaries for each streamflow-gaging station include (1) a station description, (2) a graph showing annual mean discharge for the period of record, (3) a table of extremes and statistics for monthly and annual mean discharge, (4) a graph showing monthly maximum, minimum, and mean discharge, (5) a table of monthly and annual mean discharges for the period of record, (6) a graph showing annual flow duration, (7) a table of monthly and annual flow duration, (8) a table of high-flow frequency data (maximum mean discharge for 3-, 7-, 15-, and 30-day periods for selected exceedance probabilities), and (9) a table of low-flow frequency data (minimum mean discharge for 3-, 7-, 15-, 30-, 60-, 90-, and 183-day periods for selected non-exceedance probabilities).

Kirchhoff index of linear hexagonal chains

NASA Astrophysics Data System (ADS)

Yang, Yujun; Zhang, Heping

The resistance distance rij between vertices i and j of a connected (molecular) graph G is computed as the effective resistance between nodes i and j in the corresponding network constructed from G by replacing each edge of G with a unit resistor. The Kirchhoff index Kf(G) is the sum of resistance distances between all pairs of vertices. In this work, according to the decomposition theorem of Laplacian polynomial, we obtain that the Laplacian spectrum of linear hexagonal chain Ln consists of the Laplacian spectrum of path P2n+1 and eigenvalues of a symmetric tridiagonal matrix of order 2n + 1. By applying the relationship between roots and coefficients of the characteristic polynomial of the above matrix, explicit closed-form formula for Kirchhoff index of Ln is derived in terms of Laplacian spectrum. To our surprise, the Krichhoff index of Ln is approximately to one half of its Wiener index. Finally, we show that holds for all graphs G in a class of graphs including Ln.0

Efficient path-based computations on pedigree graphs with compact encodings

PubMed Central

2012-01-01

A pedigree is a diagram of family relationships, and it is often used to determine the mode of inheritance (dominant, recessive, etc.) of genetic diseases. Along with rapidly growing knowledge of genetics and accumulation of genealogy information, pedigree data is becoming increasingly important. In large pedigree graphs, path-based methods for efficiently computing genealogical measurements, such as inbreeding and kinship coefficients of individuals, depend on efficient identification and processing of paths. In this paper, we propose a new compact path encoding scheme on large pedigrees, accompanied by an efficient algorithm for identifying paths. We demonstrate the utilization of our proposed method by applying it to the inbreeding coefficient computation. We present time and space complexity analysis, and also manifest the efficiency of our method for evaluating inbreeding coefficients as compared to previous methods by experimental results using pedigree graphs with real and synthetic data. Both theoretical and experimental results demonstrate that our method is more scalable and efficient than previous methods in terms of time and space requirements. PMID:22536898

Spatial Decomposition of Translational Water–Water Correlation Entropy in Binding Pockets

PubMed Central

2015-01-01

A number of computational tools available today compute the thermodynamic properties of water at surfaces and in binding pockets by using inhomogeneous solvation theory (IST) to analyze explicit-solvent simulations. Such methods enable qualitative spatial mappings of both energy and entropy around a solute of interest and can also be applied quantitatively. However, the entropy estimates of existing methods have, to date, been almost entirely limited to the first-order terms in the IST’s entropy expansion. These first-order terms account for localization and orientation of water molecules in the field of the solute but not for the modification of water–water correlations by the solute. Here, we present an extension of the Grid Inhomogeneous Solvation Theory (GIST) approach which accounts for water–water translational correlations. The method involves rewriting the two-point density of water in terms of a conditional density and utilizes the efficient nearest-neighbor entropy estimation approach. Spatial maps of this second order term, for water in and around the synthetic host cucurbit[7]uril and in the binding pocket of the enzyme Factor Xa, reveal mainly negative contributions, indicating solute-induced water–water correlations relative to bulk water; particularly strong signals are obtained for sites at the entrances of cavities or pockets. This second-order term thus enters with the same, negative, sign as the first order translational and orientational terms. Numerical and convergence properties of the methodology are examined. PMID:26636620

"How Do You Spell 'Caught'?"

ERIC Educational Resources Information Center

Broderick, Conne

1995-01-01

Discusses a strategy that provides a structure for students to do what adults do naturally: determine the correct spelling of a word by rewriting it until it looks right. Notes that the technique can be incorporated into the classroom as a regular editing technique. (RS)

76 FR 63640 - Public Housing Assessment System (PHAS): Proposed Physical Condition Interim Scoring Notice

Federal Register 2010, 2011, 2012, 2013, 2014

2011-10-13

... call-for-aid is a system designed to provide elderly residents the opportunity to call for help in the... open. This bars that are change also rewrites designed to open the Level 3 should open. If they...

Stories and Storytelling in Extension Work

ERIC Educational Resources Information Center

Peters, Scott; Franz, Nancy K.

2012-01-01

Deep budget cuts, increased accountability, and the growth of anti-government and anti-intellectual sentiments place Extension systems in a defensive position. In response, we're engaging in organizational change exercises, restructuring, regionalizing, rewriting mission statements, and developing strategic plans. We're spending…

That's a "Wrap."

ERIC Educational Resources Information Center

Gillespie, Patricia

1995-01-01

A secondary teacher in Hawaii's Kamehameha schools describes how she teaches her students about video and television production. Because it is a school for native Hawaiians, the program emphasizes cultural documentation. Through the program, students learn to research, interview, organize video footage, write, rewrite, and use technology. (SM)

Holographic hierarchy in the Gaussian matrix model via the fuzzy sphere

NASA Astrophysics Data System (ADS)

Garner, David; Ramgoolam, Sanjaye

2013-10-01

The Gaussian Hermitian matrix model was recently proposed to have a dual string description with worldsheets mapping to a sphere target space. The correlators were written as sums over holomorphic (Belyi) maps from worldsheets to the two-dimensional sphere, branched over three points. We express the matrix model correlators by using the fuzzy sphere construction of matrix algebras, which can be interpreted as a string field theory description of the Belyi strings. This gives the correlators in terms of trivalent ribbon graphs that represent the couplings of irreducible representations of su(2), which can be evaluated in terms of 3j and 6j symbols. The Gaussian model perturbed by a cubic potential is then recognised as a generating function for Ponzano-Regge partition functions for 3-manifolds having the worldsheet as boundary, and equipped with boundary data determined by the ribbon graphs. This can be viewed as a holographic extension of the Belyi string worldsheets to membrane worldvolumes, forming part of a holographic hierarchy linking, via the large N expansion, the zero-dimensional QFT of the Matrix model to 2D strings and 3D membranes. Note that if, after removing the white vertices, the graph contains a blue edge connecting to the same black vertex at both ends, then the triangulation generated from the black edges will contain faces that resemble cut discs. These faces are triangles with two of the edges identified.

Coupled Harmonic Bases for Longitudinal Characterization of Brain Networks

PubMed Central

Hwang, Seong Jae; Adluru, Nagesh; Collins, Maxwell D.; Ravi, Sathya N.; Bendlin, Barbara B.; Johnson, Sterling C.; Singh, Vikas

2016-01-01

There is a great deal of interest in using large scale brain imaging studies to understand how brain connectivity evolves over time for an individual and how it varies over different levels/quantiles of cognitive function. To do so, one typically performs so-called tractography procedures on diffusion MR brain images and derives measures of brain connectivity expressed as graphs. The nodes correspond to distinct brain regions and the edges encode the strength of the connection. The scientific interest is in characterizing the evolution of these graphs over time or from healthy individuals to diseased. We pose this important question in terms of the Laplacian of the connectivity graphs derived from various longitudinal or disease time points — quantifying its progression is then expressed in terms of coupling the harmonic bases of a full set of Laplacians. We derive a coupled system of generalized eigenvalue problems (and corresponding numerical optimization schemes) whose solution helps characterize the full life cycle of brain connectivity evolution in a given dataset. Finally, we show a set of results on a diffusion MR imaging dataset of middle aged people at risk for Alzheimer’s disease (AD), who are cognitively healthy. In such asymptomatic adults, we find that a framework for characterizing brain connectivity evolution provides the ability to predict cognitive scores for individual subjects, and for estimating the progression of participant’s brain connectivity into the future. PMID:27812274

Entropy, complexity, and Markov diagrams for random walk cancer models

PubMed Central

Newton, Paul K.; Mason, Jeremy; Hurt, Brian; Bethel, Kelly; Bazhenova, Lyudmila; Nieva, Jorge; Kuhn, Peter

2014-01-01

The notion of entropy is used to compare the complexity associated with 12 common cancers based on metastatic tumor distribution autopsy data. We characterize power-law distributions, entropy, and Kullback-Liebler divergence associated with each primary cancer as compared with data for all cancer types aggregated. We then correlate entropy values with other measures of complexity associated with Markov chain dynamical systems models of progression. The Markov transition matrix associated with each cancer is associated with a directed graph model where nodes are anatomical locations where a metastatic tumor could develop, and edge weightings are transition probabilities of progression from site to site. The steady-state distribution corresponds to the autopsy data distribution. Entropy correlates well with the overall complexity of the reduced directed graph structure for each cancer and with a measure of systemic interconnectedness of the graph, called graph conductance. The models suggest that grouping cancers according to their entropy values, with skin, breast, kidney, and lung cancers being prototypical high entropy cancers, stomach, uterine, pancreatic and ovarian being mid-level entropy cancers, and colorectal, cervical, bladder, and prostate cancers being prototypical low entropy cancers, provides a potentially useful framework for viewing metastatic cancer in terms of predictability, complexity, and metastatic potential. PMID:25523357

Applying graph partitioning methods in measurement-based dynamic load balancing

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

Bhatele, Abhinav; Fourestier, Sebastien; Menon, Harshitha

Load imbalance leads to an increasing waste of resources as an application is scaled to more and more processors. Achieving the best parallel efficiency for a program requires optimal load balancing which is a NP-hard problem. However, finding near-optimal solutions to this problem for complex computational science and engineering applications is becoming increasingly important. Charm++, a migratable objects based programming model, provides a measurement-based dynamic load balancing framework. This framework instruments and then migrates over-decomposed objects to balance computational load and communication at runtime. This paper explores the use of graph partitioning algorithms, traditionally used for partitioning physical domains/meshes, formore » measurement-based dynamic load balancing of parallel applications. In particular, we present repartitioning methods developed in a graph partitioning toolbox called SCOTCH that consider the previous mapping to minimize migration costs. We also discuss a new imbalance reduction algorithm for graphs with irregular load distributions. We compare several load balancing algorithms using microbenchmarks on Intrepid and Ranger and evaluate the effect of communication, number of cores and number of objects on the benefit achieved from load balancing. New algorithms developed in SCOTCH lead to better performance compared to the METIS partitioners for several cases, both in terms of the application execution time and fewer number of objects migrated.« less

Two's company, three (or more) is a simplex : Algebraic-topological tools for understanding higher-order structure in neural data.

PubMed

Giusti, Chad; Ghrist, Robert; Bassett, Danielle S

2016-08-01

The language of graph theory, or network science, has proven to be an exceptional tool for addressing myriad problems in neuroscience. Yet, the use of networks is predicated on a critical simplifying assumption: that the quintessential unit of interest in a brain is a dyad - two nodes (neurons or brain regions) connected by an edge. While rarely mentioned, this fundamental assumption inherently limits the types of neural structure and function that graphs can be used to model. Here, we describe a generalization of graphs that overcomes these limitations, thereby offering a broad range of new possibilities in terms of modeling and measuring neural phenomena. Specifically, we explore the use of simplicial complexes: a structure developed in the field of mathematics known as algebraic topology, of increasing applicability to real data due to a rapidly growing computational toolset. We review the underlying mathematical formalism as well as the budding literature applying simplicial complexes to neural data, from electrophysiological recordings in animal models to hemodynamic fluctuations in humans. Based on the exceptional flexibility of the tools and recent ground-breaking insights into neural function, we posit that this framework has the potential to eclipse graph theory in unraveling the fundamental mysteries of cognition.

Graph-based optimization of epitope coverage for vaccine antigen design

DOE PAGES

Theiler, James Patrick; Korber, Bette Tina Marie

2017-01-29

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

Graph-based optimization of epitope coverage for vaccine antigen design

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

Theiler, James Patrick; Korber, Bette Tina Marie

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

The Erdős-Rothschild problem on edge-colourings with forbidden monochromatic cliques

NASA Astrophysics Data System (ADS)

Pikhurko, Oleg; Staden, Katherine; Yilma, Zelealem B.

2017-09-01

Let $\\mathbf{k} := (k_1,\\dots,k_s)$ be a sequence of natural numbers. For a graph $G$, let $F(G;\\mathbf{k})$ denote the number of colourings of the edges of $G$ with colours $1,\\dots,s$ such that, for every $c \\in \\{1,\\dots,s\\}$, the edges of colour $c$ contain no clique of order $k_c$. Write $F(n;\\mathbf{k})$ to denote the maximum of $F(G;\\mathbf{k})$ over all graphs $G$ on $n$ vertices. This problem was first considered by Erd\\H{o}s and Rothschild in 1974, but it has been solved only for a very small number of non-trivial cases. We prove that, for every $\\mathbf{k}$ and $n$, there is a complete multipartite graph $G$ on $n$ vertices with $F(G;\\mathbf{k}) = F(n;\\mathbf{k})$. Also, for every $\\mathbf{k}$ we construct a finite optimisation problem whose maximum is equal to the limit of $\\log_2 F(n;\\mathbf{k})/{n\\choose 2}$ as $n$ tends to infinity. Our final result is a stability theorem for complete multipartite graphs $G$, describing the asymptotic structure of such $G$ with $F(G;\\mathbf{k}) = F(n;\\mathbf{k}) \\cdot 2^{o(n^2)}$ in terms of solutions to the optimisation problem.

Computing element evolution towards Exascale and its impact on legacy simulation codes

NASA Astrophysics Data System (ADS)

Colin de Verdière, Guillaume J. L.

2015-12-01

In the light of the current race towards the Exascale, this article highlights the main features of the forthcoming computing elements that will be at the core of next generations of supercomputers. The market analysis, underlying this work, shows that computers are facing a major evolution in terms of architecture. As a consequence, it is important to understand the impacts of those evolutions on legacy codes or programming methods. The problems of dissipated power and memory access are discussed and will lead to a vision of what should be an exascale system. To survive, programming languages had to respond to the hardware evolutions either by evolving or with the creation of new ones. From the previous elements, we elaborate why vectorization, multithreading, data locality awareness and hybrid programming will be the key to reach the exascale, implying that it is time to start rewriting codes.

Error Budgeting

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

Vinyard, Natalia Sergeevna; Perry, Theodore Sonne; Usov, Igor Olegovich

2017-10-04

We calculate opacity from k (hn)=-ln[T(hv)]/pL, where T(hv) is the transmission for photon energy hv, p is sample density, and L is path length through the sample. The density and path length are measured together by Rutherford backscatter. Δk =more » $$\\partial k$$\\ $$\\partial T$$ ΔT + $$\\partial k$$\\ $$\\partial (pL)$$. We can re-write this in terms of fractional error as Δk/k = Δ1n(T)/T + Δ(pL)/(pL). Transmission itself is calculated from T=(U-E)/(V-E)=B/B0, where B is transmitted backlighter (BL) signal and B 0 is unattenuated backlighter signal. Then ΔT/T=Δln(T)=ΔB/B+ΔB 0/B 0, and consequently Δk/k = 1/T (ΔB/B + ΔB$$_0$$/B$$_0$$ + Δ(pL)/(pL). Transmission is measured in the range of 0.2« less

Quantum properties of supersymmetric theories regularized by higher covariant derivatives

NASA Astrophysics Data System (ADS)

Stepanyantz, Konstantin

2018-02-01

We investigate quantum corrections in \\mathscr{N} = 1 non-Abelian supersymmetric gauge theories, regularized by higher covariant derivatives. In particular, by the help of the Slavnov-Taylor identities we prove that the vertices with two ghost legs and one leg of the quantum gauge superfield are finite in all orders. This non-renormalization theorem is confirmed by an explicit one-loop calculation. By the help of this theorem we rewrite the exact NSVZ β-function in the form of the relation between the β-function and the anomalous dimensions of the matter superfields, of the quantum gauge superfield, and of the Faddeev-Popov ghosts. Such a relation has simple qualitative interpretation and allows suggesting a prescription producing the NSVZ scheme in all loops for the theories regularized by higher derivatives. This prescription is verified by the explicit three-loop calculation for the terms quartic in the Yukawa couplings.

Circuitbot

DTIC Science & Technology

2016-03-01

constraints problem. Game rules described valid moves allowing player to generate a memory graph performing improved C program verification . 15. SUBJECT...TERMS Formal Verification , Static Analysis, Abstract Interpretation, Pointer Analysis, Fixpoint Iteration 16. SECURITY CLASSIFICATION OF: 17...36 3.4.12 Example: Game Play . . . . . . . . . . . . . . . . . . . . . . . . . . . 37 3.4.13 Verification

How to Find a Planetary Hot Spot

NASA Image and Video Library

2010-10-19

This graph of data from NASA Spitzer Space Telescope shows how astronomers located a hot spot on a distant gas planet named upsilon Andromedae b. Termed an exoplanet, it orbits a star beyond our sun, and whips around very closely to its star.

Reading Educational Philosophies in "Freedom Writers"

ERIC Educational Resources Information Center

Choi, Jung-Ah

2009-01-01

The 2007 film "Freedom Writers" portrays the real-life experiences of Erin Gruwell, a teacher at an inner-city high school in Long Beach, California. This article discusses the educational theories underpinning Gruwell's pedagogical practice, as seen in "Freedom Writers", and identifies four themes--rewriting curriculum,…

78 FR 31879 - General Services Administration Acquisition Regulation (GSAR); Electronic Contracting Initiative...

Federal Register 2010, 2011, 2012, 2013, 2014

2013-05-28

...); Electronic Contracting Initiative (ECI) AGENCY: Office of Acquisition Policy, General Services Administration..., Electronic Contracting Initiative, by any of the following methods: Regulations.gov : http://www.regulations... the rewrite of GSAR Part 538, Electronic Contracting Initiative (Modifications). On December 17, 2012...

Revealing, Reinterpreting, Rewriting Mujeres

ERIC Educational Resources Information Center

Preuss, Cara Lynne; Saavedra, Cinthya M.

2014-01-01

This paper reanalyzed research previously conducted with Spanish-speaking childcare providers who participated in an educational literacy program. The women in the program were generally framed as the deficient other--illiterate, immigrant women. The authors used a critical framework and Chicana/Latina feminist methodologies, namely "pláticas…

The Challenges and Rewards of Teaching Spanish in a Community College Prison Program

ERIC Educational Resources Information Center

Palomino, Erick Nava; Ragsdale, Lee

2015-01-01

Two authors describe how teaching Spanish in an Illinois prison led them to rewrite the examples used in a Spanish textbook and engage incarcerated students in novel ways in order to make up for the lack of conventional classroom resources.

Individual Differences in Reprocessing of Text.

ERIC Educational Resources Information Center

Haenggi, Dieter; Perfetti, Charles A.

1992-01-01

Decoding, working memory, and domain-specific prior knowledge were studied as predictors of comprehension for 48 university undergraduate students after rewriting notes, rereading notes, or rereading a text. Working memory was most important for comprehension of text-implicit information, whereas knowledge was relatively more important for…

Novel scenarios of early animal evolution--is it time to rewrite textbooks?

PubMed

Dohrmann, Martin; Wörheide, Gert

2013-09-01

Understanding how important phenotypic, developmental, and genomic features of animals originated and evolved is essential for many fields of biological research, but such understanding depends on robust hypotheses about the phylogenetic interrelationships of the higher taxa to which the studied species belong. Molecular approaches to phylogenetics have proven able to revolutionize our knowledge of organismal evolution. However, with respect to the deepest splits in the metazoan Tree of Life-the relationships between Bilateria and the four non-bilaterian phyla (Porifera, Placozoa, Ctenophora, and Cnidaria)-no consensus has been reached yet, since a number of different, often contradictory, hypotheses with sometimes spectacular implications have been proposed in recent years. Here, we review the recent literature on the topic and contrast it with more classical perceptions based on analyses of morphological characters. We conclude that the time is not yet ripe to rewrite zoological textbooks and advocate a conservative approach when it comes to developing scenarios of the early evolution of animals.

ReWritable Data Storage on DVD by Using Phase Change Technology

NASA Astrophysics Data System (ADS)

Kleine, H.; Martin, F.; Kapeller, M.; Cord, B.; Ebinger, H.

It is expected that the next few years the VHS casette will be replaced by rewritable Digital Versatile Discs (DVD) for home video recording. At this moment three different standards DVD+RW, DVD-RW and DVD-RAM exist, out of which the DVD+RW is expected to dominate the market in Europe and the United States. The disc holds 4.7 GB of computer data, which is equivalent to several hours of high quality video content. At the heart of the disc is a thin film layer stack with a special phase change recording layer. By proper laser irradiation the disc can be overwritten up to 1000 times without noticeable quality loss. A shelf lifetime of 20-50 years is anticipated. With these characteristics the disc is well suited for consumer applications. The present article illuminates how a process engineer can control the disc recording sensitivity, the recording speed and the number of overwriting cycles by the design of the thin film layer stack.

Rewritable three-dimensional holographic data storage via optical forces

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

Yetisen, Ali K., E-mail: ayetisen@mgh.harvard.edu; Harvard-MIT Division of Health Sciences and Technology, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139; Montelongo, Yunuen

2016-08-08

The development of nanostructures that can be reversibly arranged and assembled into 3D patterns may enable optical tunability. However, current dynamic recording materials such as photorefractive polymers cannot be used to store information permanently while also retaining configurability. Here, we describe the synthesis and optimization of a silver nanoparticle doped poly(2-hydroxyethyl methacrylate-co-methacrylic acid) recording medium for reversibly recording 3D holograms. We theoretically and experimentally demonstrate organizing nanoparticles into 3D assemblies in the recording medium using optical forces produced by the gradients of standing waves. The nanoparticles in the recording medium are organized by multiple nanosecond laser pulses to produce reconfigurablemore » slanted multilayer structures. We demonstrate the capability of producing rewritable optical elements such as multilayer Bragg diffraction gratings, 1D photonic crystals, and 3D multiplexed optical gratings. We also show that 3D virtual holograms can be reversibly recorded. This recording strategy may have applications in reconfigurable optical elements, data storage devices, and dynamic holographic displays.« less

Incremental Query Rewriting with Resolution

NASA Astrophysics Data System (ADS)

Riazanov, Alexandre; Aragão, Marcelo A. T.

We address the problem of semantic querying of relational databases (RDB) modulo knowledge bases using very expressive knowledge representation formalisms, such as full first-order logic or its various fragments. We propose to use a resolution-based first-order logic (FOL) reasoner for computing schematic answers to deductive queries, with the subsequent translation of these schematic answers to SQL queries which are evaluated using a conventional relational DBMS. We call our method incremental query rewriting, because an original semantic query is rewritten into a (potentially infinite) series of SQL queries. In this chapter, we outline the main idea of our technique - using abstractions of databases and constrained clauses for deriving schematic answers, and provide completeness and soundness proofs to justify the applicability of this technique to the case of resolution for FOL without equality. The proposed method can be directly used with regular RDBs, including legacy databases. Moreover, we propose it as a potential basis for an efficient Web-scale semantic search technology.

Rewritable ghost floating gates by tunnelling triboelectrification for two-dimensional electronics

PubMed Central

Kim, Seongsu; Kim, Tae Yun; Lee, Kang Hyuck; Kim, Tae-Ho; Cimini, Francesco Arturo; Kim, Sung Kyun; Hinchet, Ronan; Kim, Sang-Woo; Falconi, Christian

2017-01-01

Gates can electrostatically control charges inside two-dimensional materials. However, integrating independent gates typically requires depositing and patterning suitable insulators and conductors. Moreover, after manufacturing, gates are unchangeable. Here we introduce tunnelling triboelectrification for localizing electric charges in very close proximity of two-dimensional materials. As representative materials, we use chemical vapour deposition graphene deposited on a SiO2/Si substrate. The triboelectric charges, generated by friction with a Pt-coated atomic force microscope tip and injected through defects, are trapped at the air–SiO2 interface underneath graphene and act as ghost floating gates. Tunnelling triboelectrification uniquely permits to create, modify and destroy p and n regions at will with the spatial resolution of atomic force microscopes. As a proof of concept, we draw rewritable p/n+ and p/p+ junctions with resolutions as small as 200 nm. Our results open the way to time-variant two-dimensional electronics where conductors, p and n regions can be defined on demand. PMID:28649986

Rewritable ghost floating gates by tunnelling triboelectrification for two-dimensional electronics

NASA Astrophysics Data System (ADS)

Kim, Seongsu; Kim, Tae Yun; Lee, Kang Hyuck; Kim, Tae-Ho; Cimini, Francesco Arturo; Kim, Sung Kyun; Hinchet, Ronan; Kim, Sang-Woo; Falconi, Christian

2017-06-01

Gates can electrostatically control charges inside two-dimensional materials. However, integrating independent gates typically requires depositing and patterning suitable insulators and conductors. Moreover, after manufacturing, gates are unchangeable. Here we introduce tunnelling triboelectrification for localizing electric charges in very close proximity of two-dimensional materials. As representative materials, we use chemical vapour deposition graphene deposited on a SiO2/Si substrate. The triboelectric charges, generated by friction with a Pt-coated atomic force microscope tip and injected through defects, are trapped at the air-SiO2 interface underneath graphene and act as ghost floating gates. Tunnelling triboelectrification uniquely permits to create, modify and destroy p and n regions at will with the spatial resolution of atomic force microscopes. As a proof of concept, we draw rewritable p/n+ and p/p+ junctions with resolutions as small as 200 nm. Our results open the way to time-variant two-dimensional electronics where conductors, p and n regions can be defined on demand.

Enhanced low-rank representation via sparse manifold adaption for semi-supervised learning.

PubMed

Peng, Yong; Lu, Bao-Liang; Wang, Suhang

2015-05-01

Constructing an informative and discriminative graph plays an important role in various pattern recognition tasks such as clustering and classification. Among the existing graph-based learning models, low-rank representation (LRR) is a very competitive one, which has been extensively employed in spectral clustering and semi-supervised learning (SSL). In SSL, the graph is composed of both labeled and unlabeled samples, where the edge weights are calculated based on the LRR coefficients. However, most of existing LRR related approaches fail to consider the geometrical structure of data, which has been shown beneficial for discriminative tasks. In this paper, we propose an enhanced LRR via sparse manifold adaption, termed manifold low-rank representation (MLRR), to learn low-rank data representation. MLRR can explicitly take the data local manifold structure into consideration, which can be identified by the geometric sparsity idea; specifically, the local tangent space of each data point was sought by solving a sparse representation objective. Therefore, the graph to depict the relationship of data points can be built once the manifold information is obtained. We incorporate a regularizer into LRR to make the learned coefficients preserve the geometric constraints revealed in the data space. As a result, MLRR combines both the global information emphasized by low-rank property and the local information emphasized by the identified manifold structure. Extensive experimental results on semi-supervised classification tasks demonstrate that MLRR is an excellent method in comparison with several state-of-the-art graph construction approaches. Copyright © 2015 Elsevier Ltd. All rights reserved.

Nonlinear Dynamics of River Runoff Elucidated by Horizontal Visibility Graphs

NASA Astrophysics Data System (ADS)

Lange, Holger; Rosso, Osvaldo A.

2017-04-01

We investigate a set of long-term river runoff time series at daily resolution from Brazil, monitored by the Agencia Nacional de Aguas. A total of 150 time series was obtained, with an average length of 65 years. Both long-term trends and human influence (water management, e.g. for power production) on the dynamical behaviour are analyzed. We use Horizontal Visibility Graphs (HVGs) to determine the individual temporal networks for the time series, and extract their degree and their distance (shortest path length) distributions. Statistical and information-theoretic properties of these distributions are calculated: robust estimators of skewness and kurtosis, the maximum degree occurring in the time series, the Shannon entropy, permutation complexity and Fisher Information. For the latter, we also compare the information measures obtained from the degree distributions to those using the original time series directly, to investigate the impact of graph construction on the dynamical properties as reflected in these measures. Focus is on one hand on universal properties of the HVG, common to all runoff series, and on site-specific aspects on the other. Results demonstrate that the assumption of power law behaviour for the degree distribtion does not generally hold, and that management has a significant impact on this distribution. We also show that a specific pretreatment of the time series conventional in hydrology, the elimination of seasonality by a separate z-transformation for each calendar day, is highly detrimental to the nonlinear behaviour. It changes long-term correlations and the overall dynamics towards more random behaviour. Analysis based on the transformed data easily leads to spurious results, and bear a high risk of misinterpretation.

WaterWatch - Maps, graphs, and tables of current, recent, and past streamflow conditions

USGS Publications Warehouse

Jian, Xiaodong; Wolock, David; Lins, Harry F.

2008-01-01

WaterWatch (http://water.usgs.gov/waterwatch/) is a U.S. Geological Survey (USGS) World Wide Web site that dis­plays maps, graphs, and tables describing real-time, recent, and past streamflow conditions for the United States. The real-time information generally is updated on an hourly basis. WaterWatch provides streamgage-based maps that show the location of more than 3,000 long-term (30 years or more) USGS streamgages; use colors to represent streamflow conditions compared to historical streamflow; feature a point-and-click interface allowing users to retrieve graphs of stream stage (water elevation) and flow; and highlight locations where extreme hydrologic events, such as floods and droughts, are occurring.The streamgage-based maps show streamflow conditions for real-time, average daily, and 7-day average streamflow. The real-time streamflow maps highlight flood and high flow conditions. The 7-day average streamflow maps highlight below-normal and drought conditions.WaterWatch also provides hydrologic unit code (HUC) maps. HUC-based maps are derived from the streamgage-based maps and illustrate streamflow conditions in hydrologic regions. These maps show average streamflow conditions for 1-, 7-, 14-, and 28-day periods, and for monthly average streamflow; highlight regions of low flow or hydrologic drought; and provide historical runoff and streamflow conditions beginning in 1901.WaterWatch summarizes streamflow conditions in a region (state or hydrologic unit) in terms of the long-term typical condition at streamgages in the region. Summary tables are provided along with time-series plots that depict variations through time. WaterWatch also includes tables of current streamflow information and locations of flooding.

Alterations in Anatomical Covariance in the Prematurely Born

PubMed Central

Scheinost, Dustin; Kwon, Soo Hyun; Lacadie, Cheryl; Vohr, Betty R.; Schneider, Karen C.; Papademetris, Xenophon; Constable, R. Todd; Ment, Laura R.

2017-01-01

Abstract Preterm (PT) birth results in long-term alterations in functional and structural connectivity, but the related changes in anatomical covariance are just beginning to be explored. To test the hypothesis that PT birth alters patterns of anatomical covariance, we investigated brain volumes of 25 PTs and 22 terms at young adulthood using magnetic resonance imaging. Using regional volumetrics, seed-based analyses, and whole brain graphs, we show that PT birth is associated with reduced volume in bilateral temporal and inferior frontal lobes, left caudate, left fusiform, and posterior cingulate for prematurely born subjects at young adulthood. Seed-based analyses demonstrate altered patterns of anatomical covariance for PTs compared with terms. PTs exhibit reduced covariance with R Brodmann area (BA) 47, Broca's area, and L BA 21, Wernicke's area, and white matter volume in the left prefrontal lobe, but increased covariance with R BA 47 and left cerebellum. Graph theory analyses demonstrate that measures of network complexity are significantly less robust in PTs compared with term controls. Volumes in regions showing group differences are significantly correlated with phonological awareness, the fundamental basis for reading acquisition, for the PTs. These data suggest both long-lasting and clinically significant alterations in the covariance in the PTs at young adulthood. PMID:26494796

Short-Term Repeatability of Noninvasive Aortic Pulse Wave Velocity Assessment: Comparison Between Methods and Devices.

PubMed

Grillo, Andrea; Parati, Gianfranco; Rovina, Matteo; Moretti, Francesco; Salvi, Lucia; Gao, Lan; Baldi, Corrado; Sorropago, Giovanni; Faini, Andrea; Millasseau, Sandrine C; Scalise, Filippo; Carretta, Renzo; Salvi, Paolo

2017-12-08

Aortic pulse wave velocity (PWV) is an indirect index of arterial stiffness and an independent cardiovascular risk factor. Consistency of PWV assessment over time is thus an essential feature for its clinical application. However, studies providing a comparative estimate of the reproducibility of PWV across different noninvasive devices are lacking, especially in the elderly and in individuals at high cardiovascular risk. Aimed at filling this gap, short-term repeatability of PWV, estimated with 6 different devices (Complior Analyse, PulsePen-ETT, PulsePen-ET, SphygmoCor Px/Vx, BPLab, and Mobil-O-Graph), was evaluated in 102 high cardiovascular risk patients hospitalized for suspected coronary artery disease (72 males, 65 ± 13 years). PWV was measured in a single session twice, at 15-minute interval, and its reproducibility was assessed though coefficient of variation (CV), coefficient of repeatability, and intraclass correlation coefficient. The CV of PWV, measured with any of these devices, was <10%. Repeatability was higher with cuff-based methods (BPLab: CV = 5.5% and Mobil-O-Graph: CV = 3.4%) than with devices measuring carotid-femoral PWV (Complior: CV = 8.2%; PulsePen-TT: CV = 8.0%; PulsePen-ETT: CV = 5.8%; and SphygmoCor: CV = 9.5%). In the latter group, PWV repeatability was lower in subjects with higher carotid-femoral PWV. The differences in PWV between repeated measurements, except for the Mobil-O-Graph, did not depend on short-term variations of mean blood pressure or heart rate. Our study shows that the short-term repeatability of PWV measures is good but not homogenous across different devices and at different PWV values. These findings, obtained in patients at high cardiovascular risk, may be relevant when evaluating the prognostic importance of PWV. © American Journal of Hypertension, Ltd 2017. All rights reserved. For Permissions, please email: journals.permissions@oup.com

View-Based Organization and Interplay of Spatial Working and Long-Term Memories

PubMed Central

Röhrich, Wolfgang G.; Hardiess, Gregor; Mallot, Hanspeter A.

2014-01-01

Space perception provides egocentric, oriented views of the environment from which working and long-term memories are constructed. “Allocentric” (i.e. position-independent) long-term memories may be organized as graphs of recognized places or views but the interaction of such cognitive graphs with egocentric working memories is unclear. Here we present a simple coherent model of view-based working and long-term memories, together with supporting evidence from behavioral experiments. The model predicts that within a given place, memories for some views may be more salient than others, that imagery of a target square should depend on the location where the recall takes place, and that recall favors views of the target square that would be obtained when approaching it from the current recall location. In two separate experiments in an outdoor urban environment, pedestrians were approached at various interview locations and asked to draw sketch maps of one of two well-known squares. Orientations of the sketch map productions depended significantly on distance and direction of the interview location from the target square, i.e. different views were recalled at different locations. Further analysis showed that location-dependent recall is related to the respective approach direction when imagining a walk from the interview location to the target square. The results are consistent with a view-based model of spatial long-term and working memories and their interplay. PMID:25409437

Software to Control and Monitor Gas Streams

NASA Technical Reports Server (NTRS)

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

2012-01-01

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

An evaluation of the directed flow graph methodology

NASA Technical Reports Server (NTRS)

Snyder, W. E.; Rajala, S. A.

1984-01-01

The applicability of the Directed Graph Methodology (DGM) to the design and analysis of special purpose image and signal processing hardware was evaluated. A special purpose image processing system was designed and described using DGM. The design, suitable for very large scale integration (VLSI) implements a region labeling technique. Two computer chips were designed, both using metal-nitride-oxide-silicon (MNOS) technology, as well as a functional system utilizing those chips to perform real time region labeling. The system is described in terms of DGM primitives. As it is currently implemented, DGM is inappropriate for describing synchronous, tightly coupled, special purpose systems. The nature of the DGM formalism lends itself more readily to modeling networks of general purpose processors.

Liver vessels segmentation using a hybrid geometrical moments/graph cuts method

PubMed Central

Esneault, Simon; Lafon, Cyril; Dillenseger, Jean-Louis

2010-01-01

This paper describes a fast and fully-automatic method for liver vessel segmentation on CT scan pre-operative images. The basis of this method is the introduction of a 3-D geometrical moment-based detector of cylindrical shapes within the min-cut/max-flow energy minimization framework. This method represents an original way to introduce a data term as a constraint into the widely used Boykov’s graph cuts algorithm and hence, to automate the segmentation. The method is evaluated and compared with others on a synthetic dataset. Finally, the relevancy of our method regarding the planning of a -necessarily accurate- percutaneous high intensity focused ultrasound surgical operation is demonstrated with some examples. PMID:19783500

Michigan Judge Strikes Down Controversial University Policy on Racial Harassment.

ERIC Educational Resources Information Center

Black Issues in Higher Education, 1989

1989-01-01

A University of Michigan policy barred harassment or discrimination based on race, ethnicity, religion, sex, sexual orientation, creed, national origin, ancestry, age, marital status, handicapped, or Vietnam-veteran status. It was declared unconstitutional because it violated First Amendment rights. University officials may rewrite policy or…

Teaching about the French Revolution--A Play.

ERIC Educational Resources Information Center

Pezone, Michael

2002-01-01

Presents a play about the French Revolution, discussing how the play was used within a global history course. States that students read the play, work in groups to rewrite the play, and perform their version of the play. Includes key questions that are asked of the students. (CMK)

Rewriting the Journal

ERIC Educational Resources Information Center

Fredette, Michelle

2012-01-01

With faculty balking at the price of academic journals, can other digital publishing options get traction? University libraries are no strangers to one of the most popular online alternatives, the open-access archive. These archives enable scholars to upload work--including drafts of articles that are published later in subscription journals--so…

Upgrade of U.S. EPA's Experimental Stream Facility Supervisory Control and Data Acquisition System

EPA Science Inventory

The Supervisory control and data acquisition (SCADA) system for the U.S. EPA’s Experimental Stream Facility (ESF) was upgraded using Camile hardware and software in 2015. The upgrade added additional hardwired connections, new wireless capabilities, and included a complete rewrit...

Development of an Executive Level Stock Fund Handbook

DTIC Science & Technology

1990-09-01

graphics assistance, thorough proof-reading of countless rewrites, and prayer support. I want to thank Heike, my wife to be, for her tremendous patience...Usability........................... 46 Format Design ....................... 50 III. Methodology.................................... 52 Overall...54 Panel of Experts ....................57 Interview Instrument ................57 Handbook Format Design ............. 58 Handbook Usability

Ottawa County Writing Process Model for PPO Assessments.

ERIC Educational Resources Information Center

Ottawa County Office of Education, OH.

This guide outlines the writing procedures for English Composition Pupil Performance Objective (PPO) assessments and tests. Procedures for both students and teachers are included for the prewriting, first draft writing, and revising/rewriting sessions. A brief guide to evaluation procedures and intervention strategies is also provided. (MM)

Do It Now!

ERIC Educational Resources Information Center

Conners, Keith J.

1995-01-01

One college teacher's approach to the problem of student procrastination in research paper writing has been to implement a liberal policy concerning deadlines that includes incentives for early submission of work, such as more extensive feedback and options for rewriting. The policy has had modest success and is appreciated by students for…

Teaching Integer Operations Using Ring Theory

ERIC Educational Resources Information Center

Hirsch, Jenna

2012-01-01

A facility with signed numbers forms the basis for effective problem solving throughout developmental mathematics. Most developmental mathematics textbooks explain signed number operations using absolute value, a method that involves considering the problem in several cases (same sign, opposite sign), and in the case of subtraction, rewriting the…

Couple Graph Based Label Propagation Method for Hyperspectral Remote Sensing Data Classification

NASA Astrophysics Data System (ADS)

Wang, X. P.; Hu, Y.; Chen, J.

2018-04-01

Graph based semi-supervised classification method are widely used for hyperspectral image classification. We present a couple graph based label propagation method, which contains both the adjacency graph and the similar graph. We propose to construct the similar graph by using the similar probability, which utilize the label similarity among examples probably. The adjacency graph was utilized by a common manifold learning method, which has effective improve the classification accuracy of hyperspectral data. The experiments indicate that the couple graph Laplacian which unite both the adjacency graph and the similar graph, produce superior classification results than other manifold Learning based graph Laplacian and Sparse representation based graph Laplacian in label propagation framework.

Multi-Centrality Graph Spectral Decompositions and Their Application to Cyber Intrusion Detection

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

Chen, Pin-Yu; Choudhury, Sutanay; Hero, Alfred

Many modern datasets can be represented as graphs and hence spectral decompositions such as graph principal component analysis (PCA) can be useful. Distinct from previous graph decomposition approaches based on subspace projection of a single topological feature, e.g., the centered graph adjacency matrix (graph Laplacian), we propose spectral decomposition approaches to graph PCA and graph dictionary learning that integrate multiple features, including graph walk statistics, centrality measures and graph distances to reference nodes. In this paper we propose a new PCA method for single graph analysis, called multi-centrality graph PCA (MC-GPCA), and a new dictionary learning method for ensembles ofmore » graphs, called multi-centrality graph dictionary learning (MC-GDL), both based on spectral decomposition of multi-centrality matrices. As an application to cyber intrusion detection, MC-GPCA can be an effective indicator of anomalous connectivity pattern and MC-GDL can provide discriminative basis for attack classification.« less

Graphs, matrices, and the GraphBLAS: Seven good reasons

DOE PAGES

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

2015-01-01

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

Adjusting protein graphs based on graph entropy.

PubMed

Peng, Sheng-Lung; Tsay, Yu-Wei

2014-01-01

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

Adjusting protein graphs based on graph entropy

PubMed Central

2014-01-01

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

Intrinsic information carriers in combinatorial dynamical systems

NASA Astrophysics Data System (ADS)

Harmer, Russ; Danos, Vincent; Feret, Jérôme; Krivine, Jean; Fontana, Walter

2010-09-01

Many proteins are composed of structural and chemical features—"sites" for short—characterized by definite interaction capabilities, such as noncovalent binding or covalent modification of other proteins. This modularity allows for varying degrees of independence, as the behavior of a site might be controlled by the state of some but not all sites of the ambient protein. Independence quickly generates a startling combinatorial complexity that shapes most biological networks, such as mammalian signaling systems, and effectively prevents their study in terms of kinetic equations—unless the complexity is radically trimmed. Yet, if combinatorial complexity is key to the system's behavior, eliminating it will prevent, not facilitate, understanding. A more adequate representation of a combinatorial system is provided by a graph-based framework of rewrite rules where each rule specifies only the information that an interaction mechanism depends on. Unlike reactions, which deal with molecular species, rules deal with patterns, i.e., multisets of molecular species. Although the stochastic dynamics induced by a collection of rules on a mixture of molecules can be simulated, it appears useful to capture the system's average or deterministic behavior by means of differential equations. However, expansion of the rules into kinetic equations at the level of molecular species is not only impractical, but conceptually indefensible. If rules describe bona fide patterns of interaction, molecular species are unlikely to constitute appropriate units of dynamics. Rather, we must seek aggregate variables reflective of the causal structure laid down by the rules. We call these variables "fragments" and the process of identifying them "fragmentation." Ideally, fragments are aspects of the system's microscopic population that the set of rules can actually distinguish on average; in practice, it may only be feasible to identify an approximation to this. Most importantly, fragments are self-consistent descriptors of system dynamics in that their time-evolution is governed by a closed system of kinetic equations. Taken together, fragments are endogenous distinctions that matter for the dynamics of a system, which warrants viewing them as the carriers of information. Although fragments can be thought of as multisets of molecular species (an extensional view), their self-consistency suggests treating them as autonomous aspects cut off from their microscopic realization (an intensional view). Fragmentation is a seeded process that depends on the choice of observables whose dynamics one insists to describe. Different observables can cause distinct fragmentations, in effect altering the set of information carriers that govern the behavior of a system, even though nothing has changed in its microscopic constitution. In this contribution, we present a mathematical specification of fragments, but not an algorithmic implementation. We have described the latter elsewhere in rather technical terms that, although effective, were lacking an embedding into a more general conceptual framework, which we here provide.

Intrinsic information carriers in combinatorial dynamical systems.

PubMed

Harmer, Russ; Danos, Vincent; Feret, Jérôme; Krivine, Jean; Fontana, Walter

2010-09-01

Many proteins are composed of structural and chemical features--"sites" for short--characterized by definite interaction capabilities, such as noncovalent binding or covalent modification of other proteins. This modularity allows for varying degrees of independence, as the behavior of a site might be controlled by the state of some but not all sites of the ambient protein. Independence quickly generates a startling combinatorial complexity that shapes most biological networks, such as mammalian signaling systems, and effectively prevents their study in terms of kinetic equations-unless the complexity is radically trimmed. Yet, if combinatorial complexity is key to the system's behavior, eliminating it will prevent, not facilitate, understanding. A more adequate representation of a combinatorial system is provided by a graph-based framework of rewrite rules where each rule specifies only the information that an interaction mechanism depends on. Unlike reactions, which deal with molecular species, rules deal with patterns, i.e., multisets of molecular species. Although the stochastic dynamics induced by a collection of rules on a mixture of molecules can be simulated, it appears useful to capture the system's average or deterministic behavior by means of differential equations. However, expansion of the rules into kinetic equations at the level of molecular species is not only impractical, but conceptually indefensible. If rules describe bona fide patterns of interaction, molecular species are unlikely to constitute appropriate units of dynamics. Rather, we must seek aggregate variables reflective of the causal structure laid down by the rules. We call these variables "fragments" and the process of identifying them "fragmentation." Ideally, fragments are aspects of the system's microscopic population that the set of rules can actually distinguish on average; in practice, it may only be feasible to identify an approximation to this. Most importantly, fragments are self-consistent descriptors of system dynamics in that their time-evolution is governed by a closed system of kinetic equations. Taken together, fragments are endogenous distinctions that matter for the dynamics of a system, which warrants viewing them as the carriers of information. Although fragments can be thought of as multisets of molecular species (an extensional view), their self-consistency suggests treating them as autonomous aspects cut off from their microscopic realization (an intensional view). Fragmentation is a seeded process that depends on the choice of observables whose dynamics one insists to describe. Different observables can cause distinct fragmentations, in effect altering the set of information carriers that govern the behavior of a system, even though nothing has changed in its microscopic constitution. In this contribution, we present a mathematical specification of fragments, but not an algorithmic implementation. We have described the latter elsewhere in rather technical terms that, although effective, were lacking an embedding into a more general conceptual framework, which we here provide.

Rewriting Professional Development: Professional Learning Communities in an Urban Charter School

ERIC Educational Resources Information Center

Glasheen, Gregory J.

2017-01-01

This study challenges traditional professional development models, in which teachers are positioned as receptacles for knowledge and "best practices". This type of professional development devalues the local knowledge teachers possess, their theories of practice (Lytle & Cochran-Smith, 1994), and their ability to reflect on their…

Trident Warrior Buoy Testing

DTIC Science & Technology

2013-09-30

the data to track swell events, accurately model swell refraction, and use the data to drive surf -forecasting and other nearshore models (e.g...Temperature (SST). • Addition of a 8GB Micro-SD card for on board time series storage (can be unpopulated or disabled ). • A complete rewrite of the

Faculty Mothers

ERIC Educational Resources Information Center

Stockdell-Giesler, Anne; Ingalls, Rebecca

2007-01-01

This essay argues that it is time to rewrite the rhetoric of motherhood in higher education, and use American Association of University Professors (AAUP ) recommendations to help. The authors observe that although the AAUP and other groups have urged colleges and universities to strike a work-life balance, academic culture is slow to change, and…

Defense.gov - Special Report: Veterans Employment

Science.gov Websites

. Veterans' employment case manager Angela Eberle helped Rivera rewrite his resume and translated his Obama launched the Veterans Employment Center, the first online one-stop shopping tool for veterans Jobs Troops, Vets Want 'Fair Shot' at Employment, Battaglia Says First Lady Asks Governors to Aid

Pandora’s Box: Lethally-Armed Ground Robots in Operations in Iraq and Afghanistan

DTIC Science & Technology

2010-10-27

Others debate whether Isaac Asimov ‟s famous Three Laws of Robotics (featured in his book I, Robot and the movie of the same name) could be applied in...http://www.tgdaily.com/hardware-features/43441-engineers-rewrite- asimovs -three- laws (accessed 7 September 2010).

Apologizing in Italian and English.

ERIC Educational Resources Information Center

Lipson, Maxine

1994-01-01

Compared apology exchanges in Italy and the United States by having 10 Italian university students view American situation comedy television programs and rewrite particular conflict and apology exchanges in an Italian context. The status and role of the programs' participants affected the Italian students' choice of apology strategies more so than…

Rewriting Writing in Higher Education: The Contested Spaces of Proofreading

ERIC Educational Resources Information Center

Turner, Joan

2011-01-01

This article reports on a research project on proofreading, prompted by its proliferation in contemporary higher education. The article is framed by an academic literacies perspective and develops the concept of "writtenness", which draws attention to both the underlying culturally and socially constructed values relating to the…

The Body Disciplined: Rewriting Teaching Competence and the Doctrine of Reflection

ERIC Educational Resources Information Center

Erlandson, Peter

2005-01-01

Shortly after the publication of "The Reflective Practitioner" (1983) and the sequel "Educating the Reflective Practitioner" (1987) "reflection-in-action" became a major concept in teacher education. The concept has, however, been criticised on ontological/epistemological as well as practice oriented accounts (Van Manen, 1995; Newman, 1999;…

Digitizing Craft: Creative Writing Studies and New Media--A Proposal

ERIC Educational Resources Information Center

Koehler, Adam

2013-01-01

This article identifies and examines a digital arm of creative writing studies and organizes that proposal into four categories through which to theorize the "craft" of creative production, each borrowed from Tim Mayers's "(Re)Writing Craft: Composition, Creative Writing, and the Future of English Studies": process, genre, author, and…

Life without Scan-Tron: Tests as Thinking.

ERIC Educational Resources Information Center

Posner, Richard

1987-01-01

Claims that written tests are superior to objective, scan-tron tests in literature, composition, and vocabulary because they require students to think on paper. Describes the following types of in-class written tests and examines the advantages of each: literary essay, topical composition, imitation, brief answer, timed rewrites, and vocabulary…

Guidelines for Writing (or Rewriting) Manuals for Instructional Software.

ERIC Educational Resources Information Center

Litchfield, Brenda C.

1990-01-01

Discusses the need for adequate student user manuals for computer software and presents guidelines to help teachers develop these manuals. The sections that a student manual should contain are outlined, including objectives, pretests and posttests for self-evaluation, and worksheets; and examples are given for further clarification. (LRW)

The Outlook for Computer Professions: 1985 Rewrites the Program.

ERIC Educational Resources Information Center

Drake, Larry

1986-01-01

The author states that graduates of junior college programs who learn COBOL will continue to find jobs, but employers will increasingly seek college graduates when filling positions for computer programers and systems analysts. Areas of growth for computer applications (services, military, data communications, and artificial intelligence) are…

On Grandmother Neurons and Grandfather Clocks

ERIC Educational Resources Information Center

Perkins, David

2009-01-01

What does contemporary neuroscience offer educational practice? The promise seems immense, as we come to understand better how the brain learns. However, critics caution that only a few concrete implications for practice have emerged, nowhere near a rewrite of the craft of teaching and learning. How then can we understand better the relationship…

The Emergence of the American University: An International Perspective

ERIC Educational Resources Information Center

Nelson, Adam R.

2005-01-01

In 1979, fourteen years after publishing his landmark work, "The Emergence of the American University," Laurence R. Veysey wrote a forward-looking article for the "American Quarterly" titled "The Autonomy of American History Reconsidered." In his article, Veysey suggested that the time had come to rewrite American…

Conversion of PCDP Dialogs.

ERIC Educational Resources Information Center

Bork, Alfred M.

An introduction to the problems involved in conversion of computer dialogues from one computer language to another is presented. Conversion of individual dialogues by complete rewriting is straightforward, if tedious. To make a general conversion of a large group of heterogeneous dialogue material from one language to another at one step is more…

Into Print: A Practical Guide to Writing, Illustrating, and Publishing.

ERIC Educational Resources Information Center

Hill, Mary; Cochran, Wendell

Designed for writers of nonfiction, this publication provides practical suggestions for writing books and getting them published. The 25 chapters discuss the following topics: planning for book publication, keeping track of money and facts, getting started writing, rewriting, writing reviews of other books, typing and labeling the manuscript,…

Nontraditional Forms of Assessment

ERIC Educational Resources Information Center

O'Neal, Brooke

2015-01-01

The author discusses the benefits of nontraditional assessments and shares how she has used them in her 5th-grade classroom in rural South Carolina. The examples include doing a Gallery Walk, writing poetry, integrating the arts into other subjects, having students reenact historical scenes, using social media, and rewriting popular songs with…

Rewriting Dominant Narratives of the Academy: Women Faculty of Color and Identity Management

ERIC Educational Resources Information Center

Motha, Suhanthie; Varghese, Manka M.

2018-01-01

Drawing on Delgado and Yosso's "counterstory," Yosso's "community cultural wealth," and Alsup's "borderland discourses," the authors, who are women of color academics, use narratives from their lives to discuss the ways in which they draw on resources in managing and reconfiguring their multiple identities within the…

An Approach to Revision and Evaluation of Student Writing.

ERIC Educational Resources Information Center

Duke, Charles R.

An approach to evaluating student writing that emphasizes reformulation and deemphasizes grades teaches students that reworking their writing is a necessary and acceptable part of the writing process. Reformulation is divided into rewriting, revising, and editing. The instructor diagnoses student papers to determine significant problems on a…

The BASIC Instructional Program: Conversion into MAINSAIL Language.

ERIC Educational Resources Information Center

Dageforde, Mary L.

This report summarizes the rewriting of the BASIC Instructional Program (BIP) (a "hands-on laboratory" that teaches elementary programming in the BASIC language) from SAIL (a programming language available only on PDP-10 computers) into MAINSAIL (a language designed for portability on a broad class of computers). Four sections contain…

75 FR 48873 - Acquisition Regulation Rewrite

Federal Register 2010, 2011, 2012, 2013, 2014

2010-08-12

... Acquisition Regulation (DIAR). This action revises the DIAR, 48 CFR chapter 14, but does not impose any new..., 2010. No public comments were received. DOI has concluded that the interim rule should be adopted as a... DEPARTMENT OF THE INTERIOR Office of the Secretary 48 CFR Chapter 14 RIN 1093-AA11 Acquisition...

76 FR 54510 - Notice of Availability of Proposed Models for Plant-Specific Adoption of Technical Specifications...

Federal Register 2010, 2011, 2012, 2013, 2014

2011-09-01

... Models for Plant-Specific Adoption of Technical Specifications Task Force Traveler TSTF-500, Revision 2... Specifications Task Force (TSTF) Traveler TSTF- 500, Revision 2, ``DC Electrical Rewrite--Update to TSTF-360....8.6, ``Battery Cell Parameters.'' Additionally, a new Administrative Controls program, titled...

Optical Disc Technology for Information Management.

ERIC Educational Resources Information Center

Brumm, Eugenia K.

1991-01-01

This summary of the literature on document image processing from 1988-90 focuses on WORM (write once read many) technology and on rewritable (i.e., erasable) optical discs, and excludes CD-ROM. Highlights include vendors and products, standards, comparisons of storage media, software, legal issues, records management, indexing, and computer…

Rewriting the Vietnam Narrative: Strategic Partnership Opportunities in Southeast Asia

DTIC Science & Technology

2013-03-01

American foot soldiers. Fighting continued against the Cambodians, Mongols and even the Chinese again as they all invaded and were eventually...occupied it until the defeat of the Japanese Empire by the Allies in 1945 and the French re-occupied their former colonies. The French fought

How New Zealand Consumers Respond to Plain English.

ERIC Educational Resources Information Center

Campbell, Nittaya

1999-01-01

Considers how New Zealand has seen a need for providing readily understandable business and government documents. Reports a psycholinguistic study testing the level of consumer comprehension of bank contracts, and the effect of using plain English to rewrite them. Finds that the most effective means of enhancing comprehension was that which…

Resurrection Symphony: "El Sistema" as Ideology in Venezuela and Los Angeles

ERIC Educational Resources Information Center

Fink, Robert

2016-01-01

The explosive growth of Venezuela's "El Sistema" is rewriting the agenda of musical education in the West. Many commentators from the world of classical music react to the spectacle of dedicated young colonial musicians playing European masterworks as a kind of "miracle," accepting "Sistema" founder José Antonio…

Ancient DNA and the rewriting of human history: be sparing with Occam's razor.

PubMed

Haber, Marc; Mezzavilla, Massimo; Xue, Yali; Tyler-Smith, Chris

2016-01-11

Ancient DNA research is revealing a human history far more complex than that inferred from parsimonious models based on modern DNA. Here, we review some of the key events in the peopling of the world in the light of the findings of work on ancient DNA.

The Many Faces of Censorship.

ERIC Educational Resources Information Center

Peck, Richard

1999-01-01

An author of 26 books for young adults writes about different forms of censorship including rewriting history textbooks and parents who censor themselves by not staying in touch with their children. Citing Cormier's "The Chocolate War" and Golding's "Lord of the Flies" and making reference to the Colulmbine school murders, he illustrates the…

Encouraging Civic Engagement through Extended Community Writing Projects: Rewriting the Curriculum

ERIC Educational Resources Information Center

Simmons, Michele

2010-01-01

Developing community writing projects that effectively benefit students, the community, and the goals of the writing program is a tricky task. Drawing from recent scholarship and the author's own challenges with integrating meaningful civic engagement into the professional writing classes at her university, she examines limitations of single…

When Bad Things Happen to Good Superintendents: What Comes between Well-Meaning School Boards and Their Superintendents?

ERIC Educational Resources Information Center

Marlowe, John

2001-01-01

Major causes of "sudden-death syndrome" for superintendents include mismatched priorities, unseen problems, interference from special-interest groups, and misdirected disagreements. Beleaguered superintendents should be positive and proactive, act and speak as one person, understand agreements, seek help, listen, rewrite personnel…

75 FR 19827 - Acquisition Regulation Rewrite

Federal Register 2010, 2011, 2012, 2013, 2014

2010-04-15

... of the Secretary, telephone (202) 513-0747, fax (202) 219-4244, or e-mail [email protected]ios... rule we did not conduct or use a study, experiment, or survey requiring peer review under the Data... endorsement of a product, service or position which the contractor represents. 1403.570-2 Procedures. If a...

Social Studies Research Papers: A Writing Process Approach.

ERIC Educational Resources Information Center

Gilstrap, Robert L.

1987-01-01

Describes a writing process approach to research papers which involves four steps: prewriting, composing, rewriting, and sharing. Illustrates the process using an intermediate grade level example but states that the process is appropriate at higher levels. Stresses that this approach is important because it integrates writing skills with social…

Rewriting evolution--"been there, done that".

PubMed

Penny, David

2013-01-01

A recent paper by a science journalist in Nature shows major errors in understanding phylogenies, in this case of placental mammals. The underlying unrooted tree is probably correct, but the placement of the root just reflects a well-known error from the acceleration in the rate of evolution among some myomorph rodents.

12 CFR 1235.4 - Minimum requirements of a record retention program.

Code of Federal Regulations, 2014 CFR

2014-01-01

... appropriate to support administrative, business, external and internal audit functions, and litigation of the... for appropriate back-up and recovery of electronic records to ensure the same accuracy as the primary... records, preferably searchable, must be maintained on immutable, non-rewritable storage in a manner that...

12 CFR 1235.4 - Minimum requirements of a record retention program.

Code of Federal Regulations, 2012 CFR

2012-01-01

... appropriate to support administrative, business, external and internal audit functions, and litigation of the... for appropriate back-up and recovery of electronic records to ensure the same accuracy as the primary... records, preferably searchable, must be maintained on immutable, non-rewritable storage in a manner that...

12 CFR 1235.4 - Minimum requirements of a record retention program.

Code of Federal Regulations, 2013 CFR

2013-01-01

... appropriate to support administrative, business, external and internal audit functions, and litigation of the... for appropriate back-up and recovery of electronic records to ensure the same accuracy as the primary... records, preferably searchable, must be maintained on immutable, non-rewritable storage in a manner that...

Being There: (Re)Making the Assessment Scene

ERIC Educational Resources Information Center

Gallagher, Chris W.

2011-01-01

I use Burkean analysis to show how neoliberalism undermines faculty assessment expertise and underwrites testing industry expertise in the current assessment scene. Contending that we cannot extricate ourselves from our limited agency in this scene until we abandon the familiar "stakeholder" theory of power, I propose a rewriting of the…

77 FR 59790 - General Services Administration Acquisition Regulation (GSAR); Rewrite of Part 504...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-10-01

....'' GSAR Subpart 504.11, Central Contractor Registration (CCR) and GSAR 504.1103, Procedures, to add the... Sec. 504.1103 Procedures. Subpart 504.11--Central Contractor Registration 504.1103 Procedures. In addition to the requirements found in FAR 4.1103, prior to awarding a contractual instrument the...

Characterizing Containment and Related Classes of Graphs,

DTIC Science & Technology

1985-01-01

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

Fully-automated approach to hippocampus segmentation using a graph-cuts algorithm combined with atlas-based segmentation and morphological opening.

PubMed

Kwak, Kichang; Yoon, Uicheul; Lee, Dong-Kyun; Kim, Geon Ha; Seo, Sang Won; Na, Duk L; Shim, Hack-Joon; Lee, Jong-Min

2013-09-01

The hippocampus has been known to be an important structure as a biomarker for Alzheimer's disease (AD) and other neurological and psychiatric diseases. However, it requires accurate, robust and reproducible delineation of hippocampal structures. In this study, an automated hippocampal segmentation method based on a graph-cuts algorithm combined with atlas-based segmentation and morphological opening was proposed. First of all, the atlas-based segmentation was applied to define initial hippocampal region for a priori information on graph-cuts. The definition of initial seeds was further elaborated by incorporating estimation of partial volume probabilities at each voxel. Finally, morphological opening was applied to reduce false positive of the result processed by graph-cuts. In the experiments with twenty-seven healthy normal subjects, the proposed method showed more reliable results (similarity index=0.81±0.03) than the conventional atlas-based segmentation method (0.72±0.04). Also as for segmentation accuracy which is measured in terms of the ratios of false positive and false negative, the proposed method (precision=0.76±0.04, recall=0.86±0.05) produced lower ratios than the conventional methods (0.73±0.05, 0.72±0.06) demonstrating its plausibility for accurate, robust and reliable segmentation of hippocampus. Copyright © 2013 Elsevier Inc. All rights reserved.

Network discovery with DCM

PubMed Central

Friston, Karl J.; Li, Baojuan; Daunizeau, Jean; Stephan, Klaas E.

2011-01-01

This paper is about inferring or discovering the functional architecture of distributed systems using Dynamic Causal Modelling (DCM). We describe a scheme that recovers the (dynamic) Bayesian dependency graph (connections in a network) using observed network activity. This network discovery uses Bayesian model selection to identify the sparsity structure (absence of edges or connections) in a graph that best explains observed time-series. The implicit adjacency matrix specifies the form of the network (e.g., cyclic or acyclic) and its graph-theoretical attributes (e.g., degree distribution). The scheme is illustrated using functional magnetic resonance imaging (fMRI) time series to discover functional brain networks. Crucially, it can be applied to experimentally evoked responses (activation studies) or endogenous activity in task-free (resting state) fMRI studies. Unlike conventional approaches to network discovery, DCM permits the analysis of directed and cyclic graphs. Furthermore, it eschews (implausible) Markovian assumptions about the serial independence of random fluctuations. The scheme furnishes a network description of distributed activity in the brain that is optimal in the sense of having the greatest conditional probability, relative to other networks. The networks are characterised in terms of their connectivity or adjacency matrices and conditional distributions over the directed (and reciprocal) effective connectivity between connected nodes or regions. We envisage that this approach will provide a useful complement to current analyses of functional connectivity for both activation and resting-state studies. PMID:21182971

Quantum gravity as an information network self-organization of a 4D universe

NASA Astrophysics Data System (ADS)

Trugenberger, Carlo A.

2015-10-01

I propose a quantum gravity model in which the fundamental degrees of freedom are information bits for both discrete space-time points and links connecting them. The Hamiltonian is a very simple network model consisting of a ferromagnetic Ising model for space-time vertices and an antiferromagnetic Ising model for the links. As a result of the frustration between these two terms, the ground state self-organizes as a new type of low-clustering graph with finite Hausdorff dimension 4. The spectral dimension is lower than the Hausdorff dimension: it coincides with the Hausdorff dimension 4 at a first quantum phase transition corresponding to an IR fixed point, while at a second quantum phase transition describing small scales space-time dissolves into disordered information bits. The large-scale dimension 4 of the universe is related to the upper critical dimension 4 of the Ising model. At finite temperatures the universe graph emerges without a big bang and without singularities from a ferromagnetic phase transition in which space-time itself forms out of a hot soup of information bits. When the temperature is lowered the universe graph unfolds and expands by lowering its connectivity, a mechanism I have called topological expansion. The model admits topological black hole excitations corresponding to graphs containing holes with no space-time inside and with "Schwarzschild-like" horizons with a lower spectral dimension.

Efficient Graph-Based Resource Allocation Scheme Using Maximal Independent Set for Randomly- Deployed Small Star Networks

PubMed Central

Zhou, Jian; Wang, Lusheng; Wang, Weidong; Zhou, Qingfeng

2017-01-01

In future scenarios of heterogeneous and dense networks, randomly-deployed small star networks (SSNs) become a key paradigm, whose system performance is restricted to inter-SSN interference and requires an efficient resource allocation scheme for interference coordination. Traditional resource allocation schemes do not specifically focus on this paradigm and are usually too time consuming in dense networks. In this article, a very efficient graph-based scheme is proposed, which applies the maximal independent set (MIS) concept in graph theory to help divide SSNs into almost interference-free groups. We first construct an interference graph for the system based on a derived distance threshold indicating for any pair of SSNs whether there is intolerable inter-SSN interference or not. Then, SSNs are divided into MISs, and the same resource can be repetitively used by all the SSNs in each MIS. Empirical parameters and equations are set in the scheme to guarantee high performance. Finally, extensive scenarios both dense and nondense are randomly generated and simulated to demonstrate the performance of our scheme, indicating that it outperforms the classical max K-cut-based scheme in terms of system capacity, utility and especially time cost. Its achieved system capacity, utility and fairness can be close to the near-optimal strategy obtained by a time-consuming simulated annealing search. PMID:29113109

A Collection of Features for Semantic Graphs

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

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

2007-05-02

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

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

PubMed

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

2010-03-01

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

Classification of forensic autopsy reports through conceptual graph-based document representation model.

PubMed

Mujtaba, Ghulam; Shuib, Liyana; Raj, Ram Gopal; Rajandram, Retnagowri; Shaikh, Khairunisa; Al-Garadi, Mohammed Ali

2018-06-01

Text categorization has been used extensively in recent years to classify plain-text clinical reports. This study employs text categorization techniques for the classification of open narrative forensic autopsy reports. One of the key steps in text classification is document representation. In document representation, a clinical report is transformed into a format that is suitable for classification. The traditional document representation technique for text categorization is the bag-of-words (BoW) technique. In this study, the traditional BoW technique is ineffective in classifying forensic autopsy reports because it merely extracts frequent but discriminative features from clinical reports. Moreover, this technique fails to capture word inversion, as well as word-level synonymy and polysemy, when classifying autopsy reports. Hence, the BoW technique suffers from low accuracy and low robustness unless it is improved with contextual and application-specific information. To overcome the aforementioned limitations of the BoW technique, this research aims to develop an effective conceptual graph-based document representation (CGDR) technique to classify 1500 forensic autopsy reports from four (4) manners of death (MoD) and sixteen (16) causes of death (CoD). Term-based and Systematized Nomenclature of Medicine-Clinical Terms (SNOMED CT) based conceptual features were extracted and represented through graphs. These features were then used to train a two-level text classifier. The first level classifier was responsible for predicting MoD. In addition, the second level classifier was responsible for predicting CoD using the proposed conceptual graph-based document representation technique. To demonstrate the significance of the proposed technique, its results were compared with those of six (6) state-of-the-art document representation techniques. Lastly, this study compared the effects of one-level classification and two-level classification on the experimental results. The experimental results indicated that the CGDR technique achieved 12% to 15% improvement in accuracy compared with fully automated document representation baseline techniques. Moreover, two-level classification obtained better results compared with one-level classification. The promising results of the proposed conceptual graph-based document representation technique suggest that pathologists can adopt the proposed system as their basis for second opinion, thereby supporting them in effectively determining CoD. Copyright © 2018 Elsevier Inc. All rights reserved.

Using a high-dimensional graph of semantic space to model relationships among words

PubMed Central

Jackson, Alice F.; Bolger, Donald J.

2014-01-01

The GOLD model (Graph Of Language Distribution) is a network model constructed based on co-occurrence in a large corpus of natural language that may be used to explore what information may be present in a graph-structured model of language, and what information may be extracted through theoretically-driven algorithms as well as standard graph analysis methods. The present study will employ GOLD to examine two types of relationship between words: semantic similarity and associative relatedness. Semantic similarity refers to the degree of overlap in meaning between words, while associative relatedness refers to the degree to which two words occur in the same schematic context. It is expected that a graph structured model of language constructed based on co-occurrence should easily capture associative relatedness, because this type of relationship is thought to be present directly in lexical co-occurrence. However, it is hypothesized that semantic similarity may be extracted from the intersection of the set of first-order connections, because two words that are semantically similar may occupy similar thematic or syntactic roles across contexts and thus would co-occur lexically with the same set of nodes. Two versions the GOLD model that differed in terms of the co-occurence window, bigGOLD at the paragraph level and smallGOLD at the adjacent word level, were directly compared to the performance of a well-established distributional model, Latent Semantic Analysis (LSA). The superior performance of the GOLD models (big and small) suggest that a single acquisition and storage mechanism, namely co-occurrence, can account for associative and conceptual relationships between words and is more psychologically plausible than models using singular value decomposition (SVD). PMID:24860525

Using a high-dimensional graph of semantic space to model relationships among words.

PubMed

Jackson, Alice F; Bolger, Donald J

2014-01-01

The GOLD model (Graph Of Language Distribution) is a network model constructed based on co-occurrence in a large corpus of natural language that may be used to explore what information may be present in a graph-structured model of language, and what information may be extracted through theoretically-driven algorithms as well as standard graph analysis methods. The present study will employ GOLD to examine two types of relationship between words: semantic similarity and associative relatedness. Semantic similarity refers to the degree of overlap in meaning between words, while associative relatedness refers to the degree to which two words occur in the same schematic context. It is expected that a graph structured model of language constructed based on co-occurrence should easily capture associative relatedness, because this type of relationship is thought to be present directly in lexical co-occurrence. However, it is hypothesized that semantic similarity may be extracted from the intersection of the set of first-order connections, because two words that are semantically similar may occupy similar thematic or syntactic roles across contexts and thus would co-occur lexically with the same set of nodes. Two versions the GOLD model that differed in terms of the co-occurence window, bigGOLD at the paragraph level and smallGOLD at the adjacent word level, were directly compared to the performance of a well-established distributional model, Latent Semantic Analysis (LSA). The superior performance of the GOLD models (big and small) suggest that a single acquisition and storage mechanism, namely co-occurrence, can account for associative and conceptual relationships between words and is more psychologically plausible than models using singular value decomposition (SVD).

Sampling ARG of multiple populations under complex configurations of subdivision and admixture.

PubMed

Carrieri, Anna Paola; Utro, Filippo; Parida, Laxmi

2016-04-01

Simulating complex evolution scenarios of multiple populations is an important task for answering many basic questions relating to population genomics. Apart from the population samples, the underlying Ancestral Recombinations Graph (ARG) is an additional important means in hypothesis checking and reconstruction studies. Furthermore, complex simulations require a plethora of interdependent parameters making even the scenario-specification highly non-trivial. We present an algorithm SimRA that simulates generic multiple population evolution model with admixture. It is based on random graphs that improve dramatically in time and space requirements of the classical algorithm of single populations.Using the underlying random graphs model, we also derive closed forms of expected values of the ARG characteristics i.e., height of the graph, number of recombinations, number of mutations and population diversity in terms of its defining parameters. This is crucial in aiding the user to specify meaningful parameters for the complex scenario simulations, not through trial-and-error based on raw compute power but intelligent parameter estimation. To the best of our knowledge this is the first time closed form expressions have been computed for the ARG properties. We show that the expected values closely match the empirical values through simulations.Finally, we demonstrate that SimRA produces the ARG in compact forms without compromising any accuracy. We demonstrate the compactness and accuracy through extensive experiments. SimRA (Simulation based on Random graph Algorithms) source, executable, user manual and sample input-output sets are available for downloading at: https://github.com/ComputationalGenomics/SimRA CONTACT: : parida@us.ibm.com Supplementary data are available at Bioinformatics online. © The Author 2015. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

L1-norm locally linear representation regularization multi-source adaptation learning.

PubMed

Tao, Jianwen; Wen, Shiting; Hu, Wenjun

2015-09-01

In most supervised domain adaptation learning (DAL) tasks, one has access only to a small number of labeled examples from target domain. Therefore the success of supervised DAL in this "small sample" regime needs the effective utilization of the large amounts of unlabeled data to extract information that is useful for generalization. Toward this end, we here use the geometric intuition of manifold assumption to extend the established frameworks in existing model-based DAL methods for function learning by incorporating additional information about the target geometric structure of the marginal distribution. We would like to ensure that the solution is smooth with respect to both the ambient space and the target marginal distribution. In doing this, we propose a novel L1-norm locally linear representation regularization multi-source adaptation learning framework which exploits the geometry of the probability distribution, which has two techniques. Firstly, an L1-norm locally linear representation method is presented for robust graph construction by replacing the L2-norm reconstruction measure in LLE with L1-norm one, which is termed as L1-LLR for short. Secondly, considering the robust graph regularization, we replace traditional graph Laplacian regularization with our new L1-LLR graph Laplacian regularization and therefore construct new graph-based semi-supervised learning framework with multi-source adaptation constraint, which is coined as L1-MSAL method. Moreover, to deal with the nonlinear learning problem, we also generalize the L1-MSAL method by mapping the input data points from the input space to a high-dimensional reproducing kernel Hilbert space (RKHS) via a nonlinear mapping. Promising experimental results have been obtained on several real-world datasets such as face, visual video and object. Copyright © 2015 Elsevier Ltd. All rights reserved.

Self-complementary circular codes in coding theory.

PubMed

Fimmel, Elena; Michel, Christian J; Starman, Martin; Strüngmann, Lutz

2018-04-01

Self-complementary circular codes are involved in pairing genetic processes. A maximal [Formula: see text] self-complementary circular code X of trinucleotides was identified in genes of bacteria, archaea, eukaryotes, plasmids and viruses (Michel in Life 7(20):1-16 2017, J Theor Biol 380:156-177, 2015; Arquès and Michel in J Theor Biol 182:45-58 1996). In this paper, self-complementary circular codes are investigated using the graph theory approach recently formulated in Fimmel et al. (Philos Trans R Soc A 374:20150058, 2016). A directed graph [Formula: see text] associated with any code X mirrors the properties of the code. In the present paper, we demonstrate a necessary condition for the self-complementarity of an arbitrary code X in terms of the graph theory. The same condition has been proven to be sufficient for codes which are circular and of large size [Formula: see text] trinucleotides, in particular for maximal circular codes ([Formula: see text] trinucleotides). For codes of small-size [Formula: see text] trinucleotides, some very rare counterexamples have been constructed. Furthermore, the length and the structure of the longest paths in the graphs associated with the self-complementary circular codes are investigated. It has been proven that the longest paths in such graphs determine the reading frame for the self-complementary circular codes. By applying this result, the reading frame in any arbitrary sequence of trinucleotides is retrieved after at most 15 nucleotides, i.e., 5 consecutive trinucleotides, from the circular code X identified in genes. Thus, an X motif of a length of at least 15 nucleotides in an arbitrary sequence of trinucleotides (not necessarily all of them belonging to X) uniquely defines the reading (correct) frame, an important criterion for analyzing the X motifs in genes in the future.

Evolution of worldwide stock markets, correlation structure, and correlation-based graphs

NASA Astrophysics Data System (ADS)

Song, Dong-Ming; Tumminello, Michele; Zhou, Wei-Xing; Mantegna, Rosario N.

2011-08-01

We investigate the daily correlation present among market indices of stock exchanges located all over the world in the time period January 1996 to July 2009. We discover that the correlation among market indices presents both a fast and a slow dynamics. The slow dynamics reflects the development and consolidation of globalization. The fast dynamics is associated with critical events that originate in a specific country or region of the world and rapidly affect the global system. We provide evidence that the short term time scale of correlation among market indices is less than 3 trading months (about 60 trading days). The average values of the nondiagonal elements of the correlation matrix, correlation-based graphs, and the spectral properties of the largest eigenvalues and eigenvectors of the correlation matrix are carrying information about the fast and slow dynamics of the correlation of market indices. We introduce a measure of mutual information based on link co-occurrence in networks in order to detect the fast dynamics of successive changes of correlation-based graphs in a quantitative way.

Graphing with "LogoWriter."

ERIC Educational Resources Information Center

Yoder, Sharon K.

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

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

Zhang, Fangyan; Zhang, Song; Chung Wong, Pak

Effectively visualizing large graphs and capturing the statistical properties are two challenging tasks. To aid in these two tasks, many sampling approaches for graph simplification have been proposed, falling into three categories: node sampling, edge sampling, and traversal-based sampling. It is still unknown which approach is the best. We evaluate commonly used graph sampling methods through a combined visual and statistical comparison of graphs sampled at various rates. We conduct our evaluation on three graph models: random graphs, small-world graphs, and scale-free graphs. Initial results indicate that the effectiveness of a sampling method is dependent on the graph model, themore » size of the graph, and the desired statistical property. This benchmark study can be used as a guideline in choosing the appropriate method for a particular graph sampling task, and the results presented can be incorporated into graph visualization and analysis tools.« less

An algorithm for finding a similar subgraph of all Hamiltonian cycles

NASA Astrophysics Data System (ADS)

Wafdan, R.; Ihsan, M.; Suhaimi, D.

2018-01-01

This paper discusses an algorithm to find a similar subgraph called findSimSubG algorithm. A similar subgraph is a subgraph with a maximum number of edges, contains no isolated vertex and is contained in every Hamiltonian cycle of a Hamiltonian Graph. The algorithm runs only on Hamiltonian graphs with at least two Hamiltonian cycles. The algorithm works by examining whether the initial subgraph of the first Hamiltonian cycle is a subgraph of comparison graphs. If the initial subgraph is not in comparison graphs, the algorithm will remove edges and vertices of the initial subgraph that are not in comparison graphs. There are two main processes in the algorithm, changing Hamiltonian cycle into a cycle graph and removing edges and vertices of the initial subgraph that are not in comparison graphs. The findSimSubG algorithm can find the similar subgraph without using backtracking method. The similar subgraph cannot be found on certain graphs, such as an n-antiprism graph, complete bipartite graph, complete graph, 2n-crossed prism graph, n-crown graph, n-möbius ladder, prism graph, and wheel graph. The complexity of this algorithm is O(m|V|), where m is the number of Hamiltonian cycles and |V| is the number of vertices of a Hamiltonian graph.

Similarity of Introductory Psychology Textbooks: Reality or Illusion?

ERIC Educational Resources Information Center

Griggs, Richard A.; Marek, Pam

2001-01-01

Presents a study that reviewed introductory psychology textbooks to examine the perception of extensive similarity. Focuses on six dimensions: (1) chapter topics, organization, and extent of topic coverage; (2) core concepts and key terms; (3) pedagogical aids and data graphs; (4) critical-thinking programs; (5) reference citations; and (6) level…

A Gene Ontology Tutorial in Python.

PubMed

Vesztrocy, Alex Warwick; Dessimoz, Christophe

2017-01-01

This chapter is a tutorial on using Gene Ontology resources in the Python programming language. This entails querying the Gene Ontology graph, retrieving Gene Ontology annotations, performing gene enrichment analyses, and computing basic semantic similarity between GO terms. An interactive version of the tutorial, including solutions, is available at http://gohandbook.org .

Semantic Similarity Graphs of Mathematics Word Problems: Can Terminology Detection Help?

ERIC Educational Resources Information Center

John, Rogers Jeffrey Leo; Passonneau, Rebecca J.; McTavish, Thomas S.

2015-01-01

Curricula often lack metadata to characterize the relatedness of concepts. To investigate automatic methods for generating relatedness metadata for a mathematics curriculum, we first address the task of identifying which terms in the vocabulary from mathematics word problems are associated with the curriculum. High chance-adjusted interannotator…

A Simple Exposition of the Social Security Trust Fund.

ERIC Educational Resources Information Center

Holahan, William L.; Schug, Mark C.

2000-01-01

Discusses a strategy for teaching students about how the Social Security Trust Fund works. Explains that a flow chart is presented to the students; four terms are defined (deficit, surplus, debt, and reserve); and a new graph is prepared to show the paths of these four variables. (CMK)

Industrial wood productivity in the United States, 1900-1998

Treesearch

Peter J. Ince

2000-01-01

The productivity of U.S. wood and paper product output in terms of wood input is computed and displayed in graphs. Background tables provide supporting data. The productivity trend parallels trends in the recovered paper utilization rate. Recycling and wood residue use are key factors in productivity gains.

Mathematical foundations of the GraphBLAS

DOE PAGES

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

2016-12-01

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

Irreversibility of financial time series: A graph-theoretical approach

NASA Astrophysics Data System (ADS)

Flanagan, Ryan; Lacasa, Lucas

2016-04-01

The relation between time series irreversibility and entropy production has been recently investigated in thermodynamic systems operating away from equilibrium. In this work we explore this concept in the context of financial time series. We make use of visibility algorithms to quantify, in graph-theoretical terms, time irreversibility of 35 financial indices evolving over the period 1998-2012. We show that this metric is complementary to standard measures based on volatility and exploit it to both classify periods of financial stress and to rank companies accordingly. We then validate this approach by finding that a projection in principal components space of financial years, based on time irreversibility features, clusters together periods of financial stress from stable periods. Relations between irreversibility, efficiency and predictability are briefly discussed.

Graph theoretical stable allocation as a tool for reproduction of control by human operators

NASA Astrophysics Data System (ADS)

van Nooijen, Ronald; Ertsen, Maurits; Kolechkina, Alla

2016-04-01

During the design of central control algorithms for existing water resource systems under manual control it is important to consider the interaction with parts of the system that remain under manual control and to compare the proposed new system with the existing manual methods. In graph theory the "stable allocation" problem has good solution algorithms and allows for formulation of flow distribution problems in terms of priorities. As a test case for the use of this approach we used the algorithm to derive water allocation rules for the Gezira Scheme, an irrigation system located between the Blue and White Niles south of Khartoum. In 1925, Gezira started with 300,000 acres; currently it covers close to two million acres.

Physician nurse care: A new use of UMLS to measure professional contribution: Are we talking about the same patient a new graph matching algorithm?

PubMed

Boyd, Andrew D; Dunn Lopez, Karen; Lugaresi, Camillo; Macieira, Tamara; Sousa, Vanessa; Acharya, Sabita; Balasubramanian, Abhinaya; Roussi, Khawllah; Keenan, Gail M; Lussier, Yves A; Li, Jianrong 'John'; Burton, Michel; Di Eugenio, Barbara

2018-05-01

Physician and nurses have worked together for generations; however, their language and training are vastly different; comparing and contrasting their work and their joint impact on patient outcomes is difficult in light of this difference. At the same time, the EHR only includes the physician perspective via the physician-authored discharge summary, but not nurse documentation. Prior research in this area has focused on collaboration and the usage of similar terminology. The objective of the study is to gain insight into interprofessional care by developing a computational metric to identify similarities, related concepts and differences in physician and nurse work. 58 physician discharge summaries and the corresponding nurse plans of care were transformed into Unified Medical Language System (UMLS) Concept Unique Identifiers (CUIs). MedLEE, a Natural Language Processing (NLP) program, extracted "physician terms" from free-text physician summaries. The nursing plans of care were constructed using the HANDS © nursing documentation software. HANDS © utilizes structured terminologies: nursing diagnosis (NANDA-I), outcomes (NOC), and interventions (NIC) to create "nursing terms". The physician's and nurse's terms were compared using the UMLS network for relatedness, overlaying the physician and nurse terms for comparison. Our overarching goal is to provide insight into the care, by innovatively applying graph algorithms to the UMLS network. We reveal the relationships between the care provided by each professional that is specific to the patient level. We found that only 26% of patients had synonyms (identical UMLS CUIs) between the two professions' documentation. On average, physicians' discharge summaries contain 27 terms and nurses' documentation, 18. Traversing the UMLS network, we found an average of 4 terms related (distance less than 2) between the professions, leaving most concepts as unrelated between nurse and physician care. Our hypothesis that physician's and nurse's practice domains are markedly different is supported by the preliminary, quantitative evidence we found. Leveraging the UMLS network and graph traversal algorithms, allows us to compare and contrast nursing and physician care on a single patient, enabling a more complete picture of patient care. We can differentiate professional contributions to patient outcomes and related and divergent concepts by each profession. Copyright © 2018 The Author(s). Published by Elsevier B.V. All rights reserved.

Supercomputer Environments

DTIC Science & Technology

1990-01-09

data structures can easily be presented to the user interface. An emphasis of the Graph Browser was the realization of graph views and graph animation ... animation of the graph. Anima- tion of the graph includes changing node shapes, changing node and arc colors, changing node and arc text, and making...many graphs tend to be tree-like. Animtion of a graph is a useful feature. One of the primary goals of GMB was to support animated graphs. For animation

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

ERIC Educational Resources Information Center

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

2017-01-01

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

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

NASA Astrophysics Data System (ADS)

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

2014-07-01

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

Alterations in Anatomical Covariance in the Prematurely Born.

PubMed

Scheinost, Dustin; Kwon, Soo Hyun; Lacadie, Cheryl; Vohr, Betty R; Schneider, Karen C; Papademetris, Xenophon; Constable, R Todd; Ment, Laura R

2017-01-01

Preterm (PT) birth results in long-term alterations in functional and structural connectivity, but the related changes in anatomical covariance are just beginning to be explored. To test the hypothesis that PT birth alters patterns of anatomical covariance, we investigated brain volumes of 25 PTs and 22 terms at young adulthood using magnetic resonance imaging. Using regional volumetrics, seed-based analyses, and whole brain graphs, we show that PT birth is associated with reduced volume in bilateral temporal and inferior frontal lobes, left caudate, left fusiform, and posterior cingulate for prematurely born subjects at young adulthood. Seed-based analyses demonstrate altered patterns of anatomical covariance for PTs compared with terms. PTs exhibit reduced covariance with R Brodmann area (BA) 47, Broca's area, and L BA 21, Wernicke's area, and white matter volume in the left prefrontal lobe, but increased covariance with R BA 47 and left cerebellum. Graph theory analyses demonstrate that measures of network complexity are significantly less robust in PTs compared with term controls. Volumes in regions showing group differences are significantly correlated with phonological awareness, the fundamental basis for reading acquisition, for the PTs. These data suggest both long-lasting and clinically significant alterations in the covariance in the PTs at young adulthood. © The Author 2015. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

Comparison and Enumeration of Chemical Graphs

PubMed Central

Akutsu, Tatsuya; Nagamochi, Hiroshi

2013-01-01

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

Mean square cordial labelling related to some acyclic graphs and its rough approximations

NASA Astrophysics Data System (ADS)

Dhanalakshmi, S.; Parvathi, N.

2018-04-01

In this paper we investigate that the path Pn, comb graph Pn⊙K1, n-centipede graph,centipede graph (n,2) and star Sn admits mean square cordial labeling. Also we proved that the induced sub graph obtained by the upper approximation of any sub graph H of the above acyclic graphs admits mean square cordial labeling.

Topic Model for Graph Mining.

PubMed

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

2015-12-01

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

Rewriting "The Road to Nowhere": Place Pedagogies in Western Sydney

ERIC Educational Resources Information Center

Gannon, Susanne

2009-01-01

Negative representations of parts of our cities are endemic in the Australian media, where certain suburbs function as motifs for failure--past, present, and future. Indeed, as one journalist put it after invoking the "interchangeable" triumvirate of Sydney's Mount Druitt, Melbourne's West Heidelberg, and Brisbane's Inala, "geography is destiny"…

Awakening to Opportunities in International Business: A Title VI-B Grant and Partnership Approach

ERIC Educational Resources Information Center

Haynes, Joan; Rutz, Rebecca

2007-01-01

Subsequent to hurricane Katrina, Mississippi Gulf Coast businesses are rebuilding and rewriting rules. This catastrophic event has offered the coast a tremendous opportunity to write new rules furthering the redevelopment and expansion of international trade through the ports of Gulfport and Pascagoula and the expansion of the tourism industry.

Rewriting Writers Workshop: Creating Safe Spaces for Disruptive Stories

ERIC Educational Resources Information Center

Lewison, Mitzi; Heffernan, Lee

2008-01-01

This article explores a third-grade teacher's use of critical writing pedagogy to encourage students' exploration of issues that were important in their lives from personal as well as social perspectives. She used a particular version of critical writing pedagogy--social narrative writing--in which students read and discussed children's literature…

"Bloodline Is All I Need": Defiant Indigeneity and Hawaiian Hip-Hop

ERIC Educational Resources Information Center

Teves, Stephanie Nohelani

2011-01-01

During the late twentieth century, Kanaka Maoli have struggled to push back against these representations, offering a rewriting of Hawaiian history, quite literally. Infused by Hawaiian nationalism and a growing library of works that investigate the naturalization of American colonialism in Hawai'i, innovative Kanaka Maoli representations in the…

Foucault and Marxism: Rewriting the Theory of Historical Materialism

ERIC Educational Resources Information Center

Olssen, Mark

2004-01-01

This article explores the relationship of Foucault to Marxism. Although he was often critical of Marxism, Foucault's own approach bears striking parallels to Marxism, as a form of method, as an account of history, and as an analysis of social structure. Like Marxism, Foucault represents social practices as transitory and all knowledge and…

From Competence in the Curriculum to Competence in Action

ERIC Educational Resources Information Center

Jonnaert, Philippe; Masciotra, Domenico; Barrette, Johanne; Morel, Denise; Mane, Yaya

2007-01-01

The article begins by drawing a distinction between the concepts of "curriculum" and "programme of study", and goes on to show that curriculum reform involves much more than simply rewriting programmes of study. The reforms that are presently sweeping across education systems throughout the world qualify, in many cases, as true paradigm…

Spent Nuclear Fuel Project Configuration Management Plan

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

Reilly, M.A.

This document is a rewrite of the draft ``C`` that was agreed to ``in principle`` by SNF Project level 2 managers on EDT 609835, dated March 1995 (not released). The implementation process philosphy was changed in keeping with the ongoing reengineering of the WHC Controlled Manuals to achieve configuration management within the SNF Project.

The Virtual Dream: Rewriting Stories of Loss and Grief

ERIC Educational Resources Information Center

Neimeyer, Robert A.; Torres, Carlos; Smith, Douglas C.

2011-01-01

In this article, the authors introduce the "virtual dream", a technique that entails writing a brief, spontaneous dreamlike story on themes of loss, using a flexible set of assigned elements of setting and characterization to scaffold the writing. After providing several examples of virtual dreams written by workshop participants, the authors…