Sample records for matrix graph grammars

  1. Mathematical formula recognition using graph grammar

    NASA Astrophysics Data System (ADS)

    Lavirotte, Stephane; Pottier, Loic

    1998-04-01

    This paper describes current results of Ofr, a system for extracting and understanding mathematical expressions in documents. Such a tool could be really useful to be able to re-use knowledge in scientific books which are not available in electronic form. We currently also study use of this system for direct input of formulas with a graphical tablet for computer algebra system softwares. Existing solutions for mathematical recognition have problems to analyze 2D expressions like vectors and matrices. This is because they often try to use extended classical grammar to analyze formulas, relatively to baseline. But a lot of mathematical notations do not respect rules for such a parsing and that is the reason why they fail to extend text parsing technic. We investigate graph grammar and graph rewriting as a solution to recognize 2D mathematical notations. Graph grammar provide a powerful formalism to describe structural manipulations of multi-dimensional data. The main two problems to solve are ambiguities between rules of grammar and construction of graph.

  2. An approach to multiscale modelling with graph grammars.

    PubMed

    Ong, Yongzhi; Streit, Katarína; Henke, Michael; Kurth, Winfried

    2014-09-01

    Functional-structural plant models (FSPMs) simulate biological processes at different spatial scales. Methods exist for multiscale data representation and modification, but the advantages of using multiple scales in the dynamic aspects of FSPMs remain unclear. Results from multiscale models in various other areas of science that share fundamental modelling issues with FSPMs suggest that potential advantages do exist, and this study therefore aims to introduce an approach to multiscale modelling in FSPMs. A three-part graph data structure and grammar is revisited, and presented with a conceptual framework for multiscale modelling. The framework is used for identifying roles, categorizing and describing scale-to-scale interactions, thus allowing alternative approaches to model development as opposed to correlation-based modelling at a single scale. Reverse information flow (from macro- to micro-scale) is catered for in the framework. The methods are implemented within the programming language XL. Three example models are implemented using the proposed multiscale graph model and framework. The first illustrates the fundamental usage of the graph data structure and grammar, the second uses probabilistic modelling for organs at the fine scale in order to derive crown growth, and the third combines multiscale plant topology with ozone trends and metabolic network simulations in order to model juvenile beech stands under exposure to a toxic trace gas. The graph data structure supports data representation and grammar operations at multiple scales. The results demonstrate that multiscale modelling is a viable method in FSPM and an alternative to correlation-based modelling. Advantages and disadvantages of multiscale modelling are illustrated by comparisons with single-scale implementations, leading to motivations for further research in sensitivity analysis and run-time efficiency for these models.

  3. An approach to multiscale modelling with graph grammars

    PubMed Central

    Ong, Yongzhi; Streit, Katarína; Henke, Michael; Kurth, Winfried

    2014-01-01

    Background and Aims Functional–structural plant models (FSPMs) simulate biological processes at different spatial scales. Methods exist for multiscale data representation and modification, but the advantages of using multiple scales in the dynamic aspects of FSPMs remain unclear. Results from multiscale models in various other areas of science that share fundamental modelling issues with FSPMs suggest that potential advantages do exist, and this study therefore aims to introduce an approach to multiscale modelling in FSPMs. Methods A three-part graph data structure and grammar is revisited, and presented with a conceptual framework for multiscale modelling. The framework is used for identifying roles, categorizing and describing scale-to-scale interactions, thus allowing alternative approaches to model development as opposed to correlation-based modelling at a single scale. Reverse information flow (from macro- to micro-scale) is catered for in the framework. The methods are implemented within the programming language XL. Key Results Three example models are implemented using the proposed multiscale graph model and framework. The first illustrates the fundamental usage of the graph data structure and grammar, the second uses probabilistic modelling for organs at the fine scale in order to derive crown growth, and the third combines multiscale plant topology with ozone trends and metabolic network simulations in order to model juvenile beech stands under exposure to a toxic trace gas. Conclusions The graph data structure supports data representation and grammar operations at multiple scales. The results demonstrate that multiscale modelling is a viable method in FSPM and an alternative to correlation-based modelling. Advantages and disadvantages of multiscale modelling are illustrated by comparisons with single-scale implementations, leading to motivations for further research in sensitivity analysis and run-time efficiency for these models. PMID:25134929

  4. Nonschematic drawing recognition: a new approach based on attributed graph grammar with flexible embedding

    NASA Astrophysics Data System (ADS)

    Lee, Kyu J.; Kunii, T. L.; Noma, T.

    1993-01-01

    In this paper, we propose a syntactic pattern recognition method for non-schematic drawings, based on a new attributed graph grammar with flexible embedding. In our graph grammar, the embedding rule permits the nodes of a guest graph to be arbitrarily connected with the nodes of a host graph. The ambiguity caused by this flexible embedding is controlled with the evaluation of synthesized attributes and the check of context sensitivity. To integrate parsing with the synthesized attribute evaluation and the context sensitivity check, we also develop a bottom up parsing algorithm.

  5. A graph grammar approach to artificial life.

    PubMed

    Kniemeyer, Ole; Buck-Sorlin, Gerhard H; Kurth, Winfried

    2004-01-01

    We present the high-level language of relational growth grammars (RGGs) as a formalism designed for the specification of ALife models. RGGs can be seen as an extension of the well-known parametric Lindenmayer systems and contain rule-based, procedural, and object-oriented features. They are defined as rewriting systems operating on graphs with the edges coming from a set of user-defined relations, whereas the nodes can be associated with objects. We demonstrate their ability to represent genes, regulatory networks of metabolites, and morphologically structured organisms, as well as developmental aspects of these entities, in a common formal framework. Mutation, crossing over, selection, and the dynamics of a network of gene regulation can all be represented with simple graph rewriting rules. This is demonstrated in some detail on the classical example of Dawkins' biomorphs and the ABC model of flower morphogenesis: other applications are briefly sketched. An interactive program was implemented, enabling the execution of the formalism and the visualization of the results.

  6. Representing k-graphs as Matrix Algebras

    NASA Astrophysics Data System (ADS)

    Rosjanuardi, R.

    2018-05-01

    For any commutative unital ring R and finitely aligned k-graph Λ with |Λ| < ∞ without cycles, we can realise Kumjian-Pask algebra KP R (Λ) as a direct sum of of matrix algebra over some vertices v with properties ν = νΛ, i.e: ⊕ νΛ=ν M |Λv|(R). When there is only a single vertex ν ∈ Λ° such that ν = νΛ, we can realise the Kumjian-Pask algebra as the matrix algebra M |ΛV|(R). Hence the matrix algebra M |vΛ|(R) can be regarded as a representation of the k-graph Λ. In this talk we will figure out the relation between finitely aligned k-graph and matrix algebra.

  7. Attribute And-Or Grammar for Joint Parsing of Human Pose, Parts and Attributes.

    PubMed

    Park, Seyoung; Nie, Xiaohan; Zhu, Song-Chun

    2017-07-25

    This paper presents an attribute and-or grammar (A-AOG) model for jointly inferring human body pose and human attributes in a parse graph with attributes augmented to nodes in the hierarchical representation. In contrast to other popular methods in the current literature that train separate classifiers for poses and individual attributes, our method explicitly represents the decomposition and articulation of body parts, and account for the correlations between poses and attributes. The A-AOG model is an amalgamation of three traditional grammar formulations: (i)Phrase structure grammar representing the hierarchical decomposition of the human body from whole to parts; (ii)Dependency grammar modeling the geometric articulation by a kinematic graph of the body pose; and (iii)Attribute grammar accounting for the compatibility relations between different parts in the hierarchy so that their appearances follow a consistent style. The parse graph outputs human detection, pose estimation, and attribute prediction simultaneously, which are intuitive and interpretable. We conduct experiments on two tasks on two datasets, and experimental results demonstrate the advantage of joint modeling in comparison with computing poses and attributes independently. Furthermore, our model obtains better performance over existing methods for both pose estimation and attribute prediction tasks.

  8. Performance of children with developmental dyslexia on high and low topological entropy artificial grammar learning task.

    PubMed

    Katan, Pesia; Kahta, Shani; Sasson, Ayelet; Schiff, Rachel

    2017-07-01

    Graph complexity as measured by topological entropy has been previously shown to affect performance on artificial grammar learning tasks among typically developing children. The aim of this study was to examine the effect of graph complexity on implicit sequential learning among children with developmental dyslexia. Our goal was to determine whether children's performance depends on the complexity level of the grammar system learned. We conducted two artificial grammar learning experiments that compared performance of children with developmental dyslexia with that of age- and reading level-matched controls. Experiment 1 was a high topological entropy artificial grammar learning task that aimed to establish implicit learning phenomena in children with developmental dyslexia using previously published experimental conditions. Experiment 2 is a lower topological entropy variant of that task. Results indicated that given a high topological entropy grammar system, children with developmental dyslexia who were similar to the reading age-matched control group had substantial difficulty in performing the task as compared to typically developing children, who exhibited intact implicit learning of the grammar. On the other hand, when tested on a lower topological entropy grammar system, all groups performed above chance level, indicating that children with developmental dyslexia were able to identify rules from a given grammar system. The results reinforced the significance of graph complexity when experimenting with artificial grammar learning tasks, particularly with dyslexic participants.

  9. A generalized graph-theoretical matrix of heterosystems and its application to the VMV procedure.

    PubMed

    Mozrzymas, Anna

    2011-12-14

    The extensions of generalized (molecular) graph-theoretical matrix and vector-matrix-vector procedure are considered. The elements of the generalized matrix are redefined in order to describe molecules containing heteroatoms and multiple bonds. The adjacency, distance, detour and reciprocal distance matrices of heterosystems, and corresponding vectors are derived from newly defined generalized graph matrix. The topological indices, which are most widely used in predicting physicochemical and biological properties/activities of various compounds, can be calculated from the new generalized vector-matrix-vector invariant. Copyright © 2011 Elsevier Ltd. All rights reserved.

  10. Graph Theory

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

    Sanfilippo, Antonio P.

    2005-12-27

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

  11. A matrix-algebraic formulation of distributed-memory maximal cardinality matching algorithms in bipartite graphs

    DOE PAGES

    Azad, Ariful; Buluç, Aydın

    2016-05-16

    We describe parallel algorithms for computing maximal cardinality matching in a bipartite graph on distributed-memory systems. Unlike traditional algorithms that match one vertex at a time, our algorithms process many unmatched vertices simultaneously using a matrix-algebraic formulation of maximal matching. This generic matrix-algebraic framework is used to develop three efficient maximal matching algorithms with minimal changes. The newly developed algorithms have two benefits over existing graph-based algorithms. First, unlike existing parallel algorithms, cardinality of matching obtained by the new algorithms stays constant with increasing processor counts, which is important for predictable and reproducible performance. Second, relying on bulk-synchronous matrix operations,more » these algorithms expose a higher degree of parallelism on distributed-memory platforms than existing graph-based algorithms. We report high-performance implementations of three maximal matching algorithms using hybrid OpenMP-MPI and evaluate the performance of these algorithm using more than 35 real and randomly generated graphs. On real instances, our algorithms achieve up to 200 × speedup on 2048 cores of a Cray XC30 supercomputer. Even higher speedups are obtained on larger synthetically generated graphs where our algorithms show good scaling on up to 16,384 cores.« less

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

  13. Performance of Children with Developmental Dyslexia on High and Low Topological Entropy Artificial Grammar Learning Task

    ERIC Educational Resources Information Center

    Katan, Pesia; Kahta, Shani; Sasson, Ayelet; Schiff, Rachel

    2017-01-01

    Graph complexity as measured by topological entropy has been previously shown to affect performance on artificial grammar learning tasks among typically developing children. The aim of this study was to examine the effect of graph complexity on implicit sequential learning among children with developmental dyslexia. Our goal was to determine…

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

  15. Scalable Matrix Algorithms for Interactive Analytics of Very Large Informatics Graphs

    DTIC Science & Technology

    2017-06-14

    information networks. Depending on the situation, these larger networks may not fit on a single machine. Although we considered traditional matrix and graph...collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources...gathering and maintaining the data needed, and completing and reviewing the collection of information . Send comments regarding this burden estimate or

  16. Exploring and Making Sense of Large Graphs

    DTIC Science & Technology

    2015-08-01

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

  17. Grammar and Grammaring: Toward Modes for English Grammar Teaching in China

    ERIC Educational Resources Information Center

    Nan, Chengyu

    2015-01-01

    The value of grammar instruction in foreign language learning and teaching has been a focus of debate for quite some time, which has resulted in different views on grammar and grammar teaching as well as different teaching approaches based on different perspectives or in different language learning contexts. To explore some modes for grammar…

  18. The Replicator Equation on Graphs

    PubMed Central

    Ohtsuki, Hisashi; Nowak, Martin A.

    2008-01-01

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

  19. Teaching Grammar

    ERIC Educational Resources Information Center

    Crawford, William J.

    2013-01-01

    Grammar is a component in all language skills: reading, writing, speaking, and listening. Teachers need to know rules of grammar (teacher knowledge) as well as techniques that help students use grammar effectively and effortlessly (teaching knowledge). Using reflective practice to help teachers become comfortable with teaching grammar, this…

  20. Convex Graph Invariants

    DTIC Science & Technology

    2010-12-02

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

  1. Grammar A and Grammar B: Rhetorical Life and Death.

    ERIC Educational Resources Information Center

    Guinn, Dorothy Margaret

    In the past, writers have chosen stylistic devices within the parameters of the traditional grammar of style, "Grammar A," characterized by analyticity, coherence, and clarity. But many contemporary writers are creating a new grammar of style, "Grammar B," characterized by synchronicity, discontinuity, and ambiguity, which…

  2. Genetic algorithm and graph theory based matrix factorization method for online friend recommendation.

    PubMed

    Li, Qu; Yao, Min; Yang, Jianhua; Xu, Ning

    2014-01-01

    Online friend recommendation is a fast developing topic in web mining. In this paper, we used SVD matrix factorization to model user and item feature vector and used stochastic gradient descent to amend parameter and improve accuracy. To tackle cold start problem and data sparsity, we used KNN model to influence user feature vector. At the same time, we used graph theory to partition communities with fairly low time and space complexity. What is more, matrix factorization can combine online and offline recommendation. Experiments showed that the hybrid recommendation algorithm is able to recommend online friends with good accuracy.

  3. Graph Coarsening for Path Finding in Cybersecurity Graphs

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

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

    2013-01-01

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

  4. Graph edit distance from spectral seriation.

    PubMed

    Robles-Kelly, Antonio; Hancock, Edwin R

    2005-03-01

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

  5. Effective Grammar Teaching: Lessons from Confident Grammar Teachers

    ERIC Educational Resources Information Center

    Petraki, Eleni; Hill, Deborah

    2011-01-01

    Learning the grammar of a language is an integral part of learning a second or foreign language. Studies on teacher beliefs, teacher language awareness (TLA) and grammar teaching have reported that the majority of English language teachers recognise the importance of teaching grammar (Borg, 2001; Borg & Burns, 2008). At the same time, many…

  6. Representational Issues in Systemic Functional Grammar and Systemic Grammar and Functional Unification Grammar. ISI Reprint Series.

    ERIC Educational Resources Information Center

    Matthiessen, Christian; Kasper, Robert

    Consisting of two separate papers, "Representational Issues in Systemic Functional Grammar," by Christian Matthiessen and "Systemic Grammar and Functional Unification Grammar," by Robert Kasper, this document deals with systemic aspects of natural language processing and linguistic theory and with computational applications of…

  7. The Grammar Gallimaufry: Teaching Students to Challenge the Grammar Gods

    ERIC Educational Resources Information Center

    House, Jeff

    2009-01-01

    How a person teaches grammar depends on what he or she believes it does. Some see grammar as a set of rules, inherited from wise forefathers. For them, teaching grammar means making students aware of, and then holding them to, these rules. Others see grammar as an expression of style, an invitation to the writer to explore how to create a…

  8. Constraining Multiple Grammars

    ERIC Educational Resources Information Center

    Hopp, Holger

    2014-01-01

    This article offers the author's commentary on the Multiple Grammars (MG) language acquisition theory proposed by Luiz Amaral and Tom Roeper in the present issue. Multiple Grammars advances the claim that optionality is a constitutive characteristic of any one grammar, with interlanguage grammars being perhaps the clearest examples of a…

  9. Checking the Grammar Checker: Integrating Grammar Instruction with Writing.

    ERIC Educational Resources Information Center

    McAlexander, Patricia J.

    2000-01-01

    Notes Rei Noguchi's recommendation of integrating grammar instruction with writing instruction and teaching only the most vital terms and the most frequently made errors. Presents a project that provides a review of the grammar lessons, applies many grammar rules specifically to the students' writing, and teaches students the effective use of the…

  10. Grammar Games

    ERIC Educational Resources Information Center

    Brown, Kim

    2004-01-01

    The mere mention of a grammar lesson can set students' eyes rolling. The fun activities described in this article can turn those blank looks into smiles. Here, the author presents grammar games namely: (1) noun tennis; (2) the minister's cat; (3) kids take action; (4) what's my adverb?; (5) and then I saw...; and (6) grammar sing-along.

  11. Grammar! A Conference Report.

    ERIC Educational Resources Information Center

    King, Lid, Ed.; Boaks, Peter, Ed.

    Papers from a conference on the teaching of grammar, particularly in second language instruction, include: "Grammar: Acquisition and Use" (Richard Johnstone); "Grammar and Communication" (Brian Page); "Linguistic Progression and Increasing Independence" (Bernardette Holmes); "La grammaire? C'est du bricolage!" ("Grammar? That's Hardware!") (Barry…

  12. Swahili Learners' Reference Grammar. African Language Learners' Reference Grammar Series.

    ERIC Educational Resources Information Center

    Thompson, Katrina Daly; Schleicher, Antonia Folarin

    This reference grammar is written for speakers of English who are learning Swahili. Because many language learners are not familiar with the grammatical terminology, this book explains the basic terminology and concepts of English grammar that are necessary for understanding the grammar of Swahili. It assumes no formal knowledge of English grammar…

  13. Dynamic graph system for a semantic database

    DOEpatents

    Mizell, David

    2016-04-12

    A method and system in a computer system for dynamically providing a graphical representation of a data store of entries via a matrix interface is disclosed. A dynamic graph system provides a matrix interface that exposes to an application program a graphical representation of data stored in a data store such as a semantic database storing triples. To the application program, the matrix interface represents the graph as a sparse adjacency matrix that is stored in compressed form. Each entry of the data store is considered to represent a link between nodes of the graph. Each entry has a first field and a second field identifying the nodes connected by the link and a third field with a value for the link that connects the identified nodes. The first, second, and third fields represent the rows, column, and elements of the adjacency matrix.

  14. Dynamic graph system for a semantic database

    DOEpatents

    Mizell, David

    2015-01-27

    A method and system in a computer system for dynamically providing a graphical representation of a data store of entries via a matrix interface is disclosed. A dynamic graph system provides a matrix interface that exposes to an application program a graphical representation of data stored in a data store such as a semantic database storing triples. To the application program, the matrix interface represents the graph as a sparse adjacency matrix that is stored in compressed form. Each entry of the data store is considered to represent a link between nodes of the graph. Each entry has a first field and a second field identifying the nodes connected by the link and a third field with a value for the link that connects the identified nodes. The first, second, and third fields represent the rows, column, and elements of the adjacency matrix.

  15. Exploration of picture grammars, grammar learning, and inductive logic programming for image understanding

    NASA Astrophysics Data System (ADS)

    Ducksbury, P. G.; Kennedy, C.; Lock, Z.

    2003-09-01

    Grammars have been used for the formal specification of programming languages, and there are a number of commercial products which now use grammars. However, these have tended to be focused mainly on flow control type applications. In this paper, we consider the potential use of picture grammars and inductive logic programming in generic image understanding applications, such as object recognition. A number of issues are considered, such as what type of grammar needs to be used, how to construct the grammar with its associated attributes, difficulties encountered with parsing grammars followed by issues of automatically learning grammars using a genetic algorithm. The concept of inductive logic programming is then introduced as a method that can overcome some of the earlier difficulties.

  16. Spectral fluctuations of quantum graphs

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

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

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

  17. Learning a generative probabilistic grammar of experience: a process-level model of language acquisition.

    PubMed

    Kolodny, Oren; Lotem, Arnon; Edelman, Shimon

    2015-03-01

    We introduce a set of biologically and computationally motivated design choices for modeling the learning of language, or of other types of sequential, hierarchically structured experience and behavior, and describe an implemented system that conforms to these choices and is capable of unsupervised learning from raw natural-language corpora. Given a stream of linguistic input, our model incrementally learns a grammar that captures its statistical patterns, which can then be used to parse or generate new data. The grammar constructed in this manner takes the form of a directed weighted graph, whose nodes are recursively (hierarchically) defined patterns over the elements of the input stream. We evaluated the model in seventeen experiments, grouped into five studies, which examined, respectively, (a) the generative ability of grammar learned from a corpus of natural language, (b) the characteristics of the learned representation, (c) sequence segmentation and chunking, (d) artificial grammar learning, and (e) certain types of structure dependence. The model's performance largely vindicates our design choices, suggesting that progress in modeling language acquisition can be made on a broad front-ranging from issues of generativity to the replication of human experimental findings-by bringing biological and computational considerations, as well as lessons from prior efforts, to bear on the modeling approach. Copyright © 2014 Cognitive Science Society, Inc.

  18. Group Grammar

    ERIC Educational Resources Information Center

    Adams, Karen

    2015-01-01

    In this article Karen Adams demonstrates how to incorporate group grammar techniques into a classroom activity. In the activity, students practice using the target grammar to do something they naturally enjoy: learning about each other.

  19. Closure properties of Watson-Crick grammars

    NASA Astrophysics Data System (ADS)

    Zulkufli, Nurul Liyana binti Mohamad; Turaev, Sherzod; Tamrin, Mohd Izzuddin Mohd; Azeddine, Messikh

    2015-12-01

    In this paper, we define Watson-Crick context-free grammars, as an extension of Watson-Crick regular grammars and Watson-Crick linear grammars with context-free grammar rules. We show the relation of Watson-Crick (regular and linear) grammars to the sticker systems, and study some of the important closure properties of the Watson-Crick grammars. We establish that the Watson-Crick regular grammars are closed under almost all of the main closure operations, while the differences between other Watson-Crick grammars with their corresponding Chomsky grammars depend on the computational power of the Watson-Crick grammars which still need to be studied.

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

  1. Spectral statistics of random geometric graphs

    NASA Astrophysics Data System (ADS)

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

    2017-04-01

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

  2. Effect of X-Word Grammar and Traditional Grammar Instruction on Grammatical Accuracy

    ERIC Educational Resources Information Center

    Livingston, Sue; Toce, Andi; Casey, Toce; Montoya, Fernando; Hart, Bonny R.; O'Flaherty, Carmela

    2018-01-01

    This study first briefly describes an instructional approach to teaching grammar known as X-Word Grammar and then compares its effectiveness in assisting students in achieving grammatical accuracy with traditionally taught grammar. Two groups of L2 pre-college students were taught using curricula and practice procedures in two different grammar…

  3. Semantic graphs and associative memories

    NASA Astrophysics Data System (ADS)

    Pomi, Andrés; Mizraji, Eduardo

    2004-12-01

    Graphs have been increasingly utilized in the characterization of complex networks from diverse origins, including different kinds of semantic networks. Human memories are associative and are known to support complex semantic nets; these nets are represented by graphs. However, it is not known how the brain can sustain these semantic graphs. The vision of cognitive brain activities, shown by modern functional imaging techniques, assigns renewed value to classical distributed associative memory models. Here we show that these neural network models, also known as correlation matrix memories, naturally support a graph representation of the stored semantic structure. We demonstrate that the adjacency matrix of this graph of associations is just the memory coded with the standard basis of the concept vector space, and that the spectrum of the graph is a code invariant of the memory. As long as the assumptions of the model remain valid this result provides a practical method to predict and modify the evolution of the cognitive dynamics. Also, it could provide us with a way to comprehend how individual brains that map the external reality, almost surely with different particular vector representations, are nevertheless able to communicate and share a common knowledge of the world. We finish presenting adaptive association graphs, an extension of the model that makes use of the tensor product, which provides a solution to the known problem of branching in semantic nets.

  4. Continuous-time quantum walks on star graphs

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

    Salimi, S.

    2009-06-15

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

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

  6. La Grammaire: Lectures (Grammar: Readings).

    ERIC Educational Resources Information Center

    Arrive, Michel; Chevalier, Jean-Claude

    A historical perspective of French grammar is developed in this chronologically arranged reader. Part One includes material on French grammar from the 16th to the 19th century: (1) the "Premiere Epoque": 1530-1660, (2) the general grammar of Port-Royal, and (3) the "philosophical grammars" treating syntax, sentence structure, and discourse…

  7. Stratificational Grammar.

    ERIC Educational Resources Information Center

    Algeo, John

    1968-01-01

    According to the author, most grammarians have been writing stratificational grammars without knowing it because they have dealt with units that are related to one another, but not simply as a whole to its parts, or as a class to its members. The question, then, is not whether a grammar is stratified but whether it is explicitly stratified. This…

  8. Mungbam Grammar

    ERIC Educational Resources Information Center

    Lovegren, Jesse Stuart James

    2013-01-01

    This dissertation is an attempt to state what is known at present about the grammar of Mungbam (ISO 693-3 [mij]). Mungbam is a Niger-Congo language spoken in the Northwest Region of Cameroon. The dissertation is a descriptive grammar, covering the phonetics, phonology morphology and syntax of the language. Source data are texts and elicited data…

  9. Phonology without universal grammar

    PubMed Central

    Archangeli, Diana; Pulleyblank, Douglas

    2015-01-01

    The question of identifying the properties of language that are specific human linguistic abilities, i.e., Universal Grammar, lies at the center of linguistic research. This paper argues for a largely Emergent Grammar in phonology, taking as the starting point that memory, categorization, attention to frequency, and the creation of symbolic systems are all nonlinguistic characteristics of the human mind. The articulation patterns of American English rhotics illustrate categorization and systems; the distribution of vowels in Bantu vowel harmony uses frequencies of particular sequences to argue against Universal Grammar and in favor of Emergent Grammar; prefix allomorphy in Esimbi illustrates the Emergent symbolic system integrating phonological and morphological generalizations. The Esimbi case has been treated as an example of phonological opacity in a Universal Grammar account; the Emergent analysis resolves the pattern without opacity concerns. PMID:26388791

  10. CUDA Enabled Graph Subset Examiner

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

    Johnston, Jeremy T.

    2016-12-22

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

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

  12. Exploring Hill Ciphers with Graphing Calculators.

    ERIC Educational Resources Information Center

    St. John, Dennis

    1998-01-01

    Explains how to code and decode messages using Hill ciphers which combine matrix multiplication and modular arithmetic. Discusses how a graphing calculator can facilitate the matrix and modular arithmetic used in the coding and decoding procedures. (ASK)

  13. Teaching Grammar and Testing Grammar in the English Primary School: The Impact on Teachers and Their Teaching of the Grammar Element of the Statutory Test in Spelling, Punctuation and Grammar (SPaG)

    ERIC Educational Resources Information Center

    Safford, Kimberly

    2016-01-01

    The research examined the impact on teachers of the grammar element of a new statutory test in Spelling, Punctuation and Grammar (SPaG) in primary schools in England. The research aimed to evaluate the nature and the extent of changes to the teaching of grammar and to wider literacy teaching since the introduction of the test in 2013. The research…

  14. A graph regularized non-negative matrix factorization method for identifying microRNA-disease associations.

    PubMed

    Xiao, Qiu; Luo, Jiawei; Liang, Cheng; Cai, Jie; Ding, Pingjian

    2017-09-01

    MicroRNAs (miRNAs) play crucial roles in post-transcriptional regulations and various cellular processes. The identification of disease-related miRNAs provides great insights into the underlying pathogenesis of diseases at a system level. However, most existing computational approaches are biased towards known miRNA-disease associations, which is inappropriate for those new diseases or miRNAs without any known association information. In this study, we propose a new method with graph regularized non-negative matrix factorization in heterogeneous omics data, called GRNMF, to discover potential associations between miRNAs and diseases, especially for new diseases and miRNAs or those diseases and miRNAs with sparse known associations. First, we integrate the disease semantic information and miRNA functional information to estimate disease similarity and miRNA similarity, respectively. Considering that there is no available interaction observed for new diseases or miRNAs, a preprocessing step is developed to construct the interaction score profiles that will assist in prediction. Next, a graph regularized non-negative matrix factorization framework is utilized to simultaneously identify potential associations for all diseases. The results indicated that our proposed method can effectively prioritize disease-associated miRNAs with higher accuracy compared with other recent approaches. Moreover, case studies also demonstrated the effectiveness of GRNMF to infer unknown miRNA-disease associations for those novel diseases and miRNAs. The code of GRNMF is freely available at https://github.com/XIAO-HN/GRNMF/. Supplementary data are available at Bioinformatics online. © The Author (2017). Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oup.com

  15. The Necessity of Grammar Teaching

    ERIC Educational Resources Information Center

    Wang, Fengjuan

    2010-01-01

    Mastering grammar is the foundation in the proficiency of a language. Grammar teaching is also an essential part of language teaching. However, with the communicative approach was introduced into China, many foreign language teachers gradually make little of grammar teaching. In terms of the theory of linguistics, this paper specifically explores…

  16. Graph characterization via Ihara coefficients.

    PubMed

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

    2011-02-01

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

  17. Teaching Grammar: What Really Works

    ERIC Educational Resources Information Center

    Benjamin, Amy; Berger, Joan

    2010-01-01

    In this book, the authors share procedures for teaching grammar effectively and dynamically, in ways that appeal to students and teachers alike. Ideal for teachers just beginning their work in grammar instruction, this book includes day-by-day units and reproducibles to help them embed grammar lessons into writing instruction. Using visuals,…

  18. Attributed community mining using joint general non-negative matrix factorization with graph Laplacian

    NASA Astrophysics Data System (ADS)

    Chen, Zigang; Li, Lixiang; Peng, Haipeng; Liu, Yuhong; Yang, Yixian

    2018-04-01

    Community mining for complex social networks with link and attribute information plays an important role according to different application needs. In this paper, based on our proposed general non-negative matrix factorization (GNMF) algorithm without dimension matching constraints in our previous work, we propose the joint GNMF with graph Laplacian (LJGNMF) to implement community mining of complex social networks with link and attribute information according to different application needs. Theoretical derivation result shows that the proposed LJGNMF is fully compatible with previous methods of integrating traditional NMF and symmetric NMF. In addition, experimental results show that the proposed LJGNMF can meet the needs of different community minings by adjusting its parameters, and the effect is better than traditional NMF in the community vertices attributes entropy.

  19. A Papago Grammar.

    ERIC Educational Resources Information Center

    Zepeda, Ofelia

    A Papago grammar, intented to help Papago and other junior high, high school and college students learn and appreciate the language and give linguists an overview of the language, contains background information on the language and the book, two grammar units, a unit of five conversations in Papago, and a section of supplementary material. Text…

  20. Graph regularized nonnegative matrix factorization for temporal link prediction in dynamic networks

    NASA Astrophysics Data System (ADS)

    Ma, Xiaoke; Sun, Penggang; Wang, Yu

    2018-04-01

    Many networks derived from society and nature are temporal and incomplete. The temporal link prediction problem in networks is to predict links at time T + 1 based on a given temporal network from time 1 to T, which is essential to important applications. The current algorithms either predict the temporal links by collapsing the dynamic networks or collapsing features derived from each network, which are criticized for ignoring the connection among slices. to overcome the issue, we propose a novel graph regularized nonnegative matrix factorization algorithm (GrNMF) for the temporal link prediction problem without collapsing the dynamic networks. To obtain the feature for each network from 1 to t, GrNMF factorizes the matrix associated with networks by setting the rest networks as regularization, which provides a better way to characterize the topological information of temporal links. Then, the GrNMF algorithm collapses the feature matrices to predict temporal links. Compared with state-of-the-art methods, the proposed algorithm exhibits significantly improved accuracy by avoiding the collapse of temporal networks. Experimental results of a number of artificial and real temporal networks illustrate that the proposed method is not only more accurate but also more robust than state-of-the-art approaches.

  1. Graph reconstruction using covariance-based methods.

    PubMed

    Sulaimanov, Nurgazy; Koeppl, Heinz

    2016-12-01

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

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

    PubMed

    Bae, Juhee; Watson, Ben

    2011-12-01

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

  3. Classification of group behaviors in social media via social behavior grammars

    NASA Astrophysics Data System (ADS)

    Levchuk, Georgiy; Getoor, Lise; Smith, Marc

    2014-06-01

    The increasing use of online collaboration and information sharing in the last decade has resulted in explosion of criminal and anti-social activities in online communities. Detection of such behaviors are of interest to commercial enterprises who want to guard themselves from cyber criminals, and the military intelligence analysts who desire to detect and counteract cyberwars waged by adversarial states and organizations. The most challenging behaviors to detect are those involving multiple individuals who share actions and roles in the hostile activities and individually appear benign. To detect these behaviors, the theories of group behaviors and interactions must be developed. In this paper we describe our exploration of the data from collaborative social platform to categorize the behaviors of multiple individuals. We applied graph matching algorithms to explore consistent social interactions. Our research led us to a conclusion that complex collaborative behaviors can be modeled and detected using a concept of group behavior grammars, in a manner analogous to natural language processing. These grammars capture constraints on how people take on roles in virtual environments, form groups, and interact over time, providing the building blocks for scalable and accurate multi-entity interaction analysis and social behavior hypothesis testing.

  4. A Construction Grammar for the Classroom

    ERIC Educational Resources Information Center

    Holme, Randal

    2010-01-01

    Construction grammars (Lakoff, Women, fire and dangerous things: What categories reveal about the Mind, University of Chicago Press, 1987; Langacker, Foundations of cognitive grammar: Theoretical pre-requisites, Stanford University Press, 1987; Croft, Radical construction grammar: Syntactic theory in typological perspective, Oxford University…

  5. Generalized graph states based on Hadamard matrices

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

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

    2015-07-15

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

  6. Locating sources within a dense sensor array using graph clustering

    NASA Astrophysics Data System (ADS)

    Gerstoft, P.; Riahi, N.

    2017-12-01

    We develop a model-free technique to identify weak sources within dense sensor arrays using graph clustering. No knowledge about the propagation medium is needed except that signal strengths decay to insignificant levels within a scale that is shorter than the aperture. We then reinterpret the spatial coherence matrix of a wave field as a matrix whose support is a connectivity matrix of a graph with sensors as vertices. In a dense network, well-separated sources induce clusters in this graph. The geographic spread of these clusters can serve to localize the sources. The support of the covariance matrix is estimated from limited-time data using a hypothesis test with a robust phase-only coherence test statistic combined with a physical distance criterion. The latter criterion ensures graph sparsity and thus prevents clusters from forming by chance. We verify the approach and quantify its reliability on a simulated dataset. The method is then applied to data from a dense 5200 element geophone array that blanketed of the city of Long Beach (CA). The analysis exposes a helicopter traversing the array and oil production facilities.

  7. ANTLR Tree Grammar Generator and Extensions

    NASA Technical Reports Server (NTRS)

    Craymer, Loring

    2005-01-01

    A computer program implements two extensions of ANTLR (Another Tool for Language Recognition), which is a set of software tools for translating source codes between different computing languages. ANTLR supports predicated- LL(k) lexer and parser grammars, a notation for annotating parser grammars to direct tree construction, and predicated tree grammars. [ LL(k) signifies left-right, leftmost derivation with k tokens of look-ahead, referring to certain characteristics of a grammar.] One of the extensions is a syntax for tree transformations. The other extension is the generation of tree grammars from annotated parser or input tree grammars. These extensions can simplify the process of generating source-to-source language translators and they make possible an approach, called "polyphase parsing," to translation between computing languages. The typical approach to translator development is to identify high-level semantic constructs such as "expressions," "declarations," and "definitions" as fundamental building blocks in the grammar specification used for language recognition. The polyphase approach is to lump ambiguous syntactic constructs during parsing and then disambiguate the alternatives in subsequent tree transformation passes. Polyphase parsing is believed to be useful for generating efficient recognizers for C++ and other languages that, like C++, have significant ambiguities.

  8. Discrimination Power of Polynomial-Based Descriptors for Graphs by Using Functional Matrices.

    PubMed

    Dehmer, Matthias; Emmert-Streib, Frank; Shi, Yongtang; Stefu, Monica; Tripathi, Shailesh

    2015-01-01

    In this paper, we study the discrimination power of graph measures that are based on graph-theoretical matrices. The paper generalizes the work of [M. Dehmer, M. Moosbrugger. Y. Shi, Encoding structural information uniquely with polynomial-based descriptors by employing the Randić matrix, Applied Mathematics and Computation, 268(2015), 164-168]. We demonstrate that by using the new functional matrix approach, exhaustively generated graphs can be discriminated more uniquely than shown in the mentioned previous work.

  9. Modelling dynamics with context-free grammars

    NASA Astrophysics Data System (ADS)

    García-Huerta, Juan-M.; Jiménez-Hernández, Hugo; Herrera-Navarro, Ana-M.; Hernández-Díaz, Teresa; Terol-Villalobos, Ivan

    2014-03-01

    This article presents a strategy to model the dynamics performed by vehicles in a freeway. The proposal consists on encode the movement as a set of finite states. A watershed-based segmentation is used to localize regions with high-probability of motion. Each state represents a proportion of a camera projection in a two-dimensional space, where each state is associated to a symbol, such that any combination of symbols is expressed as a language. Starting from a sequence of symbols through a linear algorithm a free-context grammar is inferred. This grammar represents a hierarchical view of common sequences observed into the scene. Most probable grammar rules express common rules associated to normal movement behavior. Less probable rules express themselves a way to quantify non-common behaviors and they might need more attention. Finally, all sequences of symbols that does not match with the grammar rules, may express itself uncommon behaviors (abnormal). The grammar inference is built with several sequences of images taken from a freeway. Testing process uses the sequence of symbols emitted by the scenario, matching the grammar rules with common freeway behaviors. The process of detect abnormal/normal behaviors is managed as the task of verify if any word generated by the scenario is recognized by the grammar.

  10. The New English Grammar.

    ERIC Educational Resources Information Center

    Thompson, Charles Lamar

    This "new English grammar" textbook blends four systems of grammar: (1) the traditional, providing most of the terminology; (2) the historical, providing the historical background; (3) the structural, providing the sentence patterns; and (4) the transformational, providing the variations of the sentence patterns. The author points out the…

  11. Discrimination Power of Polynomial-Based Descriptors for Graphs by Using Functional Matrices

    PubMed Central

    Dehmer, Matthias; Emmert-Streib, Frank; Shi, Yongtang; Stefu, Monica; Tripathi, Shailesh

    2015-01-01

    In this paper, we study the discrimination power of graph measures that are based on graph-theoretical matrices. The paper generalizes the work of [M. Dehmer, M. Moosbrugger. Y. Shi, Encoding structural information uniquely with polynomial-based descriptors by employing the Randić matrix, Applied Mathematics and Computation, 268(2015), 164–168]. We demonstrate that by using the new functional matrix approach, exhaustively generated graphs can be discriminated more uniquely than shown in the mentioned previous work. PMID:26479495

  12. Community detection enhancement using non-negative matrix factorization with graph regularization

    NASA Astrophysics Data System (ADS)

    Liu, Xiao; Wei, Yi-Ming; Wang, Jian; Wang, Wen-Jun; He, Dong-Xiao; Song, Zhan-Jie

    2016-06-01

    Community detection is a meaningful task in the analysis of complex networks, which has received great concern in various domains. A plethora of exhaustive studies has made great effort and proposed many methods on community detection. Particularly, a kind of attractive one is the two-step method which first makes a preprocessing for the network and then identifies its communities. However, not all types of methods can achieve satisfactory results by using such preprocessing strategy, such as the non-negative matrix factorization (NMF) methods. In this paper, rather than using the above two-step method as most works did, we propose a graph regularized-based model to improve, specialized, the NMF-based methods for the detection of communities, namely NMFGR. In NMFGR, we introduce the similarity metric which contains both the global and local information of networks, to reflect the relationships between two nodes, so as to improve the accuracy of community detection. Experimental results on both artificial and real-world networks demonstrate the superior performance of NMFGR to some competing methods.

  13. Reframing the English Grammar Schools Debate

    ERIC Educational Resources Information Center

    Morris, Rebecca; Perry, Thomas

    2017-01-01

    In October 2015 the Department for Education (DfE) permitted a grammar school in Tonbridge, Kent, to open up an annexe in Sevenoaks, 10 miles away. Amidst claims that the annexe was essentially a new grammar school, the decision reignited an old debate about the value of academically-selective "grammar" schools in England. The intensity…

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

  15. Subspace Clustering via Learning an Adaptive Low-Rank Graph.

    PubMed

    Yin, Ming; Xie, Shengli; Wu, Zongze; Zhang, Yun; Gao, Junbin

    2018-08-01

    By using a sparse representation or low-rank representation of data, the graph-based subspace clustering has recently attracted considerable attention in computer vision, given its capability and efficiency in clustering data. However, the graph weights built using the representation coefficients are not the exact ones as the traditional definition is in a deterministic way. The two steps of representation and clustering are conducted in an independent manner, thus an overall optimal result cannot be guaranteed. Furthermore, it is unclear how the clustering performance will be affected by using this graph. For example, the graph parameters, i.e., the weights on edges, have to be artificially pre-specified while it is very difficult to choose the optimum. To this end, in this paper, a novel subspace clustering via learning an adaptive low-rank graph affinity matrix is proposed, where the affinity matrix and the representation coefficients are learned in a unified framework. As such, the pre-computed graph regularizer is effectively obviated and better performance can be achieved. Experimental results on several famous databases demonstrate that the proposed method performs better against the state-of-the-art approaches, in clustering.

  16. Comments on Skinner's grammar

    PubMed Central

    Mabry, John H.

    1993-01-01

    The strong tradition of “school room” grammars may have had a negative influence on the reception given a functional analysis of verbal behavior, both within and without the field of behavior analysis. Some of the failings of those traditional grammars, and their largely prescriptive nature were outlined through reference to other critics, and conflicting views. Skinner's own treatment of grammatical issues was presented, emphasizing his view of a functional unit and his use of the autoclitic and intraverbal functions to describe alternatives to a formal or structural analysis. Finally, the relevance of stimulus control variables to some recurring questions about verbal behavior and, specifically grammar, were mentioned. PMID:22477082

  17. A new variant of Petri net controlled grammars

    NASA Astrophysics Data System (ADS)

    Jan, Nurhidaya Mohamad; Turaev, Sherzod; Fong, Wan Heng; Sarmin, Nor Haniza

    2015-10-01

    A Petri net controlled grammar is a Petri net with respect to a context-free grammar where the successful derivations of the grammar can be simulated using the occurrence sequences of the net. In this paper, we introduce a new variant of Petri net controlled grammars, called a place-labeled Petri net controlled grammar, which is a context-free grammar equipped with a Petri net and a function which maps places of the net to productions of the grammar. The language consists of all terminal strings that can be obtained by parallelly applying multisets of the rules which are the images of the sets of the input places of transitions in a successful occurrence sequence of the Petri net. We study the effect of the different labeling strategies to the computational power and establish lower and upper bounds for the generative capacity of place-labeled Petri net controlled grammars.

  18. The Philosophical Significance of Universal Grammar

    ERIC Educational Resources Information Center

    Hinzen, Wolfram

    2012-01-01

    Throughout its long history, the project of a science of grammar has always been an inherently philosophical one, in which the study of grammar was taken to have special epistemological significance. I ask why 20th and 21st century inquiry into Universal Grammar (UG) has largely lost this dimension, a fact that I argue is partially responsible for…

  19. Corona graphs as a model of small-world networks

    NASA Astrophysics Data System (ADS)

    Lv, Qian; Yi, Yuhao; Zhang, Zhongzhi

    2015-11-01

    We introduce recursive corona graphs as a model of small-world networks. We investigate analytically the critical characteristics of the model, including order and size, degree distribution, average path length, clustering coefficient, and the number of spanning trees, as well as Kirchhoff index. Furthermore, we study the spectra for the adjacency matrix and the Laplacian matrix for the model. We obtain explicit results for all the quantities of the recursive corona graphs, which are similar to those observed in real-life networks.

  20. Implicit Learning of Recursive Context-Free Grammars

    PubMed Central

    Rohrmeier, Martin; Fu, Qiufang; Dienes, Zoltan

    2012-01-01

    Context-free grammars are fundamental for the description of linguistic syntax. However, most artificial grammar learning experiments have explored learning of simpler finite-state grammars, while studies exploring context-free grammars have not assessed awareness and implicitness. This paper explores the implicit learning of context-free grammars employing features of hierarchical organization, recursive embedding and long-distance dependencies. The grammars also featured the distinction between left- and right-branching structures, as well as between centre- and tail-embedding, both distinctions found in natural languages. People acquired unconscious knowledge of relations between grammatical classes even for dependencies over long distances, in ways that went beyond learning simpler relations (e.g. n-grams) between individual words. The structural distinctions drawn from linguistics also proved important as performance was greater for tail-embedding than centre-embedding structures. The results suggest the plausibility of implicit learning of complex context-free structures, which model some features of natural languages. They support the relevance of artificial grammar learning for probing mechanisms of language learning and challenge existing theories and computational models of implicit learning. PMID:23094021

  1. A Grammar of Belep

    ERIC Educational Resources Information Center

    McCracken, Chelsea Leigh

    2012-01-01

    This dissertation is a description of the grammar of Belep [yly], an Austronesian language variety spoken by about 1600 people in and around the Belep Isles in New Caledonia. The grammar begins with a summary of the cultural and linguistic background of Belep speakers, followed by chapters on Belep phonology and phonetics, morphology and word…

  2. What English Teachers Need to Know about Grammar.

    ERIC Educational Resources Information Center

    Murdick, William

    1996-01-01

    Suggests that English teachers need to know that grammar is a difficult subject; know what children know about grammar; know that grammatical error is complex; and know more about language than just grammar. Concludes with the advice of Noam Chomsky--that grammar should be taught for its own intrinsic interest. (RS)

  3. Pourquoi les exercices de grammaire? (Why Grammar Exercises?)

    ERIC Educational Resources Information Center

    Bastuji, Jacqueline

    1977-01-01

    Recent theories and experiementation running the gamut from the absolute necessity of grammar to its uselessness in teaching a language form the basis of this article. Topics covered are: a typology of the grammar exercise; explicit grammar and linguistic competence; grammar exercises responding to real needs. (Text is in French.) (AMH)

  4. Limited-memory fast gradient descent method for graph regularized nonnegative matrix factorization.

    PubMed

    Guan, Naiyang; Wei, Lei; Luo, Zhigang; Tao, Dacheng

    2013-01-01

    Graph regularized nonnegative matrix factorization (GNMF) decomposes a nonnegative data matrix X[Symbol:see text]R(m x n) to the product of two lower-rank nonnegative factor matrices, i.e.,W[Symbol:see text]R(m x r) and H[Symbol:see text]R(r x n) (r < min {m,n}) and aims to preserve the local geometric structure of the dataset by minimizing squared Euclidean distance or Kullback-Leibler (KL) divergence between X and WH. The multiplicative update rule (MUR) is usually applied to optimize GNMF, but it suffers from the drawback of slow-convergence because it intrinsically advances one step along the rescaled negative gradient direction with a non-optimal step size. Recently, a multiple step-sizes fast gradient descent (MFGD) method has been proposed for optimizing NMF which accelerates MUR by searching the optimal step-size along the rescaled negative gradient direction with Newton's method. However, the computational cost of MFGD is high because 1) the high-dimensional Hessian matrix is dense and costs too much memory; and 2) the Hessian inverse operator and its multiplication with gradient cost too much time. To overcome these deficiencies of MFGD, we propose an efficient limited-memory FGD (L-FGD) method for optimizing GNMF. In particular, we apply the limited-memory BFGS (L-BFGS) method to directly approximate the multiplication of the inverse Hessian and the gradient for searching the optimal step size in MFGD. The preliminary results on real-world datasets show that L-FGD is more efficient than both MFGD and MUR. To evaluate the effectiveness of L-FGD, we validate its clustering performance for optimizing KL-divergence based GNMF on two popular face image datasets including ORL and PIE and two text corpora including Reuters and TDT2. The experimental results confirm the effectiveness of L-FGD by comparing it with the representative GNMF solvers.

  5. Necessity of Grammar Teaching

    ERIC Educational Resources Information Center

    Zhang, Jianyun

    2009-01-01

    Grammar is often misunderstood in the language teaching field. The misconception lies in the view that grammar is a collection of arbitrary rules about static structures in the language. Further questionable claims are that the structures do not have to be thought, learners will acquire them on their own, or if the structures are taught, the…

  6. Signal Processing for Time-Series Functions on a Graph

    DTIC Science & Technology

    2018-02-01

    as filtering to functions supported on graphs. These methods can be applied to scalar functions with a domain that can be described by a fixed...classical signal processing such as filtering to account for the graph domain. This work essentially divides into 2 basic approaches: graph Laplcian...based filtering and weighted adjacency matrix-based filtering . In Shuman et al.,11 and elaborated in Bronstein et al.,13 filtering operators are

  7. Synchronizability of random rectangular graphs

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

    Estrada, Ernesto, E-mail: ernesto.estrada@strath.ac.uk; Chen, Guanrong

    2015-08-15

    Random rectangular graphs (RRGs) represent a generalization of the random geometric graphs in which the nodes are embedded into hyperrectangles instead of on hypercubes. The synchronizability of RRG model is studied. Both upper and lower bounds of the eigenratio of the network Laplacian matrix are determined analytically. It is proven that as the rectangular network is more elongated, the network becomes harder to synchronize. The synchronization processing behavior of a RRG network of chaotic Lorenz system nodes is numerically investigated, showing complete consistence with the theoretical results.

  8. The Grammar Movie Project

    ERIC Educational Resources Information Center

    Kreutner, Edith

    2015-01-01

    In this case study, I will show how directing a movie on grammar can help students improve their oral skills as well as their language competency, team working and planning skills, and also teach them about learning itself. I will present an innovative teaching project that uses the medium of film to get students engaged with grammar and that aims…

  9. A W-Grammar Description for ADA.

    DTIC Science & Technology

    1986-12-01

    7 2. A Type 2 Grammar for Ada Identifiers . . . . . . .... 8 3. The Chomsky erarchy......... ...... 10 4. Some Hypernotions Used in...Ada Language Reference Manual. The Chomsky Hierarchy (4:9-20, 7:217-232). In the 1950s, Noam Chomsky defined five classes of phrase structure grammars ...describing valid language tokens. For example a Type 3 grammar for Ada identifiers is shown in Figure 1. Type 2 Chomsky Languages are the Context-free

  10. Exact numerical calculation of fixation probability and time on graphs.

    PubMed

    Hindersin, Laura; Möller, Marius; Traulsen, Arne; Bauer, Benedikt

    2016-12-01

    The Moran process on graphs is a popular model to study the dynamics of evolution in a spatially structured population. Exact analytical solutions for the fixation probability and time of a new mutant have been found for only a few classes of graphs so far. Simulations are time-expensive and many realizations are necessary, as the variance of the fixation times is high. We present an algorithm that numerically computes these quantities for arbitrary small graphs by an approach based on the transition matrix. The advantage over simulations is that the calculation has to be executed only once. Building the transition matrix is automated by our algorithm. This enables a fast and interactive study of different graph structures and their effect on fixation probability and time. We provide a fast implementation in C with this note (Hindersin et al., 2016). Our code is very flexible, as it can handle two different update mechanisms (Birth-death or death-Birth), as well as arbitrary directed or undirected graphs. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.

  11. Teaching the Topography of Gretel Ehrlich's Grammar.

    ERIC Educational Resources Information Center

    Gessell, Donna A.

    When writing, few students have any concept that word placement affects the content of their writing. They seldom rework their papers at the sentence level in order to assure that their grammar reflects and enhances their content. Recognizing the relationship of grammar to meaning, composition researchers are reasserting the place of grammar in…

  12. Syntactic Functions in Functional Discourse Grammar and Role and Reference Grammar: An Evaluative Comparison

    ERIC Educational Resources Information Center

    Butler, Christopher S.

    2012-01-01

    The aim of this paper is to compare the treatment of syntactic functions, and more particularly those traditionally labelled as Subject and Object, in Functional Discourse Grammar and Role and Reference Grammar. Relevant aspects of the overall structure of the two theories are briefly described. The concept of alignment between levels of the…

  13. Learning English Grammar with a Corpus: Experimenting with Concordancing in a University Grammar Course

    ERIC Educational Resources Information Center

    Vannestal, Maria Estling; Lindquist, Hans

    2007-01-01

    Corpora have been used for pedagogical purposes for more than two decades but empirical studies are relatively rare, particularly in the context of grammar teaching. The present study focuses on students' attitudes towards grammar and how these attitudes are affected by the introduction of concordancing. The principal aims of the project were to…

  14. Paperback Grammar for Handbook Haters.

    ERIC Educational Resources Information Center

    Lambert, Dorothy

    1967-01-01

    Students will respond better to grammar instruction if the traditional heavy handbooks are replaced with light-weight paperbacks, each full of practical suggestions and clear examples. Several inexpensive paperbacks are available for instruction in grammar and usage, spelling, vocabulary, reading comprehension, and writing. Unlike the conventional…

  15. Overcoming the Grammar Deficit: The Role of Information Technology in Teaching German Grammar to Undergraduates.

    ERIC Educational Resources Information Center

    Hall, Christopher

    1998-01-01

    Examines how application of computer-assisted language learning (CALL) and information technology can be used to overcome "grammar deficit" seen in many British undergraduate German students. A combination of explicit, implicit, and exploratory grammar teaching approaches uses diverse resources, including word processing packages,…

  16. Toward the optimization of normalized graph Laplacian.

    PubMed

    Xie, Bo; Wang, Meng; Tao, Dacheng

    2011-04-01

    Normalized graph Laplacian has been widely used in many practical machine learning algorithms, e.g., spectral clustering and semisupervised learning. However, all of them use the Euclidean distance to construct the graph Laplacian, which does not necessarily reflect the inherent distribution of the data. In this brief, we propose a method to directly optimize the normalized graph Laplacian by using pairwise constraints. The learned graph is consistent with equivalence and nonequivalence pairwise relationships, and thus it can better represent similarity between samples. Meanwhile, our approach, unlike metric learning, automatically determines the scale factor during the optimization. The learned normalized Laplacian matrix can be directly applied in spectral clustering and semisupervised learning algorithms. Comprehensive experiments demonstrate the effectiveness of the proposed approach.

  17. On Connected Diagrams and Cumulants of Erdős-Rényi Matrix Models

    NASA Astrophysics Data System (ADS)

    Khorunzhiy, O.

    2008-08-01

    Regarding the adjacency matrices of n-vertex graphs and related graph Laplacian we introduce two families of discrete matrix models constructed both with the help of the Erdős-Rényi ensemble of random graphs. Corresponding matrix sums represent the characteristic functions of the average number of walks and closed walks over the random graph. These sums can be considered as discrete analogues of the matrix integrals of random matrix theory. We study the diagram structure of the cumulant expansions of logarithms of these matrix sums and analyze the limiting expressions as n → ∞ in the cases of constant and vanishing edge probabilities.

  18. Implementation of a Natural Language Processor Using Functional Grammar.

    DTIC Science & Technology

    1985-12-01

    in a completely different manner. [Ref. 5:pp. 81-883 ; "C. CASE GRAMMAR When Chomsky published his Aspects of the Theory of Syntax, 0 many linguists...approach was developed at Stanford University .[Ref. 7:pp. 187-2473 E. FUNCTIONAL GRAMMAR Shortly after Transformational Grammar and Case Grammar ... Grammar is a radical approach to linguistic theory when looked at from the Chomsky point of view. However, it compares favorably with the traditional

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

    PubMed

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

    2017-07-01

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

  20. SPECIFICATION AND UTILIZATION OF A TRANSFORMATIONAL GRAMMAR.

    ERIC Educational Resources Information Center

    LIEBERMAN, D.; AND OTHERS

    SCIENTIFIC REPORT NO. 1 OF THIS PROJECT CONTAINS FOUR PARTS. THE FIRST, BY P. ROSENBAUM AND D. LOCHAK, PRESENTS AND EXPLAINS THE "IBM CORE GRAMMAR OF ENGLISH" AND GIVES A SET OF 66 DERIVATIONS CONSTRUCTED IN TERMS OF THE CORE GRAMMAR. PART II, "DESIGN OF A GRAMMAR TESTER" BY D. LIEBERMAN, SUMMARIZES THE DESIGN CONSIDERATIONS OF…

  1. Creative Grammar and Art Education

    ERIC Educational Resources Information Center

    Cunliffe, Leslie

    2011-01-01

    The grammar of creative practices is described by George Steiner as the "articulate organisation of perception, reflection and experience, the nerve structure of consciousness when it communicates with itself and with others." Steiner's description of creative grammar is consistent with Lev Vygotsky's comment that "art is the social within us, and…

  2. Grammar Making a Comeback in Composition Teaching.

    ERIC Educational Resources Information Center

    McCleary, Bill

    1995-01-01

    This journal article focuses on the return of grammar in composition teaching. After about 2 decades of virtual banishment from the higher reaches of English teaching theory, grammar has returned as a subject of serious discussion. This is the result in part of a new assertiveness by a group of people who never lost interest in grammar as part of…

  3. Have You Considered?--Teaching Grammar.

    ERIC Educational Resources Information Center

    Rutan, Jessica

    2003-01-01

    Provides examples of a journey the author has recently experienced to consider if understanding the rules of grammar impact how a struggling adolescent reads. Suggests that the study of grammar will help her students become better users of the language. Notes that they will become effective listeners and speakers, but more importantly proficient…

  4. Efficient Grammar Induction Algorithm with Parse Forests from Real Corpora

    NASA Astrophysics Data System (ADS)

    Kurihara, Kenichi; Kameya, Yoshitaka; Sato, Taisuke

    The task of inducing grammar structures has received a great deal of attention. The reasons why researchers have studied are different; to use grammar induction as the first stage in building large treebanks or to make up better language models. However, grammar induction has inherent computational complexity. To overcome it, some grammar induction algorithms add new production rules incrementally. They refine the grammar while keeping their computational complexity low. In this paper, we propose a new efficient grammar induction algorithm. Although our algorithm is similar to algorithms which learn a grammar incrementally, our algorithm uses the graphical EM algorithm instead of the Inside-Outside algorithm. We report results of learning experiments in terms of learning speeds. The results show that our algorithm learns a grammar in constant time regardless of the size of the grammar. Since our algorithm decreases syntactic ambiguities in each step, our algorithm reduces required time for learning. This constant-time learning considerably affects learning time for larger grammars. We also reports results of evaluation of criteria to choose nonterminals. Our algorithm refines a grammar based on a nonterminal in each step. Since there can be several criteria to decide which nonterminal is the best, we evaluate them by learning experiments.

  5. Flexible processing and the design of grammar.

    PubMed

    Sag, Ivan A; Wasow, Thomas

    2015-02-01

    We explore the consequences of letting the incremental and integrative nature of language processing inform the design of competence grammar. What emerges is a view of grammar as a system of local monotonic constraints that provide a direct characterization of the signs (the form-meaning correspondences) of a given language. This "sign-based" conception of grammar has provided precise solutions to the key problems long thought to motivate movement-based analyses, has supported three decades of computational research developing large-scale grammar implementations, and is now beginning to play a role in computational psycholinguistics research that explores the use of underspecification in the incremental computation of partial meanings.

  6. A GRAMMAR OF SPOKEN CHINESE.

    ERIC Educational Resources Information Center

    CHAO, YUEN REN

    THE AUTHOR OF THIS GRAMMAR STATES THAT THIS IS A "DISCUSSION BOOK" AND NOT AN INSTRUCTION BOOK FOR LEARNING CHINESE. HIS ANALYSIS OF CHINESE GRAMMAR IS BASED ON CURRENT LINGUISTIC METHODS AND ASSUMES THE READER HAS SOME KNOWLEDGE OF LINGUISTICS. THIS BOOK CONSTITUTES A REFERENCE WORK FOR LINGUISTS AND STUDENTS OF THE CHINESE LANGUAGE. MAJOR…

  7. A Reference Grammar of Bena

    ERIC Educational Resources Information Center

    Morrison, Michelle Elizabeth

    2011-01-01

    This dissertation is a grammar of Rena (ISO bez), a Bantu language spoken in southwestern Tanzania by approximately 600,000 people. Bena is largely undocumented, and though aspects of Bena grammar have been described, there is no usable, detailed treatment of the Bena language. Therefore the goal of this dissertation is provide the first detailed…

  8. Teachers' Perceptions about Grammar Teaching

    ERIC Educational Resources Information Center

    Thu, Tran Hoang

    2009-01-01

    This study investigates English as a second language (ESL) teachers' beliefs in grammar teaching. A 32-item questionnaire was administered to 11 ESL teachers in a language school in California. The results show that the participants generally believe that the formal study of grammar is essential to the eventual mastery of a foreign or second…

  9. A Bemba Grammar with Exercises.

    ERIC Educational Resources Information Center

    Hoch, Ernst

    This Bemba grammar begins with an introduction which traces the history of the language, stresses the importance of learning it well and offers hints towards achieving this goal. The grammar itself is divided into three major sections: Part 1, "Phonetics," deals with the Bemba alphabet, tonality, and orthography; Part 2, "Parts of Speech,"…

  10. English Grammar in School Textbooks: A Critical Survey.

    ERIC Educational Resources Information Center

    Collis, Peter; Hollo, Carmella; Mar, Juliet

    1997-01-01

    Reports findings from a critical analysis of English grammar books and language books with grammar content used in New South Wales (Australia) elementary and secondary schools. Books surveyed showed a low level of awareness of developments in contemporary linguistics, particularly the structural approach to grammar instruction. (Author/MSE)

  11. Foreign-Language Grammar Instruction via the Mother Tongue

    ERIC Educational Resources Information Center

    Paradowski, Michal B.

    2007-01-01

    The chapter reports the results of a controlled experiment which suggest that foreign-language grammar instruction that forges explicit connections with the grammar of the students' mother tongue aids learning, at least as far as students' application of discrete-point grammar rules is concerned. (Contains 2 figures and 3 notes.) [This document…

  12. Pupils' Word Choices and the Teaching of Grammar

    ERIC Educational Resources Information Center

    Wyse, Dominic

    2006-01-01

    The idea that formal grammar teaching leads to improvements in school pupils' writing has been a popular one. However, the robust and extensive evidence base shows that this is not the case. Despite this, policy initiatives have continued to suggest that grammar teaching does improve pupils' writing: the "Grammar for Writing" resource is…

  13. On the Form of a Systemic Grammar

    ERIC Educational Resources Information Center

    McCord, Michael C.

    1975-01-01

    This paper concerns the theory of systemic grammar developed by Halliday, Hudson and others. It suggests modifications of Hudson's generative version, and the model presented resembles transformational grammar. (CHK)

  14. Fibonacci Identities, Matrices, and Graphs

    ERIC Educational Resources Information Center

    Huang, Danrun

    2005-01-01

    General strategies used to help discover, prove, and generalize identities for Fibonacci numbers are described along with some properties about the determinants of square matrices. A matrix proof for identity (2) that has received immense attention from many branches of mathematics, like linear algebra, dynamical systems, graph theory and others…

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

  16. Experimental Study of Quantum Graphs with Microwave Networks

    NASA Astrophysics Data System (ADS)

    Fu, Ziyuan; Koch, Trystan; Antonsen, Thomas; Ott, Edward; Anlage, Steven; Wave Chaos Team

    An experimental setup consisting of microwave networks is used to simulate quantum graphs. The networks are constructed from coaxial cables connected by T junctions. The networks are built for operation both at room temperature and superconducting versions that operate at cryogenic temperatures. In the experiments, a phase shifter is connected to one of the network bonds to generate an ensemble of quantum graphs by varying the phase delay. The eigenvalue spectrum is found from S-parameter measurements on one-port graphs. With the experimental data, the nearest-neighbor spacing statistics and the impedance statistics of the graphs are examined. It is also demonstrated that time-reversal invariance for microwave propagation in the graphs can be broken without increasing dissipation significantly by making nodes with circulators. Random matrix theory (RMT) successfully describes universal statistical properties of the system. We acknowledge support under contract AFOSR COE Grant FA9550-15-1-0171.

  17. A Positive Approach to Good Grammar

    ERIC Educational Resources Information Center

    Kuehner, Alison V.

    2016-01-01

    Correct grammar is important for precise, accurate, academic prose, but the traditional skills-based approach to teaching grammar is not effective if the goal is good writing. The sentence-combining approach shows promise. However, sentence modeling is more likely to produce strong writing and enhance reading comprehension. Through sentence…

  18. Second Language Acquisition and Universal Grammar.

    ERIC Educational Resources Information Center

    White, Lydia

    1990-01-01

    Discusses the motivation for Universal Grammar (UG), as assumed in the principles and parameters framework of generative grammar (Chomsky, 1981), focusing on the logical problem of first-language acquisition and the potential role of UG in second-language acquisition. Recent experimental research regarding the second-language status of the…

  19. Two-Dimensional Grammars And Their Applications To Artificial Intelligence

    NASA Astrophysics Data System (ADS)

    Lee, Edward T.

    1987-05-01

    During the past several years, the concepts and techniques of two-dimensional grammars1,2 have attracted growing attention as promising avenues of approach to problems in picture generation as well as in picture description3 representation, recognition, transformation and manipulation. Two-dimensional grammar techniques serve the purpose of exploiting the structure or underlying relationships in a picture. This approach attempts to describe a complex picture in terms of their components and their relative positions. This resembles the way a sentence is described in terms of its words and phrases, and the terms structural picture recognition, linguistic picture recognition, or syntactic picture recognition are often used. By using this approach, the problem of picture recognition becomes similar to that of phrase recognition in a language. However, describing pictures using a string grammar (one-dimensional grammar), the only relation between sub-pictures and/or primitives is the concatenation; that is each picture or primitive can be connected only at the left or right. This one-dimensional relation has not been very effective in describing two-dimensional pictures. A natural generaliza-tion is to use two-dimensional grammars. In this paper, two-dimensional grammars and their applications to artificial intelligence are presented. Picture grammars and two-dimensional grammars are introduced and illustrated by examples. In particular, two-dimensional grammars for generating all possible squares and all possible rhombuses are presented. The applications of two-dimensional grammars to solving region filling problems are discussed. An algorithm for region filling using two-dimensional grammars is presented together with illustrative examples. The advantages of using this algorithm in terms of computation time are also stated. A high-level description of a two-level picture generation system is proposed. The first level is the picture primitive generation using two

  20. Dynamic graph of an oxy-fuel combustion system using autocatalytic set model

    NASA Astrophysics Data System (ADS)

    Harish, Noor Ainy; Bakar, Sumarni Abu

    2017-08-01

    Evaporation process is one of the main processes besides combustion process in an oxy-combustion boiler system. An Autocatalytic Set (ASC) Model has successfully applied in developing graphical representation of the chemical reactions that occurs in the evaporation process in the system. Seventeen variables identified in the process are represented as nodes and the catalytic relationships are represented as edges in the graph. In addition, in this paper graph dynamics of ACS is further investigated. By using Dynamic Autocatalytic Set Graph Algorithm (DAGA), the adjacency matrix for each of the graphs and its relations to Perron-Frobenius Theorem is investigated. The dynamic graph obtained is further investigated where the connection of the graph to fuzzy graph Type 1 is established.

  1. Grammar-Guided Writing for AAC Users

    ERIC Educational Resources Information Center

    Hunnicutt, Sheri; Magnuson, Tina

    2007-01-01

    A method of grammar-guided writing has been devised to guide graphic sign users through the construction of text messages for use in e-mail and other applications with a remote receiver. The purpose is to promote morphologically and syntactically correct sentences. The available grammatical structures in grammar-guided writing are the highest…

  2. Grammar as a Programming Language. Artificial Intelligence Memo 391.

    ERIC Educational Resources Information Center

    Rowe, Neil

    Student projects that involve writing generative grammars in the computer language, "LOGO," are described in this paper, which presents a grammar-running control structure that allows students to modify and improve the grammar interpreter itself while learning how a simple kind of computer parser works. Included are procedures for…

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

  4. Propelling Students into Active Grammar Participation

    ERIC Educational Resources Information Center

    Jurhill, Dennis A.

    2011-01-01

    "O! this learning, what a thing it is." -W. Shakespeare, "The Taming of the Shrew." The aim of this action research was to find out if active grammar involvement amongst students might lead to better results. My approach was to activate my students during grammar instruction by using cooperative learning: that is a form of…

  5. The Construction of Semantic Memory: Grammar-Based Representations Learned from Relational Episodic Information

    PubMed Central

    Battaglia, Francesco P.; Pennartz, Cyriel M. A.

    2011-01-01

    After acquisition, memories underlie a process of consolidation, making them more resistant to interference and brain injury. Memory consolidation involves systems-level interactions, most importantly between the hippocampus and associated structures, which takes part in the initial encoding of memory, and the neocortex, which supports long-term storage. This dichotomy parallels the contrast between episodic memory (tied to the hippocampal formation), collecting an autobiographical stream of experiences, and semantic memory, a repertoire of facts and statistical regularities about the world, involving the neocortex at large. Experimental evidence points to a gradual transformation of memories, following encoding, from an episodic to a semantic character. This may require an exchange of information between different memory modules during inactive periods. We propose a theory for such interactions and for the formation of semantic memory, in which episodic memory is encoded as relational data. Semantic memory is modeled as a modified stochastic grammar, which learns to parse episodic configurations expressed as an association matrix. The grammar produces tree-like representations of episodes, describing the relationships between its main constituents at multiple levels of categorization, based on its current knowledge of world regularities. These regularities are learned by the grammar from episodic memory information, through an expectation-maximization procedure, analogous to the inside–outside algorithm for stochastic context-free grammars. We propose that a Monte-Carlo sampling version of this algorithm can be mapped on the dynamics of “sleep replay” of previously acquired information in the hippocampus and neocortex. We propose that the model can reproduce several properties of semantic memory such as decontextualization, top-down processing, and creation of schemata. PMID:21887143

  6. Student Teacher Beliefs on Grammar Instruction

    ERIC Educational Resources Information Center

    Graus, Johan; Coppen, Peter-Arno

    2016-01-01

    The role of grammar teaching in foreign language education is a controversial one both in second language acquisition (SLA) research and language pedagogy and, as a result, a potential source of confusion to student teachers. The objective of this study was to gain insight into the beliefs on grammar teaching of student teachers of English as a…

  7. Something Old, Something New--An Eclectic Grammar for Learning.

    ERIC Educational Resources Information Center

    O'Donnell, Roy C.

    Formal grammar study is important in schools above the elementary level because it can lead to improved understanding of the nature and functions of language. Although newer grammars, based on structural linguistics and transformational-generative grammar, have not met the needs of the schools, their potential should not be ignored with a return…

  8. Application of grammar-based codes for lossless compression of digital mammograms

    NASA Astrophysics Data System (ADS)

    Li, Xiaoli; Krishnan, Srithar; Ma, Ngok-Wah

    2006-01-01

    A newly developed grammar-based lossless source coding theory and its implementation was proposed in 1999 and 2000, respectively, by Yang and Kieffer. The code first transforms the original data sequence into an irreducible context-free grammar, which is then compressed using arithmetic coding. In the study of grammar-based coding for mammography applications, we encountered two issues: processing time and limited number of single-character grammar G variables. For the first issue, we discover a feature that can simplify the matching subsequence search in the irreducible grammar transform process. Using this discovery, an extended grammar code technique is proposed and the processing time of the grammar code can be significantly reduced. For the second issue, we propose to use double-character symbols to increase the number of grammar variables. Under the condition that all the G variables have the same probability of being used, our analysis shows that the double- and single-character approaches have the same compression rates. By using the methods proposed, we show that the grammar code can outperform three other schemes: Lempel-Ziv-Welch (LZW), arithmetic, and Huffman on compression ratio, and has similar error tolerance capabilities as LZW coding under similar circumstances.

  9. Holistic Grammar.

    ERIC Educational Resources Information Center

    Pierstorff, Don K.

    1981-01-01

    Parodies holistic approaches to education. Explains an educational approach which simultaneously teaches grammar and arithmetic. Lauds the advantages of the approach as high student attrition, ease of grading, and focus on developing the reptilian portion of the brain. Points out common errors made by students. (AYC)

  10. Understanding the Complex Processes in Developing Student Teachers' Knowledge about Grammar

    ERIC Educational Resources Information Center

    Svalberg, Agneta M.-L.

    2015-01-01

    This article takes the view that grammar is driven by user choices and is therefore complex and dynamic. This has implications for the teaching of grammar in language teacher education and how teachers' cognitions about grammar, and hence their own grammar teaching, might change. In this small, interpretative study, the participants--students on…

  11. Evolutionary graph theory: breaking the symmetry between interaction and replacement

    PubMed Central

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

    2008-01-01

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

  12. An Exploration of the Relationship between Vietnamese Students' Knowledge of L1 Grammar and Their English Grammar Proficiency

    ERIC Educational Resources Information Center

    Tran, Tammie M.

    2010-01-01

    The problem. This research study explores an important issue in the field of TESOL (Teaching English to Speakers of Other Languages) and second language acquisition (SLA). Its purpose is to examine the relationship between Vietnamese students' L1 grammar knowledge and their English grammar proficiency. Furthermore, it investigates the extent to…

  13. An Overview of the Nigel Text Generation Grammar.

    DTIC Science & Technology

    1983-04-01

    34 76b, Hudson 76, Halliday 81, de Joia 80, Fawcett 80].3 1.2. Design Goals for the Grammar Three kinds of goals have guided the work of creating Nigel...Davey 79] Davey, A., Discourse Production, Edinburgh University Press, Edinburgh, 1979. [ de Joia 80] de Joia , A., and A. Stenton, Terms in Systemic...1 1.1. The Text Generation Task as a Stimulus for Grammar Design .........................1I -1.2. Design Goals for the Grammar

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

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

  16. Inference for Transition Network Grammars,

    DTIC Science & Technology

    1976-01-01

    If the arc Is followed. language L(G) is said to be structurally complete if The power of an augmented transition network (Am) is each rewriting rule ...Clearly, a context-sensitive grammar can be represented as a context—free grarmar plus a set of transformationDbbbbb Eabbbbbb Dbb~~bb Ebbbbbb rules ...are the foun— as a CFG (base) and a set of transformationa l rules . datIons of grammars of different complexities. The The CSL Is obtained by appl

  17. Speech-Enabled Interfaces for Travel Information Systems with Large Grammars

    NASA Astrophysics Data System (ADS)

    Zhao, Baoli; Allen, Tony; Bargiela, Andrzej

    This paper introduces three grammar-segmentation methods capable of handling the large grammar issues associated with producing a real-time speech-enabled VXML bus travel application for London. Large grammars tend to produce relatively slow recognition interfaces and this work shows how this limitation can be successfully addressed. Comparative experimental results show that the novel last-word recognition based grammar segmentation method described here achieves an optimal balance between recognition rate, speed of processing and naturalness of interaction.

  18. Generalized Categorial Grammar for Unbounded Dependencies Recovery

    ERIC Educational Resources Information Center

    Nguyen, Luan Viet

    2014-01-01

    Accurate recovery of predicate-argument dependencies is vital for interpretation tasks like information extraction and question answering, and unbounded dependencies may account for a significant portion of the dependencies in any given text. This thesis describes a Generalized Categorial Grammar (GCG) which, like other categorial grammars,…

  19. Pratiquer une grammaire textuelle (Practicing Textual Grammar).

    ERIC Educational Resources Information Center

    Bourdet, Jean-Francois

    1992-01-01

    A discussion of textual, as contrasted with traditional, grammar for French second-language instruction argues that textual grammar is essential for acquisition of communicative competence because it identifies grammatical facts relevant to everyday communication and allows the student to experience the construction of meaning through them. (MSE)

  20. Measuring strategic control in artificial grammar learning.

    PubMed

    Norman, Elisabeth; Price, Mark C; Jones, Emma

    2011-12-01

    In response to concerns with existing procedures for measuring strategic control over implicit knowledge in artificial grammar learning (AGL), we introduce a more stringent measurement procedure. After two separate training blocks which each consisted of letter strings derived from a different grammar, participants either judged the grammaticality of novel letter strings with respect to only one of these two grammars (pure-block condition), or had the target grammar varying randomly from trial to trial (novel mixed-block condition) which required a higher degree of conscious flexible control. Random variation in the colour and font of letters was introduced to disguise the nature of the rule and reduce explicit learning. Strategic control was observed both in the pure-block and mixed-block conditions, and even among participants who did not realise the rule was based on letter identity. This indicated detailed strategic control in the absence of explicit learning. Copyright © 2011 Elsevier Inc. All rights reserved.

  1. Efficient dynamic graph construction for inductive semi-supervised learning.

    PubMed

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

    2017-10-01

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

  2. Exploring Dyslexics' Phonological Deficit II: Phonological Grammar

    ERIC Educational Resources Information Center

    Szenkovits, Gayaneh; Darma, Quynliaan; Darcy, Isabelle; Ramus, Franck

    2016-01-01

    Language learners have to acquire the phonological grammar of their native language, and different levels of representations on which the grammar operates. Developmental dyslexia is associated with a phonological deficit, which is commonly assumed to stem from degraded phonological representations. The present study investigates one aspect of the…

  3. Research into Practice: Grammar Learning and Teaching

    ERIC Educational Resources Information Center

    Larsen-Freeman, Diane

    2015-01-01

    This selective review of the second language acquisition and applied linguistics research literature on grammar learning and teaching falls into three categories: where research has had little impact (the non-interface position), modest impact (form-focused instruction), and where it potentially can have a large impact (reconceiving grammar).…

  4. Graph distance for complex networks

    NASA Astrophysics Data System (ADS)

    Shimada, Yutaka; Hirata, Yoshito; Ikeguchi, Tohru; Aihara, Kazuyuki

    2016-10-01

    Networks are widely used as a tool for describing diverse real complex systems and have been successfully applied to many fields. The distance between networks is one of the most fundamental concepts for properly classifying real networks, detecting temporal changes in network structures, and effectively predicting their temporal evolution. However, this distance has rarely been discussed in the theory of complex networks. Here, we propose a graph distance between networks based on a Laplacian matrix that reflects the structural and dynamical properties of networked dynamical systems. Our results indicate that the Laplacian-based graph distance effectively quantifies the structural difference between complex networks. We further show that our approach successfully elucidates the temporal properties underlying temporal networks observed in the context of face-to-face human interactions.

  5. Eigenvalues of the Laplacian of a graph

    NASA Technical Reports Server (NTRS)

    Anderson, W. N., Jr.; Morley, T. D.

    1971-01-01

    Let G be a finite undirected graph with no loops or multiple edges. The Laplacian matrix of G, Delta(G), is defined by Delta sub ii = degree of vertex i and Delta sub ij = -1 if there is an edge between vertex i and vertex j. The structure of the graph G is related to the eigenvalues of Delta(G); in particular, it is proved that all the eigenvalues of Delta(G) are nonnegative, less than or equal to the number of vertices, and less than or equal to twice the maximum vertex degree. Precise conditions for equality are given.

  6. Flexible Processing and the Design of Grammar

    ERIC Educational Resources Information Center

    Sag, Ivan A.; Wasow, Thomas

    2015-01-01

    We explore the consequences of letting the incremental and integrative nature of language processing inform the design of competence grammar. What emerges is a view of grammar as a system of local monotonic constraints that provide a direct characterization of the signs (the form-meaning correspondences) of a given language. This…

  7. Reading and Grammar Learning through Mobile Phones

    ERIC Educational Resources Information Center

    Wang, Shudong; Smith, Simon

    2013-01-01

    This paper describes an ongoing language-learning project, three years into its development. We examine both the feasibility and the limitations of developing English reading and grammar skills through the interface of mobile phones. Throughout the project, reading and grammar materials were regularly sent to students' mobile phones. Students read…

  8. Theoretical Bound of CRLB for Energy Efficient Technique of RSS-Based Factor Graph Geolocation

    NASA Astrophysics Data System (ADS)

    Kahar Aziz, Muhammad Reza; Heriansyah; Saputra, EfaMaydhona; Musa, Ardiansyah

    2018-03-01

    To support the increase of wireless geolocation development as the key of the technology in the future, this paper proposes theoretical bound derivation, i.e., Cramer Rao lower bound (CRLB) for energy efficient of received signal strength (RSS)-based factor graph wireless geolocation technique. The theoretical bound derivation is crucially important to evaluate whether the energy efficient technique of RSS-based factor graph wireless geolocation is effective as well as to open the opportunity to further innovation of the technique. The CRLB is derived in this paper by using the Fisher information matrix (FIM) of the main formula of the RSS-based factor graph geolocation technique, which is lied on the Jacobian matrix. The simulation result shows that the derived CRLB has the highest accuracy as a bound shown by its lowest root mean squared error (RMSE) curve compared to the RMSE curve of the RSS-based factor graph geolocation technique. Hence, the derived CRLB becomes the lower bound for the efficient technique of RSS-based factor graph wireless geolocation.

  9. The Role of Simple Semantics in the Process of Artificial Grammar Learning.

    PubMed

    Öttl, Birgit; Jäger, Gerhard; Kaup, Barbara

    2017-10-01

    This study investigated the effect of semantic information on artificial grammar learning (AGL). Recursive grammars of different complexity levels (regular language, mirror language, copy language) were investigated in a series of AGL experiments. In the with-semantics condition, participants acquired semantic information prior to the AGL experiment; in the without-semantics control condition, participants did not receive semantic information. It was hypothesized that semantics would generally facilitate grammar acquisition and that the learning benefit in the with-semantics conditions would increase with increasing grammar complexity. Experiment 1 showed learning effects for all grammars but no performance difference between conditions. Experiment 2 replicated the absence of a semantic benefit for all grammars even though semantic information was more prominent during grammar acquisition as compared to Experiment 1. Thus, we did not find evidence for the idea that semantics facilitates grammar acquisition, which seems to support the view of an independent syntactic processing component.

  10. Language Practice with Multimedia Supported Web-Based Grammar Revision Material

    ERIC Educational Resources Information Center

    Baturay, Meltem Huri; Daloglu, Aysegul; Yildirim, Soner

    2010-01-01

    The aim of this study was to investigate the perceptions of elementary-level English language learners towards web-based, multimedia-annotated grammar learning. WEBGRAM, a system designed to provide supplementary web-based grammar revision material, uses audio-visual aids to enrich the contextual presentation of grammar and allows learners to…

  11. GRAMMAR--THE PROTEUS OF THE ENGLISH CURRICULUM.

    ERIC Educational Resources Information Center

    ASTON, KATHARINE O.

    THE ENGLISH CURRICULUM CAN BE MADE MORE EFFECTIVE BY CONSIDERING THE SIGNIFICANT PART PLAYED BY THE COMPONENT OF GRAMMAR. THE NATIVE SPEAKER OF ENGLISH POSSESSES AN INTUITIVE KNOWLEDGE OF THE RULES OF GRAMMAR AND YET CANNOT EXPLAIN WHAT HIS INTUITION KNOWS. THEREFORE, A PRECISE, ECONOMICAL DESCRIPTION OF THE LANGUAGE MECHANISM AND HOW IT FUNCTIONS…

  12. Quel Eclectisme en grammaire? (What Eclecticism in Grammar?)

    ERIC Educational Resources Information Center

    Beacco, Jean-Claude

    1987-01-01

    The teaching of grammar provides more options for teacher strategies than almost any other area of language teaching, but because of the nature of grammar and classroom language instruction, using a variety of approaches is a more appropriate strategy. (MSE)

  13. Chamorro Reference Grammar. Pali Language Texts: Micronesia.

    ERIC Educational Resources Information Center

    Topping, Donald M.; Dungca, Bernadita C.

    This detailed reference grammar of Chamorro, the native Malayo-Polynesian language spoken in Guam and the other Mariana Islands (Saipan, Rota, Tinian), differs from earlier grammars of the language in that: (1) it includes new data; (2) it offers a different interpretation of some of the data based on more recent linguistic concepts; and (3) it is…

  14. Video Game Based Learning in English Grammar

    ERIC Educational Resources Information Center

    Singaravelu, G.

    2008-01-01

    The study enlightens the effectiveness of Video Game Based Learning in English Grammar at standard VI. A Video Game package was prepared and it consisted of self-learning activities in play way manner which attracted the minds of the young learners. Chief objective: Find out the effectiveness of Video-Game based learning in English grammar.…

  15. On the Equivalence of Formal Grammars and Machines.

    ERIC Educational Resources Information Center

    Lund, Bruce

    1991-01-01

    Explores concepts of formal language and automata theory underlying computational linguistics. A computational formalism is described known as a "logic grammar," with which computational systems process linguistic data, with examples in declarative and procedural semantics and definite clause grammars. (13 references) (CB)

  16. Indirect Positive Evidence in the Acquisition of a Subset Grammar

    ERIC Educational Resources Information Center

    Schwartz, Misha; Goad, Heather

    2017-01-01

    This article proposes that second language learners can use indirect positive evidence (IPE) to acquire a phonological grammar that is a subset of their L1 grammar. IPE is evidence from errors in the learner's L1 made by native speakers of the learner's L2. It has been assumed that subset grammars may be acquired using direct or indirect negative…

  17. What Is Grammar and Why Teach It?

    ERIC Educational Resources Information Center

    Greenbaum, Sidney

    The word "grammar" can be used in many ways: a general theory of language description; a theory for describing one language; a description of a particular language, either in the form of a book (an "English grammar") or the contents of that book; an ideal as opposed to actual description of a language; the properties and processes of a language…

  18. Reproducibility of graph metrics of human brain structural networks.

    PubMed

    Duda, Jeffrey T; Cook, Philip A; Gee, James C

    2014-01-01

    Recent interest in human brain connectivity has led to the application of graph theoretical analysis to human brain structural networks, in particular white matter connectivity inferred from diffusion imaging and fiber tractography. While these methods have been used to study a variety of patient populations, there has been less examination of the reproducibility of these methods. A number of tractography algorithms exist and many of these are known to be sensitive to user-selected parameters. The methods used to derive a connectivity matrix from fiber tractography output may also influence the resulting graph metrics. Here we examine how these algorithm and parameter choices influence the reproducibility of proposed graph metrics on a publicly available test-retest dataset consisting of 21 healthy adults. The dice coefficient is used to examine topological similarity of constant density subgraphs both within and between subjects. Seven graph metrics are examined here: mean clustering coefficient, characteristic path length, largest connected component size, assortativity, global efficiency, local efficiency, and rich club coefficient. The reproducibility of these network summary measures is examined using the intraclass correlation coefficient (ICC). Graph curves are created by treating the graph metrics as functions of a parameter such as graph density. Functional data analysis techniques are used to examine differences in graph measures that result from the choice of fiber tracking algorithm. The graph metrics consistently showed good levels of reproducibility as measured with ICC, with the exception of some instability at low graph density levels. The global and local efficiency measures were the most robust to the choice of fiber tracking algorithm.

  19. Defense et illustration de la grammaire philologique (An Example and a Defense of Philological Grammar)

    ERIC Educational Resources Information Center

    Dupont, Louis

    1972-01-01

    Author cites philological grammar" as one of three ways of treating language. The other two approaches to language are traditional grammar and linguistic grammar or transformational generative grammar. Philological grammar stresses the art of reading. (DS)

  20. Template construction grammar: from visual scene description to language comprehension and agrammatism.

    PubMed

    Barrès, Victor; Lee, Jinyong

    2014-01-01

    How does the language system coordinate with our visual system to yield flexible integration of linguistic, perceptual, and world-knowledge information when we communicate about the world we perceive? Schema theory is a computational framework that allows the simulation of perceptuo-motor coordination programs on the basis of known brain operating principles such as cooperative computation and distributed processing. We present first its application to a model of language production, SemRep/TCG, which combines a semantic representation of visual scenes (SemRep) with Template Construction Grammar (TCG) as a means to generate verbal descriptions of a scene from its associated SemRep graph. SemRep/TCG combines the neurocomputational framework of schema theory with the representational format of construction grammar in a model linking eye-tracking data to visual scene descriptions. We then offer a conceptual extension of TCG to include language comprehension and address data on the role of both world knowledge and grammatical semantics in the comprehension performances of agrammatic aphasic patients. This extension introduces a distinction between heavy and light semantics. The TCG model of language comprehension offers a computational framework to quantitatively analyze the distributed dynamics of language processes, focusing on the interactions between grammatical, world knowledge, and visual information. In particular, it reveals interesting implications for the understanding of the various patterns of comprehension performances of agrammatic aphasics measured using sentence-picture matching tasks. This new step in the life cycle of the model serves as a basis for exploring the specific challenges that neurolinguistic computational modeling poses to the neuroinformatics community.

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

  2. Weighted graph based ordering techniques for preconditioned conjugate gradient methods

    NASA Technical Reports Server (NTRS)

    Clift, Simon S.; Tang, Wei-Pai

    1994-01-01

    We describe the basis of a matrix ordering heuristic for improving the incomplete factorization used in preconditioned conjugate gradient techniques applied to anisotropic PDE's. Several new matrix ordering techniques, derived from well-known algorithms in combinatorial graph theory, which attempt to implement this heuristic, are described. These ordering techniques are tested against a number of matrices arising from linear anisotropic PDE's, and compared with other matrix ordering techniques. A variation of RCM is shown to generally improve the quality of incomplete factorization preconditioners.

  3. Nigel: A Systemic Grammar for Text Generation.

    DTIC Science & Technology

    1983-02-01

    presumed. Basic references on the systemic framework include [Berry 75, Berry 77, Halliday 76a, Halliday 76b, Hudson 76, Halliday 81, de Joia 80...Edinburgh, 1979. [do Joia 80] de Joia , A., and A. Stanton, Terms in Systemic Linguistics, Batsford Academic and Educational, Ltd., London, 1980. -’C...1 A Grammar for Text Generation- -The Challenge ................................. 1 *1.2 A Grammar for Text Generation--The Design

  4. A Grammar of Northern Mao (Mawes Aas'e)

    ERIC Educational Resources Information Center

    Ahland, Michael Bryan

    2012-01-01

    Northern Mao is an endangered Afroasiatic-Omotic language of western Ethiopia with fewer than 5,000 speakers. This study is a comprehensive grammar of the language, written from a functional/typological perspective which embraces historical change as an explanation for synchronic structure. The grammar introduces the Northern Mao people, aspects…

  5. The minimalist grammar of action

    PubMed Central

    Pastra, Katerina; Aloimonos, Yiannis

    2012-01-01

    Language and action have been found to share a common neural basis and in particular a common ‘syntax’, an analogous hierarchical and compositional organization. While language structure analysis has led to the formulation of different grammatical formalisms and associated discriminative or generative computational models, the structure of action is still elusive and so are the related computational models. However, structuring action has important implications on action learning and generalization, in both human cognition research and computation. In this study, we present a biologically inspired generative grammar of action, which employs the structure-building operations and principles of Chomsky's Minimalist Programme as a reference model. In this grammar, action terminals combine hierarchically into temporal sequences of actions of increasing complexity; the actions are bound with the involved tools and affected objects and are governed by certain goals. We show, how the tool role and the affected-object role of an entity within an action drives the derivation of the action syntax in this grammar and controls recursion, merge and move, the latter being mechanisms that manifest themselves not only in human language, but in human action too. PMID:22106430

  6. Spontaneous Grammar Explanations.

    ERIC Educational Resources Information Center

    Tjoo, Hong Sing; Lewis, Marilyn

    1998-01-01

    Describes one New Zealand university language teacher's reflection on her own grammar explanations to university-level students of Bahasa Indonesian. Examines form-focused instruction through the teacher's spontaneous answers to students' questions about the form of the language they are studying. The teacher's experiences show that it takes time…

  7. Grammar for College Writing: A Sentence-Composing Approach

    ERIC Educational Resources Information Center

    Killgallon, Don; Killgallon, Jenny

    2010-01-01

    Across America, in thousands of classrooms, from elementary school to high school, the time-tested sentence-composing approach has given students tools to become better writers. Now the authors present a much anticipated sentence-composing grammar worktext for college writing. This book presents a new and easier way to understand grammar: (1) Noun…

  8. Assessing Grammar Teaching Methods Using a Metacognitive Framework.

    ERIC Educational Resources Information Center

    Burkhalter, Nancy

    A study examined 3 grammar teaching methods to understand why some methods may carry over into writing better than others. E. Bialystok and E. B. Ryan's (1985) metacognitive model of language skills was adapted to plot traditional grammar, sentence combining, and the functional/inductive approach according to the amount of analyzed knowledge and…

  9. English Grammar in American Schools before 1850. Bulletin, 1921, No. 12

    ERIC Educational Resources Information Center

    Lyman, Rollo LaVerne

    1922-01-01

    English grammar, as a formal subject, distinct from other branches of instruction in the vernacular, made but sporadic appearances in the American schools before 1775. After the Revolution its rise was extremely rapid. English grammar gained momentum as the hold of Latin grammar weakened, and by the end of the first quarter of the nineteenth…

  10. Hypergraph partitioning implementation for parallelizing matrix-vector multiplication using CUDA GPU-based parallel computing

    NASA Astrophysics Data System (ADS)

    Murni, Bustamam, A.; Ernastuti, Handhika, T.; Kerami, D.

    2017-07-01

    Calculation of the matrix-vector multiplication in the real-world problems often involves large matrix with arbitrary size. Therefore, parallelization is needed to speed up the calculation process that usually takes a long time. Graph partitioning techniques that have been discussed in the previous studies cannot be used to complete the parallelized calculation of matrix-vector multiplication with arbitrary size. This is due to the assumption of graph partitioning techniques that can only solve the square and symmetric matrix. Hypergraph partitioning techniques will overcome the shortcomings of the graph partitioning technique. This paper addresses the efficient parallelization of matrix-vector multiplication through hypergraph partitioning techniques using CUDA GPU-based parallel computing. CUDA (compute unified device architecture) is a parallel computing platform and programming model that was created by NVIDIA and implemented by the GPU (graphics processing unit).

  11. Grammar-Supported 3d Indoor Reconstruction from Point Clouds for As-Built Bim

    NASA Astrophysics Data System (ADS)

    Becker, S.; Peter, M.; Fritsch, D.

    2015-03-01

    The paper presents a grammar-based approach for the robust automatic reconstruction of 3D interiors from raw point clouds. The core of the approach is a 3D indoor grammar which is an extension of our previously published grammar concept for the modeling of 2D floor plans. The grammar allows for the modeling of buildings whose horizontal, continuous floors are traversed by hallways providing access to the rooms as it is the case for most office buildings or public buildings like schools, hospitals or hotels. The grammar is designed in such way that it can be embedded in an iterative automatic learning process providing a seamless transition from LOD3 to LOD4 building models. Starting from an initial low-level grammar, automatically derived from the window representations of an available LOD3 building model, hypotheses about indoor geometries can be generated. The hypothesized indoor geometries are checked against observation data - here 3D point clouds - collected in the interior of the building. The verified and accepted geometries form the basis for an automatic update of the initial grammar. By this, the knowledge content of the initial grammar is enriched, leading to a grammar with increased quality. This higher-level grammar can then be applied to predict realistic geometries to building parts where only sparse observation data are available. Thus, our approach allows for the robust generation of complete 3D indoor models whose quality can be improved continuously as soon as new observation data are fed into the grammar-based reconstruction process. The feasibility of our approach is demonstrated based on a real-world example.

  12. Linear grammar as a possible stepping-stone in the evolution of language.

    PubMed

    Jackendoff, Ray; Wittenberg, Eva

    2017-02-01

    We suggest that one way to approach the evolution of language is through reverse engineering: asking what components of the language faculty could have been useful in the absence of the full complement of components. We explore the possibilities offered by linear grammar, a form of language that lacks syntax and morphology altogether, and that structures its utterances through a direct mapping between semantics and phonology. A language with a linear grammar would have no syntactic categories or syntactic phrases, and therefore no syntactic recursion. It would also have no functional categories such as tense, agreement, and case inflection, and no derivational morphology. Such a language would still be capable of conveying certain semantic relations through word order-for instance by stipulating that agents should precede patients. However, many other semantic relations would have to be based on pragmatics and discourse context. We find evidence of linear grammar in a wide range of linguistic phenomena: pidgins, stages of late second language acquisition, home signs, village sign languages, language comprehension (even in fully syntactic languages), aphasia, and specific language impairment. We also find a full-blown language, Riau Indonesian, whose grammar is arguably close to a pure linear grammar. In addition, when subjects are asked to convey information through nonlinguistic gesture, their gestures make use of semantically based principles of linear ordering. Finally, some pockets of English grammar, notably compounds, can be characterized in terms of linear grammar. We conclude that linear grammar is a plausible evolutionary precursor of modern fully syntactic grammar, one that is still active in the human mind.

  13. Pair Counting to Improve Grammar and Spoken Fluency

    ERIC Educational Resources Information Center

    Hanson, Stephanie

    2017-01-01

    English language learners are often more grammatically accurate in writing than in speaking. As students focus on meaning while speaking, their spoken fluency comes at a cost: their grammatical accuracy decreases. The author wanted to find a way to help her students improve their oral grammar; that is, she wanted them to focus on grammar while…

  14. Literature and Grammar.

    ERIC Educational Resources Information Center

    Claremont, Francesca

    1993-01-01

    This reprint of a lecture published in 1976 examines the uses of history and literary stories for instructing children in grammar, creative dramatics, natural history, and prehistory, as well as literary analysis. Provides a starting point for thinking about the power of literature as an integrating medium in the Montessori elementary classroom.…

  15. The Linguistic Core Approach to StructuredTranslation and Analysis of Low Resource Languages

    DTIC Science & Technology

    2017-09-02

    grammars from no training data and partial training data (as given by GFL). We are now anno - tating GFL for English, Portuguese, Chinese and...translation. In Proc. EMNLP, 2014. [20] F. Drewes, H.- J . Kreowski, and A. Habel. Hyperedge replacement graph grammars. Handbook of Graph Grammars, 1:95–162...tory, Jena, 2015. [41] B. Jones, J . Andreas, D. Bauer, K-M. Hermann, and K. Knight. Semantics- based machine translation with hyperedge replacement

  16. Triumph through Texting: Restoring Learners' Interest in Grammar

    ERIC Educational Resources Information Center

    Hedjazi Moghari, Mona; Marandi, S. Susan

    2017-01-01

    It is usually the case that learners of English as a foreign language (EFL) are exposed to language materials in class only, and of course in such a short space of time, they do not always find enough chance to practice English grammar features and become aware of their grammar mistakes. As a potential solution to this problem, the current study…

  17. Teacher to Teacher: What Is Your Most Compelling Reason for Teaching Grammar?

    ERIC Educational Resources Information Center

    English Journal, 2006

    2006-01-01

    This article presents compelling reasons from teachers why they teach grammar. Amy Benjamin from Hendrick Hudson High School says, she teaches grammar for two reasons. The first is that grammar instruction gives students metalanguage, "language about language." The second reason is that students are interested in language--its changes and…

  18. CHINESE GRAMMARS AND THE COMPUTER AT THE OHIO STATE UNIVERSITY. PRELIMINARY REPORT.

    ERIC Educational Resources Information Center

    MEYERS, L.F.; YANG, J.

    SAMPLE OUTPUT SENTENCES OF VARIOUS COMIT AND SNOBOL PROGRAMS FOR TESTING A CHINESE GENERATIVE GRAMMAR ARE PRESENTED. THE GRAMMAR CHOSEN FOR EXPERIMENTATION IS A PRELIMINARY VERSION OF A TRANSFORMATIONAL GRAMMAR. ALL OF THE COMIT PROGRAMS AND ONE OF THE SNOBOL PROGRAMS USE A LINEARIZED REPRESENTATION OF TREE STRUCTURES, WITH ADDITIONAL NUMERICAL…

  19. Impact of Consciousness-Raising Activities on Young English Language Learners' Grammar Performance

    ERIC Educational Resources Information Center

    Fatemipour, Hamidreza; Hemmati, Shiva

    2015-01-01

    Grammar Consciousness-Raising (GCR) is an approach to teaching of grammar which learners instead of being taught the given rules, experience language data. The data challenge them to rethink, restructure their existing mental grammar and construct an explicit rule to describe the grammatical feature which the data illustrate (Ellis, 2002). And…

  20. Picture grammars in classification and semantic interpretation of 3D coronary vessels visualisations

    NASA Astrophysics Data System (ADS)

    Ogiela, M. R.; Tadeusiewicz, R.; Trzupek, M.

    2009-09-01

    The work presents the new opportunity for making semantic descriptions and analysis of medical structures, especially coronary vessels CT spatial reconstructions, with the use of AI graph-based linguistic formalisms. In the paper there will be discussed the manners of applying methods of computational intelligence to the development of a syntactic semantic description of spatial visualisations of the heart's coronary vessels. Such descriptions may be used for both smart ordering of images while archiving them and for their semantic searches in medical multimedia databases. Presented methodology of analysis can furthermore be used for attaining other goals related performance of computer-assisted semantic interpretation of selected elements and/or the entire 3D structure of the coronary vascular tree. These goals are achieved through the use of graph-based image formalisms based on IE graphs generating grammars that allow discovering and automatic semantic interpretation of irregularities visualised on the images obtained during diagnostic examinations of the heart muscle. The basis for the construction of 3D reconstructions of biological objects used in this work are visualisations obtained from helical CT scans, yet the method itself may be applied also for other methods of medical 3D images acquisition. The obtained semantic information makes it possible to make a description of the structure focused on the semantics of various morphological forms of the visualised vessels from the point of view of the operation of coronary circulation and the blood supply of the heart muscle. Thanks to these, the analysis conducted allows fast and — to a great degree — automated interpretation of the semantics of various morphological changes in the coronary vascular tree, and especially makes it possible to detect these stenoses in the lumen of the vessels that can cause critical decrease in blood supply to extensive or especially important fragments of the heart muscle.

  1. Co-clustering directed graphs to discover asymmetries and directional communities

    PubMed Central

    Rohe, Karl; Qin, Tai; Yu, Bin

    2016-01-01

    In directed graphs, relationships are asymmetric and these asymmetries contain essential structural information about the graph. Directed relationships lead to a new type of clustering that is not feasible in undirected graphs. We propose a spectral co-clustering algorithm called di-sim for asymmetry discovery and directional clustering. A Stochastic co-Blockmodel is introduced to show favorable properties of di-sim. To account for the sparse and highly heterogeneous nature of directed networks, di-sim uses the regularized graph Laplacian and projects the rows of the eigenvector matrix onto the sphere. A nodewise asymmetry score and di-sim are used to analyze the clustering asymmetries in the networks of Enron emails, political blogs, and the Caenorhabditis elegans chemical connectome. In each example, a subset of nodes have clustering asymmetries; these nodes send edges to one cluster, but receive edges from another cluster. Such nodes yield insightful information (e.g., communication bottlenecks) about directed networks, but are missed if the analysis ignores edge direction. PMID:27791058

  2. Co-clustering directed graphs to discover asymmetries and directional communities.

    PubMed

    Rohe, Karl; Qin, Tai; Yu, Bin

    2016-10-21

    In directed graphs, relationships are asymmetric and these asymmetries contain essential structural information about the graph. Directed relationships lead to a new type of clustering that is not feasible in undirected graphs. We propose a spectral co-clustering algorithm called di-sim for asymmetry discovery and directional clustering. A Stochastic co-Blockmodel is introduced to show favorable properties of di-sim To account for the sparse and highly heterogeneous nature of directed networks, di-sim uses the regularized graph Laplacian and projects the rows of the eigenvector matrix onto the sphere. A nodewise asymmetry score and di-sim are used to analyze the clustering asymmetries in the networks of Enron emails, political blogs, and the Caenorhabditis elegans chemical connectome. In each example, a subset of nodes have clustering asymmetries; these nodes send edges to one cluster, but receive edges from another cluster. Such nodes yield insightful information (e.g., communication bottlenecks) about directed networks, but are missed if the analysis ignores edge direction.

  3. Grammar and the Lexicon. Working Papers in Linguistics 16.

    ERIC Educational Resources Information Center

    University of Trondheim Working Papers in Linguistics, 1993

    1993-01-01

    In this volume, five working papers are presented. "Minimal Signs and Grammar" (Lars Hellan) proposes that a significant part of the "production" of grammar is incremental, building larger and larger constructs, with lexical objects called minimal signs as the first steps. It also suggests that the basic lexical information in…

  4. The Role of Teaching Grammar in First Language Education

    ERIC Educational Resources Information Center

    Demir, Sezgin; Erdogan, Ayse

    2018-01-01

    Grammar; while originating from the natural structure of the language also is the system which makes it possible for different language functions meet within the body of common rules especially communication. Having command of the language used, speaking and writing it correctly require strong grammar knowledge actually. However only knowing the…

  5. The Place of Grammar in the Language Arts Curriculum.

    ERIC Educational Resources Information Center

    Einarsson, Robert

    The history of grammar instruction includes two approaches: the handbook approach, which is practiced today, and the textbook approach. The handbook approach focuses on rules for correct writing and is an error-based view, while the textbook approach would treat grammar holistically and interpretively and would systematically explain new concepts…

  6. Multiword Constructions in the Grammar.

    PubMed

    Culicover, Peter W; Jackendoff, Ray; Audring, Jenny

    2017-07-01

    There is ample evidence that speakers' linguistic knowledge extends well beyond what can be described in terms of rules of compositional interpretation stated over combinations of single words. We explore a range of multiword constructions (MWCs) to get a handle both on the extent of the phenomenon and on the grammatical constraints that may govern it. We consider idioms of various sorts, collocations, compounds, light verbs, syntactic nuts, and assorted other constructions, as well as morphology. Our conclusion is that MWCs highlight the central role that grammar plays in licensing MWCs in the lexicon and the creation of novel MWCs, and they help to clarify how the lexicon articulates with the rest of the grammar. Copyright © 2017 Cognitive Science Society, Inc.

  7. GraphBench

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

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

    2016-06-01

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

  8. Multiple Grammars and the Logic of Learnability in Second Language Acquisition

    PubMed Central

    Roeper, Tom W.

    2016-01-01

    The core notion of modern Universal Grammar is that language ability requires abstract representation in terms of hierarchy, movement operations, abstract features on words, and fixed mapping to meaning. These mental structures are a step toward integrating representational knowledge of all kinds into a larger model of cognitive psychology. Examining first and second language at once provides clues as to how abstractly we should represent this knowledge. The abstract nature of grammar allows both the formulation of many grammars and the possibility that a rule of one grammar could apply to another grammar. We argue that every language contains Multiple Grammars which may reflect different language families. We develop numerous examples of how the same abstract rules can apply in various languages and develop a theory of how language modules (case-marking, topicalization, and quantification) interact to predict L2 acquisition paths. In particular we show in depth how Germanic Verb-second operations, based on Verb-final structure, can apply in English. The argument is built around how and where V2 from German can apply in English, seeking to explain the crucial contrast: “nothing” yelled out Bill/*“nothing” yelled Bill out in terms of the necessary abstractness of the V2 rule. PMID:26869945

  9. Multiple Grammars and the Logic of Learnability in Second Language Acquisition.

    PubMed

    Roeper, Tom W

    2016-01-01

    The core notion of modern Universal Grammar is that language ability requires abstract representation in terms of hierarchy, movement operations, abstract features on words, and fixed mapping to meaning. These mental structures are a step toward integrating representational knowledge of all kinds into a larger model of cognitive psychology. Examining first and second language at once provides clues as to how abstractly we should represent this knowledge. The abstract nature of grammar allows both the formulation of many grammars and the possibility that a rule of one grammar could apply to another grammar. We argue that every language contains Multiple Grammars which may reflect different language families. We develop numerous examples of how the same abstract rules can apply in various languages and develop a theory of how language modules (case-marking, topicalization, and quantification) interact to predict L2 acquisition paths. In particular we show in depth how Germanic Verb-second operations, based on Verb-final structure, can apply in English. The argument is built around how and where V2 from German can apply in English, seeking to explain the crucial contrast: "nothing" yelled out Bill/(*)"nothing" yelled Bill out in terms of the necessary abstractness of the V2 rule.

  10. Effect of Jigsaw I Technique on Teaching Turkish Grammar

    ERIC Educational Resources Information Center

    Arslan, Akif

    2016-01-01

    The purpose of this study is to find out the effect of Jigsaw I technique on students' academic success and attitude towards the course in teaching Turkish grammar. For that purpose, three grammar topics (spelling and punctuation marks rules) were determined and an experimental study conforming to "control group preliminary-testing final…

  11. Grammar Is Back, but When Will We Start Cooking?

    ERIC Educational Resources Information Center

    Vavra, Ed

    2003-01-01

    Suggests that the current "return" to grammar will fail unless educators can come to terms with definitions of fundamental grammatical concepts. Considers how educators cannot go back to teaching the traditional, because the traditional no longer exists. Argues that pedagogical grammar currently has too many cooks, all trying to prepare the same…

  12. Construction Morphology and the Parallel Architecture of Grammar

    ERIC Educational Resources Information Center

    Booij, Geert; Audring, Jenny

    2017-01-01

    This article presents a systematic exposition of how the basic ideas of Construction Grammar (CxG) (Goldberg, 2006) and the Parallel Architecture (PA) of grammar (Jackendoff, 2002]) provide the framework for a proper account of morphological phenomena, in particular word formation. This framework is referred to as Construction Morphology (CxM). As…

  13. Spoken Grammar: An Urgent Necessity in the EFL Context

    ERIC Educational Resources Information Center

    Al-wossabi, Sami A.

    2014-01-01

    Recent studies in corpus linguistics have revealed apparent inconsistencies between the prescriptive grammar presented in EFL textbooks and the type of grammar used in the speech of native speakers. Such variations and learning gaps deprive EFL learners of the actual use of English and delay their oral/aural developmental processes. The focus of…

  14. EEG: Elements of English Grammar: Rules Explained Simply. Workbook.

    ERIC Educational Resources Information Center

    Ratti, Marianne

    This workbook is a supplement to Harold Van Winkle's "Elements of English Grammar: Rules Explained Simply," a book intended for self-instruction which presents the basic rules of standard English grammar in an easy-to-understand manner. The workbook's six chapters correspond to those in the book and contain exercises on: (1) The…

  15. State Competency Testing for Teachers: Problems with Testing Grammar,

    ERIC Educational Resources Information Center

    Shafer, Robert E.

    In Arizona, beginning teachers applying for certification must take the Arizona Teacher Proficiency Examination which tests professional knowledge, reading, mathematics, and grammar. The high failure rate on the grammar test has caused a great deal of concern; 40 percent of the examinees, and a higher percentage of minority groups, failed it in…

  16. Literary Texts and Grammar Instruction: Revisiting the Inductive Presentation

    ERIC Educational Resources Information Center

    Paesani, Kate

    2005-01-01

    This article outlines an approach to explicit grammar instruction that uses literary texts as comprehensible, meaning-bearing input. In this approach, which employs strategies from the teaching of grammar and the teaching of reading, literary texts serve as the basis of the inductive presentation of new grammatical forms and as a springboard for…

  17. Decomposition Algorithm for Global Reachability on a Time-Varying Graph

    NASA Technical Reports Server (NTRS)

    Kuwata, Yoshiaki

    2010-01-01

    A decomposition algorithm has been developed for global reachability analysis on a space-time grid. By exploiting the upper block-triangular structure, the planning problem is decomposed into smaller subproblems, which is much more scalable than the original approach. Recent studies have proposed the use of a hot-air (Montgolfier) balloon for possible exploration of Titan and Venus because these bodies have thick haze or cloud layers that limit the science return from an orbiter, and the atmospheres would provide enough buoyancy for balloons. One of the important questions that needs to be addressed is what surface locations the balloon can reach from an initial location, and how long it would take. This is referred to as the global reachability problem, where the paths from starting locations to all possible target locations must be computed. The balloon could be driven with its own actuation, but its actuation capability is fairly limited. It would be more efficient to take advantage of the wind field and ride the wind that is much stronger than what the actuator could produce. It is possible to pose the path planning problem as a graph search problem on a directed graph by discretizing the spacetime world and the vehicle actuation. The decomposition algorithm provides reachability analysis of a time-varying graph. Because the balloon only moves in the positive direction in time, the adjacency matrix of the graph can be represented with an upper block-triangular matrix, and this upper block-triangular structure can be exploited to decompose a large graph search problem. The new approach consumes a much smaller amount of memory, which also helps speed up the overall computation when the computing resource has a limited physical memory compared to the problem size.

  18. Differentials on graph complexes II: hairy graphs

    NASA Astrophysics Data System (ADS)

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

    2017-10-01

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

  19. Graph theoretic analysis of structural connectivity across the spectrum of Alzheimer's disease: The importance of graph creation methods

    PubMed Central

    Phillips, David J.; McGlaughlin, Alec; Ruth, David; Jager, Leah R.; Soldan, Anja

    2015-01-01

    Graph theory is increasingly being used to study brain connectivity across the spectrum of Alzheimer's disease (AD), but prior findings have been inconsistent, likely reflecting methodological differences. We systematically investigated how methods of graph creation (i.e., type of correlation matrix and edge weighting) affect structural network properties and group differences. We estimated the structural connectivity of brain networks based on correlation maps of cortical thickness obtained from MRI. Four groups were compared: 126 cognitively normal older adults, 103 individuals with Mild Cognitive Impairment (MCI) who retained MCI status for at least 3 years (stable MCI), 108 individuals with MCI who progressed to AD-dementia within 3 years (progressive MCI), and 105 individuals with AD-dementia. Small-world measures of connectivity (characteristic path length and clustering coefficient) differed across groups, consistent with prior studies. Groups were best discriminated by the Randić index, which measures the degree to which highly connected nodes connect to other highly connected nodes. The Randić index differentiated the stable and progressive MCI groups, suggesting that it might be useful for tracking and predicting the progression of AD. Notably, however, the magnitude and direction of group differences in all three measures were dependent on the method of graph creation, indicating that it is crucial to take into account how graphs are constructed when interpreting differences across diagnostic groups and studies. The algebraic connectivity measures showed few group differences, independent of the method of graph construction, suggesting that global connectivity as it relates to node degree is not altered in early AD. PMID:25984446

  20. Where Is She? Gender Occurrences in Online Grammar Guides

    ERIC Educational Resources Information Center

    Amare, Nicole

    2007-01-01

    This article examines seven online grammar guides for instances of linguistic sexism. The grammar sentences from .edu Websites were analyzed based on NCTE's "Guidelines for Gender-Fair Use of Language" (2002) using the criteria of generic he and man; titles, labels, and names; gender stereotypes; order of mention (firstness); and ratio of male to…

  1. Effect of Direct Grammar Instruction on Student Writing Skills

    ERIC Educational Resources Information Center

    Robinson, Lisa; Feng, Jay

    2016-01-01

    Grammar Instruction has an important role to play in helping students to speak and write more effectively. The purpose of this study was to examine the effects of direct grammar instruction on the quality of student's writing skills. The participants in this study included 18 fifth grade students and two fifth grade teachers. Based on the results…

  2. A Hybrid Task Graph Scheduler for High Performance Image Processing Workflows.

    PubMed

    Blattner, Timothy; Keyrouz, Walid; Bhattacharyya, Shuvra S; Halem, Milton; Brady, Mary

    2017-12-01

    Designing applications for scalability is key to improving their performance in hybrid and cluster computing. Scheduling code to utilize parallelism is difficult, particularly when dealing with data dependencies, memory management, data motion, and processor occupancy. The Hybrid Task Graph Scheduler (HTGS) improves programmer productivity when implementing hybrid workflows for multi-core and multi-GPU systems. The Hybrid Task Graph Scheduler (HTGS) is an abstract execution model, framework, and API that increases programmer productivity when implementing hybrid workflows for such systems. HTGS manages dependencies between tasks, represents CPU and GPU memories independently, overlaps computations with disk I/O and memory transfers, keeps multiple GPUs occupied, and uses all available compute resources. Through these abstractions, data motion and memory are explicit; this makes data locality decisions more accessible. To demonstrate the HTGS application program interface (API), we present implementations of two example algorithms: (1) a matrix multiplication that shows how easily task graphs can be used; and (2) a hybrid implementation of microscopy image stitching that reduces code size by ≈ 43% compared to a manually coded hybrid workflow implementation and showcases the minimal overhead of task graphs in HTGS. Both of the HTGS-based implementations show good performance. In image stitching the HTGS implementation achieves similar performance to the hybrid workflow implementation. Matrix multiplication with HTGS achieves 1.3× and 1.8× speedup over the multi-threaded OpenBLAS library for 16k × 16k and 32k × 32k size matrices, respectively.

  3. Color normalization of histology slides using graph regularized sparse NMF

    NASA Astrophysics Data System (ADS)

    Sha, Lingdao; Schonfeld, Dan; Sethi, Amit

    2017-03-01

    Computer based automatic medical image processing and quantification are becoming popular in digital pathology. However, preparation of histology slides can vary widely due to differences in staining equipment, procedures and reagents, which can reduce the accuracy of algorithms that analyze their color and texture information. To re- duce the unwanted color variations, various supervised and unsupervised color normalization methods have been proposed. Compared with supervised color normalization methods, unsupervised color normalization methods have advantages of time and cost efficient and universal applicability. Most of the unsupervised color normaliza- tion methods for histology are based on stain separation. Based on the fact that stain concentration cannot be negative and different parts of the tissue absorb different stains, nonnegative matrix factorization (NMF), and particular its sparse version (SNMF), are good candidates for stain separation. However, most of the existing unsupervised color normalization method like PCA, ICA, NMF and SNMF fail to consider important information about sparse manifolds that its pixels occupy, which could potentially result in loss of texture information during color normalization. Manifold learning methods like Graph Laplacian have proven to be very effective in interpreting high-dimensional data. In this paper, we propose a novel unsupervised stain separation method called graph regularized sparse nonnegative matrix factorization (GSNMF). By considering the sparse prior of stain concentration together with manifold information from high-dimensional image data, our method shows better performance in stain color deconvolution than existing unsupervised color deconvolution methods, especially in keeping connected texture information. To utilized the texture information, we construct a nearest neighbor graph between pixels within a spatial area of an image based on their distances using heat kernal in lαβ space. The

  4. The Effects of Communicative Grammar Teaching on Students' Achievement of Grammatical Knowledge and Oral Production

    ERIC Educational Resources Information Center

    Ho, Pham Vu Phi; The Binh, Nguyen

    2014-01-01

    So far the students of Le Hong Phong Junior High School have been taught grammar with GTM (Grammar-Translation Method), which just prepares learners for conventional grammar-paper tests. Despite their considerable knowledge of grammar, the students fail to use the language they have learnt to communicate in real-life situations. The purpose of…

  5. A Grammar of Kurtop

    ERIC Educational Resources Information Center

    Hyslop, Gwendolyn

    2011-01-01

    Kurtop is a Tibeto-Burman language spoken by approximately 15,000 people in Northeastern Bhutan. This dissertation is the first descriptive grammar of the language, based on extensive fieldwork and community-driven language documentation in Bhutan. When possible, analyses are presented in typological and historical/comparative perspectives and…

  6. Sensing the Sentence: An Embodied Simulation Approach to Rhetorical Grammar

    ERIC Educational Resources Information Center

    Rule, Hannah J.

    2017-01-01

    This article applies the neuroscientific concept of embodied simulation--the process of understanding language through visual, motor, and spatial modalities of the body--to rhetorical grammar and sentence-style pedagogies. Embodied simulation invigorates rhetorical grammar instruction by attuning writers to the felt effects of written language,…

  7. A Tool for Intersecting Context-Free Grammars and Its Applications

    NASA Technical Reports Server (NTRS)

    Gange, Graeme; Navas, Jorge A.; Schachte, Peter; Sondergaard, Harald; Stuckey, Peter J.

    2015-01-01

    This paper describes a tool for intersecting context-free grammars. Since this problem is undecidable the tool follows a refinement-based approach and implements a novel refinement which is complete for regularly separable grammars. We show its effectiveness for safety verification of recursive multi-threaded programs.

  8. Grammar Teaching and Learning in L2: Necessary, but Boring?

    ERIC Educational Resources Information Center

    Jean, Gladys; Simard, Daphnee

    2011-01-01

    This descriptive inquiry-based study targeted second language (L2) high school students' (n = 2321) and teachers' (n = 45) beliefs and perceptions about grammar instruction, specifically about grammatical accuracy, corrective feedback, and diverse forms of grammar teaching and learning. Results showed only slight discrepancies between students'…

  9. Development and Validation of a Diagnostic Grammar Test for Japanese Learners of English

    ERIC Educational Resources Information Center

    Koizumi, Rie; Sakai, Hideki; Ido, Takahiro; Ota, Hiroshi; Hayama, Megumi; Sato, Masatoshi; Nemoto, Akiko

    2011-01-01

    This article reports on the development and validation of the English Diagnostic Test of Grammar (EDiT Grammar) for Japanese learners of English. From among the many aspects of grammar, this test focuses on the knowledge of basic English noun phrases (NPs), especially their internal structures, because previous research has indicated the…

  10. A Grammar of Bih

    ERIC Educational Resources Information Center

    Nguyen, Tam Thi Minh

    2013-01-01

    Bih is a Chamic (Austronesian) language spoken by approximately 500 people in the Southern highlands of Vietnam. This dissertation is the first descriptive grammar of the language, based on extensive fieldwork and community-based language documentation in Vietnam and written from a functional/typological perspective. The analysis in this work is…

  11. Assessing the Need for Change in J-School Grammar Curricula.

    ERIC Educational Resources Information Center

    Seamon, Marc

    2001-01-01

    Surveys 100 journalism schools investigating: (1) whether journalism schools treat spelling, punctuation, grammar, and AP style as important factors in improving the state of journalism; (2) how journalism schools are teaching and assessing spelling, punctuation, grammar, and AP style; and (3) whether journalism schools are using entrance or exit…

  12. Environmental Peace Education in Foreign Language Learners' English Grammar Lessons

    ERIC Educational Resources Information Center

    Arikan, Arda

    2009-01-01

    English language teachers create contexts to teach grammar so that meaningful learning occurs. In this study, English grammar is contextualized through environmental peace education activities to raise students' awareness of global issues. Two sources provided data to evaluate the success of this instructional process. Fourth-year pre-service…

  13. Multi-threaded Sparse Matrix-Matrix Multiplication for Many-Core and GPU Architectures.

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

    Deveci, Mehmet; Rajamanickam, Sivasankaran; Trott, Christian Robert

    Sparse Matrix-Matrix multiplication is a key kernel that has applications in several domains such as scienti c computing and graph analysis. Several algorithms have been studied in the past for this foundational kernel. In this paper, we develop parallel algorithms for sparse matrix-matrix multiplication with a focus on performance portability across different high performance computing architectures. The performance of these algorithms depend on the data structures used in them. We compare different types of accumulators in these algorithms and demonstrate the performance difference between these data structures. Furthermore, we develop a meta-algorithm, kkSpGEMM, to choose the right algorithm and datamore » structure based on the characteristics of the problem. We show performance comparisons on three architectures and demonstrate the need for the community to develop two phase sparse matrix-matrix multiplication implementations for efficient reuse of the data structures involved.« less

  14. Lung vessel segmentation in CT images using graph-cuts

    NASA Astrophysics Data System (ADS)

    Zhai, Zhiwei; Staring, Marius; Stoel, Berend C.

    2016-03-01

    Accurate lung vessel segmentation is an important operation for lung CT analysis. Filters that are based on analyzing the eigenvalues of the Hessian matrix are popular for pulmonary vessel enhancement. However, due to their low response at vessel bifurcations and vessel boundaries, extracting lung vessels by thresholding the vesselness is not sufficiently accurate. Some methods turn to graph-cuts for more accurate segmentation, as it incorporates neighbourhood information. In this work, we propose a new graph-cuts cost function combining appearance and shape, where CT intensity represents appearance and vesselness from a Hessian-based filter represents shape. Due to the amount of voxels in high resolution CT scans, the memory requirement and time consumption for building a graph structure is very high. In order to make the graph representation computationally tractable, those voxels that are considered clearly background are removed from the graph nodes, using a threshold on the vesselness map. The graph structure is then established based on the remaining voxel nodes, source/sink nodes and the neighbourhood relationship of the remaining voxels. Vessels are segmented by minimizing the energy cost function with the graph-cuts optimization framework. We optimized the parameters used in the graph-cuts cost function and evaluated the proposed method with two manually labeled sub-volumes. For independent evaluation, we used 20 CT scans of the VESSEL12 challenge. The evaluation results of the sub-volume data show that the proposed method produced a more accurate vessel segmentation compared to the previous methods, with F1 score 0.76 and 0.69. In the VESSEL12 data-set, our method obtained a competitive performance with an area under the ROC curve of 0.975, especially among the binary submissions.

  15. Graph run-length matrices for histopathological image segmentation.

    PubMed

    Tosun, Akif Burak; Gunduz-Demir, Cigdem

    2011-03-01

    The histopathological examination of tissue specimens is essential for cancer diagnosis and grading. However, this examination is subject to a considerable amount of observer variability as it mainly relies on visual interpretation of pathologists. To alleviate this problem, it is very important to develop computational quantitative tools, for which image segmentation constitutes the core step. In this paper, we introduce an effective and robust algorithm for the segmentation of histopathological tissue images. This algorithm incorporates the background knowledge of the tissue organization into segmentation. For this purpose, it quantifies spatial relations of cytological tissue components by constructing a graph and uses this graph to define new texture features for image segmentation. This new texture definition makes use of the idea of gray-level run-length matrices. However, it considers the runs of cytological components on a graph to form a matrix, instead of considering the runs of pixel intensities. Working with colon tissue images, our experiments demonstrate that the texture features extracted from "graph run-length matrices" lead to high segmentation accuracies, also providing a reasonable number of segmented regions. Compared with four other segmentation algorithms, the results show that the proposed algorithm is more effective in histopathological image segmentation.

  16. Grammar Is a System That Characterizes Talk in Interaction

    PubMed Central

    Ginzburg, Jonathan; Poesio, Massimo

    2016-01-01

    Much of contemporary mainstream formal grammar theory is unable to provide analyses for language as it occurs in actual spoken interaction. Its analyses are developed for a cleaned up version of language which omits the disfluencies, non-sentential utterances, gestures, and many other phenomena that are ubiquitous in spoken language. Using evidence from linguistics, conversation analysis, multimodal communication, psychology, language acquisition, and neuroscience, we show these aspects of language use are rule governed in much the same way as phenomena captured by conventional grammars. Furthermore, we argue that over the past few years some of the tools required to provide a precise characterizations of such phenomena have begun to emerge in theoretical and computational linguistics; hence, there is no reason for treating them as “second class citizens” other than pre-theoretical assumptions about what should fall under the purview of grammar. Finally, we suggest that grammar formalisms covering such phenomena would provide a better foundation not just for linguistic analysis of face-to-face interaction, but also for sister disciplines, such as research on spoken dialogue systems and/or psychological work on language acquisition. PMID:28066279

  17. Garfield Latin Grammar Magnet Elementary Schools: 1990-1991. Formative Evaluation.

    ERIC Educational Resources Information Center

    Robinson-Lewis, G.

    The second year of implementation of the Garfield Latin Grammar Magnet Elementary School in Kansas City, Missouri, is reported. The Latin grammar program operates in a traditional setting that includes strong emphasis on discipline and behavior, systemative and rigorous homework policies, and the strong commitment of staff, students, and parents.…

  18. Exact sampling of graphs with prescribed degree correlations

    NASA Astrophysics Data System (ADS)

    Bassler, Kevin E.; Del Genio, Charo I.; Erdős, Péter L.; Miklós, István; Toroczkai, Zoltán

    2015-08-01

    Many real-world networks exhibit correlations between the node degrees. For instance, in social networks nodes tend to connect to nodes of similar degree and conversely, in biological and technological networks, high-degree nodes tend to be linked with low-degree nodes. Degree correlations also affect the dynamics of processes supported by a network structure, such as the spread of opinions or epidemics. The proper modelling of these systems, i.e., without uncontrolled biases, requires the sampling of networks with a specified set of constraints. We present a solution to the sampling problem when the constraints imposed are the degree correlations. In particular, we develop an exact method to construct and sample graphs with a specified joint-degree matrix, which is a matrix providing the number of edges between all the sets of nodes of a given degree, for all degrees, thus completely specifying all pairwise degree correlations, and additionally, the degree sequence itself. Our algorithm always produces independent samples without backtracking. The complexity of the graph construction algorithm is {O}({NM}) where N is the number of nodes and M is the number of edges.

  19. Studies in Inuktitut Grammar

    ERIC Educational Resources Information Center

    Beach, Matthew David

    2012-01-01

    This dissertation addresses a number of issues about the grammar of Eastern Canadian Inuktitut. Inuktitut is a dialect within the Inuit dialect continuum which is a group of languages/dialects within the Eskimo-Aleut language family. (Eastern Canadian Inuktitut has an ISO 693-3 language code of "ike".) Typologically, it is an ergative…

  20. Consistent latent position estimation and vertex classification for random dot product graphs.

    PubMed

    Sussman, Daniel L; Tang, Minh; Priebe, Carey E

    2014-01-01

    In this work, we show that using the eigen-decomposition of the adjacency matrix, we can consistently estimate latent positions for random dot product graphs provided the latent positions are i.i.d. from some distribution. If class labels are observed for a number of vertices tending to infinity, then we show that the remaining vertices can be classified with error converging to Bayes optimal using the $(k)$-nearest-neighbors classification rule. We evaluate the proposed methods on simulated data and a graph derived from Wikipedia.

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

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

    Sengupta, Dipanjan; Song, Shuaiwen; Agarwal, Kapil

    2015-11-15

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

  2. Derivatives in discrete mathematics: a novel graph-theoretical invariant for generating new 2/3D molecular descriptors. I. Theory and QSPR application

    NASA Astrophysics Data System (ADS)

    Marrero-Ponce, Yovani; Santiago, Oscar Martínez; López, Yoan Martínez; Barigye, Stephen J.; Torrens, Francisco

    2012-11-01

    In this report, we present a new mathematical approach for describing chemical structures of organic molecules at atomic-molecular level, proposing for the first time the use of the concept of the derivative ( partial ) of a molecular graph (MG) with respect to a given event ( E), to obtain a new family of molecular descriptors (MDs). With this purpose, a new matrix representation of the MG, which generalizes graph's theory's traditional incidence matrix, is introduced. This matrix, denominated the generalized incidence matrix, Q, arises from the Boolean representation of molecular sub- graphs that participate in the formation of the graph molecular skeleton MG and could be complete (representing all possible connected sub-graphs) or constitute sub-graphs of determined orders or types as well as a combination of these. The Q matrix is a non-quadratic and unsymmetrical in nature, its columns ( n) and rows ( m) are conditions (letters) and collection of conditions (words) with which the event occurs. This non-quadratic and unsymmetrical matrix is transformed, by algebraic manipulation, to a quadratic and symmetric matrix known as relations frequency matrix, F, which characterizes the participation intensity of the conditions (letters) in the events (words). With F, we calculate the derivative over a pair of atomic nuclei. The local index for the atomic nuclei i, Δ i , can therefore be obtained as a linear combination of all the pair derivatives of the atomic nuclei i with all the rest of the j's atomic nuclei. Here, we also define new strategies that generalize the present form of obtaining global or local (group or atom-type) invariants from atomic contributions (local vertex invariants, LOVIs). In respect to this, metric (norms), means and statistical invariants are introduced. These invariants are applied to a vector whose components are the values Δ i for the atomic nuclei of the molecule or its fragments. Moreover, with the purpose of differentiating among

  3. Derivatives in discrete mathematics: a novel graph-theoretical invariant for generating new 2/3D molecular descriptors. I. Theory and QSPR application.

    PubMed

    Marrero-Ponce, Yovani; Santiago, Oscar Martínez; López, Yoan Martínez; Barigye, Stephen J; Torrens, Francisco

    2012-11-01

    In this report, we present a new mathematical approach for describing chemical structures of organic molecules at atomic-molecular level, proposing for the first time the use of the concept of the derivative ([Formula: see text]) of a molecular graph (MG) with respect to a given event (E), to obtain a new family of molecular descriptors (MDs). With this purpose, a new matrix representation of the MG, which generalizes graph's theory's traditional incidence matrix, is introduced. This matrix, denominated the generalized incidence matrix, Q, arises from the Boolean representation of molecular sub-graphs that participate in the formation of the graph molecular skeleton MG and could be complete (representing all possible connected sub-graphs) or constitute sub-graphs of determined orders or types as well as a combination of these. The Q matrix is a non-quadratic and unsymmetrical in nature, its columns (n) and rows (m) are conditions (letters) and collection of conditions (words) with which the event occurs. This non-quadratic and unsymmetrical matrix is transformed, by algebraic manipulation, to a quadratic and symmetric matrix known as relations frequency matrix, F, which characterizes the participation intensity of the conditions (letters) in the events (words). With F, we calculate the derivative over a pair of atomic nuclei. The local index for the atomic nuclei i, Δ(i), can therefore be obtained as a linear combination of all the pair derivatives of the atomic nuclei i with all the rest of the j's atomic nuclei. Here, we also define new strategies that generalize the present form of obtaining global or local (group or atom-type) invariants from atomic contributions (local vertex invariants, LOVIs). In respect to this, metric (norms), means and statistical invariants are introduced. These invariants are applied to a vector whose components are the values Δ(i) for the atomic nuclei of the molecule or its fragments. Moreover, with the purpose of differentiating

  4. The Role of Grammar in the Writing Curriculum: A Review of the Literature

    ERIC Educational Resources Information Center

    Myhill, Debra; Watson, Annabel

    2014-01-01

    For most Anglophone countries, the history of grammar teaching over the past 50 years is one of contestation, debate and dissent: and 50 years on we are no closer to reaching a consensus about the role of grammar in the English/Language Arts curriculum. The debate has been described through the metaphor of battle and grammar wars (Kamler, 1995;…

  5. A stochastic context free grammar based framework for analysis of protein sequences

    PubMed Central

    Dyrka, Witold; Nebel, Jean-Christophe

    2009-01-01

    Background In the last decade, there have been many applications of formal language theory in bioinformatics such as RNA structure prediction and detection of patterns in DNA. However, in the field of proteomics, the size of the protein alphabet and the complexity of relationship between amino acids have mainly limited the application of formal language theory to the production of grammars whose expressive power is not higher than stochastic regular grammars. However, these grammars, like other state of the art methods, cannot cover any higher-order dependencies such as nested and crossing relationships that are common in proteins. In order to overcome some of these limitations, we propose a Stochastic Context Free Grammar based framework for the analysis of protein sequences where grammars are induced using a genetic algorithm. Results This framework was implemented in a system aiming at the production of binding site descriptors. These descriptors not only allow detection of protein regions that are involved in these sites, but also provide insight in their structure. Grammars were induced using quantitative properties of amino acids to deal with the size of the protein alphabet. Moreover, we imposed some structural constraints on grammars to reduce the extent of the rule search space. Finally, grammars based on different properties were combined to convey as much information as possible. Evaluation was performed on sites of various sizes and complexity described either by PROSITE patterns, domain profiles or a set of patterns. Results show the produced binding site descriptors are human-readable and, hence, highlight biologically meaningful features. Moreover, they achieve good accuracy in both annotation and detection. In addition, findings suggest that, unlike current state-of-the-art methods, our system may be particularly suited to deal with patterns shared by non-homologous proteins. Conclusion A new Stochastic Context Free Grammar based framework has been

  6. Deriving a probabilistic syntacto-semantic grammar for biomedicine based on domain-specific terminologies

    PubMed Central

    Fan, Jung-Wei; Friedman, Carol

    2011-01-01

    Biomedical natural language processing (BioNLP) is a useful technique that unlocks valuable information stored in textual data for practice and/or research. Syntactic parsing is a critical component of BioNLP applications that rely on correctly determining the sentence and phrase structure of free text. In addition to dealing with the vast amount of domain-specific terms, a robust biomedical parser needs to model the semantic grammar to obtain viable syntactic structures. With either a rule-based or corpus-based approach, the grammar engineering process requires substantial time and knowledge from experts, and does not always yield a semantically transferable grammar. To reduce the human effort and to promote semantic transferability, we propose an automated method for deriving a probabilistic grammar based on a training corpus consisting of concept strings and semantic classes from the Unified Medical Language System (UMLS), a comprehensive terminology resource widely used by the community. The grammar is designed to specify noun phrases only due to the nominal nature of the majority of biomedical terminological concepts. Evaluated on manually parsed clinical notes, the derived grammar achieved a recall of 0.644, precision of 0.737, and average cross-bracketing of 0.61, which demonstrated better performance than a control grammar with the semantic information removed. Error analysis revealed shortcomings that could be addressed to improve performance. The results indicated the feasibility of an approach which automatically incorporates terminology semantics in the building of an operational grammar. Although the current performance of the unsupervised solution does not adequately replace manual engineering, we believe once the performance issues are addressed, it could serve as an aide in a semi-supervised solution. PMID:21549857

  7. Grammaire nouvelle? Questions pour des questions (New Grammar? Questions about Questions).

    ERIC Educational Resources Information Center

    Lamy, Andre

    1987-01-01

    Implications of the "new grammar" approach to teaching French are examined, including the issues of nomenclature, definition, rules and generalizations, and native language use in the second language class. Grammar itself has not changed, and the principal concern is still good usage. (MSE)

  8. Graph-Theoretic Representations for Proximity Matrices through Strongly-Anti-Robinson or Circular Strongly-Anti-Robinson Matrices.

    ERIC Educational Resources Information Center

    Hubert, Lawrence; Arabie, Phipps; Meulman, Jacqueline

    1998-01-01

    Introduces a method for fitting order-constrained matrices that satisfy the strongly anti-Robinson restrictions (SAR). The method permits a representation of the fitted values in a (least-squares) SAR approximating matrix as lengths of paths in a graph. The approach is illustrated with a published proximity matrix. (SLD)

  9. Noticing Grammar in L2 Writing and Problem-Solving Strategies

    ERIC Educational Resources Information Center

    Geist, Monika

    2017-01-01

    Noticing plays an important role for second language acquisition. Since the formulation of the output hypothesis (Swain, 1985), it has been proven that producing output can lead to noticing. Studies on noticing have revealed little focus on grammar, and an in-depth investigation of grammar noticing has not been conducted so far. Studies into…

  10. A Grammar of Sierra Popoluca (Soteapanec, a Mixe-Zoquean Language)

    ERIC Educational Resources Information Center

    de Jong Boudreault, Lynda J.

    2009-01-01

    This dissertation is a comprehensive description of the grammar of Sierra Popoluca (SP, aka Soteapanec), a Mixe-Zoquean language spoken by approximately 28,000 people in Veracruz, Mexico. This grammar begins with an introduction to the language, its language family, a typological overview of the language, a brief history of my fieldwork, and the…

  11. Multi-threaded Sparse Matrix Sparse Matrix Multiplication for Many-Core and GPU Architectures.

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

    Deveci, Mehmet; Trott, Christian Robert; Rajamanickam, Sivasankaran

    Sparse Matrix-Matrix multiplication is a key kernel that has applications in several domains such as scientific computing and graph analysis. Several algorithms have been studied in the past for this foundational kernel. In this paper, we develop parallel algorithms for sparse matrix- matrix multiplication with a focus on performance portability across different high performance computing architectures. The performance of these algorithms depend on the data structures used in them. We compare different types of accumulators in these algorithms and demonstrate the performance difference between these data structures. Furthermore, we develop a meta-algorithm, kkSpGEMM, to choose the right algorithm and datamore » structure based on the characteristics of the problem. We show performance comparisons on three architectures and demonstrate the need for the community to develop two phase sparse matrix-matrix multiplication implementations for efficient reuse of the data structures involved.« less

  12. Learning of pitch and time structures in an artificial grammar setting.

    PubMed

    Prince, Jon B; Stevens, Catherine J; Jones, Mari Riess; Tillmann, Barbara

    2018-04-12

    Despite the empirical evidence for the power of the cognitive capacity of implicit learning of structures and regularities in several modalities and materials, it remains controversial whether implicit learning extends to the learning of temporal structures and regularities. We investigated whether (a) an artificial grammar can be learned equally well when expressed in duration sequences as when expressed in pitch sequences, (b) learning of the artificial grammar in either duration or pitch (as the primary dimension) sequences can be influenced by the properties of the secondary dimension (invariant vs. randomized), and (c) learning can be boosted when the artificial grammar is expressed in both pitch and duration. After an exposure phase with grammatical sequences, learning in a subsequent test phase was assessed in a grammaticality judgment task. Participants in both the pitch and duration conditions showed incidental (not fully implicit) learning of the artificial grammar when the secondary dimension was invariant, but randomizing the pitch sequence prevented learning of the artificial grammar in duration sequences. Expressing the artificial grammar in both pitch and duration resulted in disproportionately better performance, suggesting an interaction between the learning of pitch and temporal structure. The findings are relevant to research investigating the learning of temporal structures and the learning of structures presented simultaneously in 2 dimensions (e.g., space and time, space and objects). By investigating learning, the findings provide further insight into the potential specificity of pitch and time processing, and their integrated versus independent processing, as previously debated in music cognition research. (PsycINFO Database Record (c) 2018 APA, all rights reserved).

  13. Reflections on Grammar's Demise

    ERIC Educational Resources Information Center

    Mulroy, David

    2004-01-01

    Of the seven liberal arts, on which Western education was based, grammar has always been preeminent. Yet English teachers in recent years have belittled it to the point of an irrelevance. Not only has this higher illiteracy rendered Americans unable to extract ideas from sophisticated prose, David Mulroy worries, but also it leaves us with the…

  14. Existential Grammar for Composition.

    ERIC Educational Resources Information Center

    Merchant, Frank

    The teaching of grammar has been in sad decline since medieval times, when it included the whole skill of creating in language. Our textbook community has moved through a series of ineffective fashions, from those of Fries to post-Chomsky. All have presumed to replace prescriptive rules with realistic explanations. But all have fallen, like the…

  15. Functional Grammar and Its Implications for English Teaching and Learning

    ERIC Educational Resources Information Center

    Feng, Zhiwen

    2013-01-01

    Functional grammar has received more and more attention from domestic scholars in the world of linguistics since 1970s, but it is still new to most EFL teachers. In spite of controversies about its applications into classroom teaching, this new grammar model has its own advantages and can facilitate EFL students to achieve academic success. This…

  16. Towards a Rationale for Research into Grammar Teaching in Schools

    ERIC Educational Resources Information Center

    Fontich, Xavier; Camps, Anna

    2014-01-01

    This article hopes to bring new insights to the debate about the effect of grammar knowledge on language use, especially writing. It raises the question of the need to look more closely at the following three questions: (1) What is the aim of grammar teaching?; (2) How capable are students of conceptualising about language and how is their…

  17. ULTRA: Universal Grammar as a Universal Parser

    PubMed Central

    Medeiros, David P.

    2018-01-01

    A central concern of generative grammar is the relationship between hierarchy and word order, traditionally understood as two dimensions of a single syntactic representation. A related concern is directionality in the grammar. Traditional approaches posit process-neutral grammars, embodying knowledge of language, put to use with infinite facility both for production and comprehension. This has crystallized in the view of Merge as the central property of syntax, perhaps its only novel feature. A growing number of approaches explore grammars with different directionalities, often with more direct connections to performance mechanisms. This paper describes a novel model of universal grammar as a one-directional, universal parser. Mismatch between word order and interpretation order is pervasive in comprehension; in the present model, word order is language-particular and interpretation order (i.e., hierarchy) is universal. These orders are not two dimensions of a unified abstract object (e.g., precedence and dominance in a single tree); rather, both are temporal sequences, and UG is an invariant real-time procedure (based on Knuth's stack-sorting algorithm) transforming word order into hierarchical order. This shift in perspective has several desirable consequences. It collapses linearization, displacement, and composition into a single performance process. The architecture provides a novel source of brackets (labeled unambiguously and without search), which are understood not as part-whole constituency relations, but as storage and retrieval routines in parsing. It also explains why neutral word order within single syntactic cycles avoids 213-like permutations. The model identifies cycles as extended projections of lexical heads, grounding the notion of phase. This is achieved with a universal processor, dispensing with parameters. The empirical focus is word order in noun phrases. This domain provides some of the clearest evidence for 213-avoidance as a cross

  18. Linguistic Grammar Learning and DRD2-TAQ-IA Polymorphism

    PubMed Central

    Wong, Patrick C. M.; Ettlinger, Marc; Zheng, Jing

    2013-01-01

    As research into the neurobiology of language has focused primarily on the systems level, fewer studies have examined the link between molecular genetics and normal variations in language functions. Because the ability to learn a language varies in adults and our genetic codes also vary, research linking the two provides a unique window into the molecular neurobiology of language. We consider a candidate association between the dopamine receptor D2 gene (DRD2) and linguistic grammar learning. DRD2-TAQ-IA polymorphism (rs1800497) is associated with dopamine receptor D2 distribution and dopamine impact in the human striatum, such that A1 allele carriers show reduction in D2 receptor binding relative to carriers who are homozygous for the A2 allele. The individual differences in grammatical rule learning that are particularly prevalent in adulthood are also associated with striatal function and its role in domain-general procedural memory. Therefore, we reasoned that procedurally-based grammar learning could be associated with DRD2-TAQ-IA polymorphism. Here, English-speaking adults learned artificial concatenative and analogical grammars, which have been respectively associated with procedural and declarative memory. Language learning capabilities were tested while learners’ neural hemodynamic responses were simultaneously measured by fMRI. Behavioral learning and brain activation data were subsequently compared with the learners’ DRD2 (rs1800497) genotype. Learners who were homozygous for the A2 allele were better at concatenative (but not analogical) grammar learning and had higher striatal responses relative to those who have at least one A1 allele. These results provide preliminary evidence for the neurogenetic basis of normal variations in linguistic grammar learning and its link to domain-general functions. PMID:23741438

  19. The Influence of Texting Language on Grammar and Executive Functions in Primary School Children.

    PubMed

    van Dijk, Chantal N; van Witteloostuijn, Merel; Vasić, Nada; Avrutin, Sergey; Blom, Elma

    2016-01-01

    When sending text messages on their mobile phone to friends, children often use a special type of register, which is called textese. This register allows the omission of words and the use of textisms: instances of non-standard written language such as 4ever (forever). Previous studies have shown that textese has a positive effect on children's literacy abilities. In addition, it is possible that children's grammar system is affected by textese as well, as grammar rules are often transgressed in this register. Therefore, the main aim of this study was to investigate whether the use of textese influences children's grammar performance, and whether this effect is specific to grammar or language in general. Additionally, studies have not yet investigated the influence of textese on children's cognitive abilities. Consequently, the secondary aim of this study was to find out whether textese affects children's executive functions. To investigate this, 55 children between 10 and 13 years old were tested on a receptive vocabulary and grammar performance (sentence repetition) task and various tasks measuring executive functioning. In addition, text messages were elicited and the number of omissions and textisms in children's messages were calculated. Regression analyses showed that omissions were a significant predictor of children's grammar performance after various other variables were controlled for: the more words children omitted in their text messages, the better their performance on the grammar task. Although textisms correlated (marginally) significantly with vocabulary, grammar and selective attention scores and omissions marginally significantly with vocabulary scores, no other significant effects were obtained for measures of textese in the regression analyses: neither for the language outcomes, nor for the executive function tasks. Hence, our results show that textese is positively related to children's grammar performance. On the other hand, use of textese does

  20. Grammar Correction in the Writing Centre: Expectations and Experiences of Monolingual and Multilingual Writers

    ERIC Educational Resources Information Center

    Eckstein, Grant

    2016-01-01

    Although most writing centres maintain policies against providing grammar correction during writing tutorials, it is undeniable that students expect some level of grammar intervention there. Just how much students expect and receive is a matter of speculation. This article examines the grammar-correction issue by reporting on a survey of L1, L2,…

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

    ERIC Educational Resources Information Center

    Öçal, Mehmet Fatih

    2017-01-01

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

  2. Quelques problemes poses a la grammaire casuelle (Some Problems Regarding Case Grammar)

    ERIC Educational Resources Information Center

    Fillmore, Charles J.

    1975-01-01

    Discusses problems related to case grammar theory, including: the organizations of a case grammar; determination of semantic roles; definition and hierarchy of cases; cause-effect relations; and formalization and notation. (Text is in French.) (AM)

  3. Proceedings of a Conference--"The Future of Grammar in American Schools" (Winchester, VA, August 10-11, 1990).

    ERIC Educational Resources Information Center

    National Council of Teachers of English, Urbana, IL. Assembly for the Teaching of English Grammar.

    Providing alternatives to the way grammar is taught, this proceedings includes every paper (or summary) except one delivered at a conference on the future of grammar in American schools. Papers in the proceedings are: "Keynote: The Future of Grammar in American Schools" (Martha Kolln); "Approaches to Grammar: Teaching &…

  4. Evaluation of Graph Pattern Matching Workloads in Graph Analysis Systems

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

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

    2016-01-01

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

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

    NASA Astrophysics Data System (ADS)

    Nagarathinam, R.; Parvathi, N.

    2018-04-01

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

  6. Input-Based Approaches to Teaching Grammar: A Review of Classroom-Oriented Research.

    ERIC Educational Resources Information Center

    Ellis, Rod

    1999-01-01

    Examines the theoretical rationales (universal grammar, information-processing theories, skill-learning theories) for input-based grammar teaching and reviews classroom-oriented research (i.e., enriched-input studies, input-processing studies) that has integrated this option. (Author/VWL)

  7. The Journalism Writing Course: Evaluation of Hybrid versus Online Grammar Instruction

    ERIC Educational Resources Information Center

    Moore, Jensen; Jones, Khristen

    2015-01-01

    This study examined introductory journalism writing courses and compared hybrid (part online/part classroom) versus online grammar instruction. The hybrid structure allowed for grammar topics to be taught online, with a pretest following, and then reviewing missed/difficult pretest concepts in class prior to a posttest. The quasi-experimental…

  8. Effective Intervention for Expressive Grammar in Children with Specific Language Impairment

    ERIC Educational Resources Information Center

    Smith-Lock, Karen M.; Leitao, Suze; Lambert, Lara; Nickels, Lyndsey

    2013-01-01

    Background: Children with specific language impairment are known to struggle with expressive grammar. While some studies have shown successful intervention under laboratory conditions, there is a paucity of evidence for the effectiveness of grammar treatment in young children in community settings. Aim: To evaluate the effectiveness of a…

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

    NASA Astrophysics Data System (ADS)

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

    2016-05-01

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

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

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

    Sengupta, Dipanjan; Agarwal, Kapil; Song, Shuaiwen

    2015-09-30

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

  11. Graphing Polar Curves

    ERIC Educational Resources Information Center

    Lawes, Jonathan F.

    2013-01-01

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

  12. My New Teaching Partner? Using the Grammar Checker in Writing Instruction

    ERIC Educational Resources Information Center

    Potter, Reva; Fuller, Dorothy

    2008-01-01

    Grammar checkers do not claim to teach grammar; they are tools to bring potential problems to the writer's attention. They also offer only formal and Standard English preferences, limiting the freer expression of some literary forms. Without guidance, students may misuse the checker, become frustrated, and feel discouraged. Users must be…

  13. Students' Attitudes towards Learning English Grammar: A Study of Scale Development

    ERIC Educational Resources Information Center

    Akay, Emel; Toraman, Çetin

    2015-01-01

    Learning a language means not only studying four skills of proficiency, but also understanding the system of rules underlying. In this respect, learners' attitudes towards grammar are also of vital importance. The main objective of this descriptive study is to determine English language learners' attitudes towards grammar and to analyze these…

  14. The declarative/procedural model of lexicon and grammar.

    PubMed

    Ullman, M T

    2001-01-01

    Our use of language depends upon two capacities: a mental lexicon of memorized words and a mental grammar of rules that underlie the sequential and hierarchical composition of lexical forms into predictably structured larger words, phrases, and sentences. The declarative/procedural model posits that the lexicon/grammar distinction in language is tied to the distinction between two well-studied brain memory systems. On this view, the memorization and use of at least simple words (those with noncompositional, that is, arbitrary form-meaning pairings) depends upon an associative memory of distributed representations that is subserved by temporal-lobe circuits previously implicated in the learning and use of fact and event knowledge. This "declarative memory" system appears to be specialized for learning arbitrarily related information (i.e., for associative binding). In contrast, the acquisition and use of grammatical rules that underlie symbol manipulation is subserved by frontal/basal-ganglia circuits previously implicated in the implicit (nonconscious) learning and expression of motor and cognitive "skills" and "habits" (e.g., from simple motor acts to skilled game playing). This "procedural" system may be specialized for computing sequences. This novel view of lexicon and grammar offers an alternative to the two main competing theoretical frameworks. It shares the perspective of traditional dual-mechanism theories in positing that the mental lexicon and a symbol-manipulating mental grammar are subserved by distinct computational components that may be linked to distinct brain structures. However, it diverges from these theories where they assume components dedicated to each of the two language capacities (that is, domain-specific) and in their common assumption that lexical memory is a rote list of items. Conversely, while it shares with single-mechanism theories the perspective that the two capacities are subserved by domain-independent computational mechanisms

  15. The Grammar of Artifactual Action.

    ERIC Educational Resources Information Center

    Bhola, H. S.

    This paper examines the process of intervention design as it relates to the grammar of artifactual action. In his discussion, the author identifies three separate elements of artifactual action. These elements include defining the situation of action and the change agent's relationship to the situation; generating typical expectations about…

  16. Theories of Artificial Grammar Learning

    ERIC Educational Resources Information Center

    Pothos, Emmanuel M.

    2007-01-01

    Artificial grammar learning (AGL) is one of the most commonly used paradigms for the study of implicit learning and the contrast between rules, similarity, and associative learning. Despite five decades of extensive research, however, a satisfactory theoretical consensus has not been forthcoming. Theoretical accounts of AGL are reviewed, together…

  17. Interval Graph Limits

    PubMed Central

    Diaconis, Persi; Holmes, Susan; Janson, Svante

    2015-01-01

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

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

  19. A REFERENCE GRAMMAR OF ADAMAWA FULANI. AFRICAN LANGUAGE MONOGRAPH NUMBER 8.

    ERIC Educational Resources Information Center

    STENNES, LESLIE H.

    THIS REFERENCE WORK IS A STRUCTURAL GRAMMAR OF THE ADAMAWA DIALECT OF FULANI AS SPOKEN IN NIGERIA AND CAMEROUN. IT IS PRIMARILY WRITTEN FOR LINGUISTS AND THOSE WHO ALREADY KNOW FULANI. THE GRAMMAR IS DIVIDED INTO THREE PARTS--(1) PHONEMICS AND MORPHOPHONEMICS, DISCUSSING SEGMENTAL AND SUPRASEGMENTAL PHONEMES, PERMITTED SEQUENCES OF PHONEMES,…

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

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

  2. The Influence of Texting Language on Grammar and Executive Functions in Primary School Children

    PubMed Central

    van Dijk, Chantal N.; van Witteloostuijn, Merel; Vasić, Nada; Avrutin, Sergey; Blom, Elma

    2016-01-01

    When sending text messages on their mobile phone to friends, children often use a special type of register, which is called textese. This register allows the omission of words and the use of textisms: instances of non-standard written language such as 4ever (forever). Previous studies have shown that textese has a positive effect on children’s literacy abilities. In addition, it is possible that children’s grammar system is affected by textese as well, as grammar rules are often transgressed in this register. Therefore, the main aim of this study was to investigate whether the use of textese influences children’s grammar performance, and whether this effect is specific to grammar or language in general. Additionally, studies have not yet investigated the influence of textese on children’s cognitive abilities. Consequently, the secondary aim of this study was to find out whether textese affects children’s executive functions. To investigate this, 55 children between 10 and 13 years old were tested on a receptive vocabulary and grammar performance (sentence repetition) task and various tasks measuring executive functioning. In addition, text messages were elicited and the number of omissions and textisms in children’s messages were calculated. Regression analyses showed that omissions were a significant predictor of children’s grammar performance after various other variables were controlled for: the more words children omitted in their text messages, the better their performance on the grammar task. Although textisms correlated (marginally) significantly with vocabulary, grammar and selective attention scores and omissions marginally significantly with vocabulary scores, no other significant effects were obtained for measures of textese in the regression analyses: neither for the language outcomes, nor for the executive function tasks. Hence, our results show that textese is positively related to children’s grammar performance. On the other hand, use

  3. Developmental Constraints on Learning Artificial Grammars with Fixed, Flexible and Free Word Order

    PubMed Central

    Nowak, Iga; Baggio, Giosuè

    2017-01-01

    Human learning, although highly flexible and efficient, is constrained in ways that facilitate or impede the acquisition of certain systems of information. Some such constraints, active during infancy and childhood, have been proposed to account for the apparent ease with which typically developing children acquire language. In a series of experiments, we investigated the role of developmental constraints on learning artificial grammars with a distinction between shorter and relatively frequent words (‘function words,’ F-words) and longer and less frequent words (‘content words,’ C-words). We constructed 4 finite-state grammars, in which the order of F-words, relative to C-words, was either fixed (F-words always occupied the same positions in a string), flexible (every F-word always followed a C-word), or free. We exposed adults (N = 84) and kindergarten children (N = 100) to strings from each of these artificial grammars, and we assessed their ability to recognize strings with the same structure, but a different vocabulary. Adults were better at recognizing strings when regularities were available (i.e., fixed and flexible order grammars), while children were better at recognizing strings from the grammars consistent with the attested distribution of function and content words in natural languages (i.e., flexible and free order grammars). These results provide evidence for a link between developmental constraints on learning and linguistic typology. PMID:29089910

  4. mpiGraph

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

    Moody, Adam

    2007-05-22

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

  5. Kanasi: A Brief Grammar Sketch.

    ERIC Educational Resources Information Center

    Pappenhagen, Ronald W.

    An outline of the grammar of Kanasi, a non-Austronesian language in the Indo-Pacific family of the Daga branch and spoken in Papua New Guinea, includes analysis of noun phrases (numerals and descriptive modifiers, genitive constructions, and adpositions); verbs (affixes; tense, aspect, and moods; and causation); predicate nominals; existential,…

  6. Teachers' Attitudes towards Teaching English Grammar: A Scale Development Study

    ERIC Educational Resources Information Center

    Polat, Murat

    2017-01-01

    In most ELT classes, the importance of grammar, how it should be taught or how much it should be integrated into language teaching are still matters of discussion. Considering this fact, learning teachers' attitudes towards teaching grammar is significantly valuable for researchers. This study thus aimed to design a scale that identifies teachers'…

  7. Density of Visual Input Enhancement and Grammar Learning: A Research Proposal

    ERIC Educational Resources Information Center

    Tran, Thu Hoang

    2009-01-01

    Research in the field of second language acquisition (SLA) has been done to ascertain the effectiveness of visual input enhancement (VIE) on grammar learning. However, one issue remains unexplored: the effects of VIE density on grammar learning. This paper presents a research proposal to investigate the effects of the density of VIE on English…

  8. Survival time of the susceptible-infected-susceptible infection process on a graph.

    PubMed

    van de Bovenkamp, Ruud; Van Mieghem, Piet

    2015-09-01

    The survival time T is the longest time that a virus, a meme, or a failure can propagate in a network. Using the hitting time of the absorbing state in an uniformized embedded Markov chain of the continuous-time susceptible-infected-susceptible (SIS) Markov process, we derive an exact expression for the average survival time E[T] of a virus in the complete graph K_{N} and the star graph K_{1,N-1}. By using the survival time, instead of the average fraction of infected nodes, we propose a new method to approximate the SIS epidemic threshold τ_{c} that, at least for K_{N} and K_{1,N-1}, correctly scales with the number of nodes N and that is superior to the epidemic threshold τ_{c}^{(1)}=1/λ_{1} of the N-intertwined mean-field approximation, where λ_{1} is the spectral radius of the adjacency matrix of the graph G. Although this new approximation of the epidemic threshold offers a more intuitive understanding of the SIS process, it remains difficult to compare outbreaks in different graph types. For example, the survival in an arbitrary graph seems upper bounded by the complete graph and lower bounded by the star graph as a function of the normalized effective infection rate τ/τ_{c}^{(1)}. However, when the average fraction of infected nodes is used as a basis for comparison, the virus will survive in the star graph longer than in any other graph, making the star graph the worst-case graph instead of the complete graph. Finally, in non-Markovian SIS, the distribution of the spreading attempts over the infectious period of a node influences the survival time, even if the expected number of spreading attempts during an infectious period (the non-Markovian equivalent of the effective infection rate) is kept constant. Both early and late infection attempts lead to shorter survival times. Interestingly, just as in Markovian SIS, the survival times appear to be exponentially distributed, regardless of the infection and curing time distributions.

  9. Teaching Grammar through Task-Based Language Teaching to Young EFL Learners

    ERIC Educational Resources Information Center

    Yildiz, Mustafa; Senel, Mufit

    2017-01-01

    The present study investigates the effects of Task-Based Language Teaching on students' grammar knowledge in the field of teaching grammar. It has been studied with 32 students from 8th grade during a two-and-a-half-month process. Throughout this process, students firstly are applied a pre-test to examine their level and to confirm whether there…

  10. A Grammar of Inupiaq Morphosyntax

    ERIC Educational Resources Information Center

    Lanz, Linda A.

    2010-01-01

    This dissertation is a reference grammar of the Malimiut Coastal dialect of Inupiaq (ISO: ESI, ESK, IPK), an Eskimo-Aleut language of northwestern Alaska spoken by the Inupiat people. It complements existing descriptions of Inupiaq by filling gaps in documentation. With approximately 2000 speakers, mainly above 50 years of age, Inupiaq is…

  11. Grammar Texts and Consumerist Subtexts

    ERIC Educational Resources Information Center

    Sokolik, M. E.

    2007-01-01

    While several checklists exist for the evaluation of ESL/EFL textbooks, none includes suggestions for looking for specific biases, especially those found in the content of examples and sample sentences. Growing awareness in publishing has reduced problems in the presentation of gender-based and racial biases in most ESL/EFL grammar textbooks, but…

  12. Readings in Applied Transformational Grammar.

    ERIC Educational Resources Information Center

    Lester, Mark, Ed.

    This volume contains nineteen essays, dealing with various aspects of transformational grammar, by scholars such as Noam Chomsky, Eric H. Lenneberg, and Leon Jakobovits. These essays have been reprinted from sources such as "College English" and "Language Learning" and are intended for the most part for a nontechnical audience. The anthology is…

  13. Transformational Grammar and Cognitive Psycholinguistics.

    ERIC Educational Resources Information Center

    Lester, Mark

    1973-01-01

    An overview of Noam Chomsky's theories about transformational grammar and phonology is given. Since Chomsky was interested in characterizing what it is to know a language, the ways in which we demonstrate knowledge of our native language are discussed in detail. Particular emphasis is placed on describing how the transformational approach actually…

  14. Media Grammars, Generations, and Media Gaps.

    ERIC Educational Resources Information Center

    Gumpert, Gary; Cathcart, Robert

    1985-01-01

    Argues that people are connected or separated more by media experience than by chronological years. Examines how media develop their own grammars, how individuals acquire media literacy, and the effects of media literacy on ways people relate to each other. (PD)

  15. Assessing Primary Literacy through Grammar Tests

    ERIC Educational Resources Information Center

    Hodgson, John

    2017-01-01

    Originally an editorial for "English in Education," this short article summarises key issues in the imposition of a separate test for grammar, punctuation and spelling. It illustrates the poor foundations, lack of clarity and distortion of curriculum which invalidate the test.

  16. Speed of evolution on graphs

    NASA Astrophysics Data System (ADS)

    Sui, Xiukai; Wu, Bin; Wang, Long

    2015-12-01

    The likelihood that a mutant fixates in the wild population, i.e., fixation probability, has been intensively studied in evolutionary game theory, where individuals' fitness is frequency dependent. However, it is of limited interest when it takes long to take over. Thus the speed of evolution becomes an important issue. In general, it is still unclear how fixation times are affected by the population structure, although the fixation times have already been addressed in the well-mixed populations. Here we theoretically address this issue by pair approximation and diffusion approximation on regular graphs. It is shown (i) that under neutral selection, both unconditional and conditional fixation time are shortened by increasing the number of neighbors; (ii) that under weak selection, for the simplified prisoner's dilemma game, if benefit-to-cost ratio exceeds the degree of the graph, then the unconditional fixation time of a single cooperator is slower than that in the neutral case; and (iii) that under weak selection, for the conditional fixation time, limited neighbor size dilutes the counterintuitive stochastic slowdown which was found in well-mixed populations. Interestingly, we find that all of our results can be interpreted as that in the well-mixed population with a transformed payoff matrix. This interpretation is also valid for both death-birth and birth-death processes on graphs. This interpretation bridges the fixation time in the structured population and that in the well-mixed population. Thus it opens the avenue to investigate the challenging fixation time in structured populations by the known results in well-mixed populations.

  17. Mobile-Assisted Grammar Exercises: Effects on Self-Editing in L2 Writing

    ERIC Educational Resources Information Center

    Li, Zhi; Hegelheimer, Volker

    2013-01-01

    In this paper, we report on the development and implementation of a web-based mobile application, "Grammar Clinic," for an ESL writing class. Drawing on insights from the interactionist approach to Second Language Acquisition (SLA), the Noticing Hypothesis, and mobile-assisted language learning (MALL), "Grammar Clinic" was…

  18. The Role of Simple Semantics in the Process of Artificial Grammar Learning

    ERIC Educational Resources Information Center

    Öttl, Birgit; Jäger, Gerhard; Kaup, Barbara

    2017-01-01

    This study investigated the effect of semantic information on artificial grammar learning (AGL). Recursive grammars of different complexity levels (regular language, mirror language, copy language) were investigated in a series of AGL experiments. In the with-semantics condition, participants acquired semantic information prior to the AGL…

  19. Graph theory approach to the eigenvalue problem of large space structures

    NASA Technical Reports Server (NTRS)

    Reddy, A. S. S. R.; Bainum, P. M.

    1981-01-01

    Graph theory is used to obtain numerical solutions to eigenvalue problems of large space structures (LSS) characterized by a state vector of large dimensions. The LSS are considered as large, flexible systems requiring both orientation and surface shape control. Graphic interpretation of the determinant of a matrix is employed to reduce a higher dimensional matrix into combinations of smaller dimensional sub-matrices. The reduction is implemented by means of a Boolean equivalent of the original matrices formulated to obtain smaller dimensional equivalents of the original numerical matrix. Computation time becomes less and more accurate solutions are possible. An example is provided in the form of a free-free square plate. Linearized system equations and numerical values of a stiffness matrix are presented, featuring a state vector with 16 components.

  20. Automatic event recognition and anomaly detection with attribute grammar by learning scene semantics

    NASA Astrophysics Data System (ADS)

    Qi, Lin; Yao, Zhenyu; Li, Li; Dong, Junyu

    2007-11-01

    In this paper we present a novel framework for automatic event recognition and abnormal behavior detection with attribute grammar by learning scene semantics. This framework combines learning scene semantics by trajectory analysis and constructing attribute grammar-based event representation. The scene and event information is learned automatically. Abnormal behaviors that disobey scene semantics or event grammars rules are detected. By this method, an approach to understanding video scenes is achieved. Further more, with this prior knowledge, the accuracy of abnormal event detection is increased.

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

    DTIC Science & Technology

    2017-09-01

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

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

  3. Electrical Stimulation of Broca's Area Enhances Implicit Learning of an Artificial Grammar

    ERIC Educational Resources Information Center

    de Vries, Meinou H.; Barth, Andre C. R.; Maiworm, Sandra; Knecht, Stefan; Zwitserlood, Pienie; Floel, Agnes

    2010-01-01

    Artificial grammar learning constitutes a well-established model for the acquisition of grammatical knowledge in a natural setting. Previous neuroimaging studies demonstrated that Broca's area (left BA 44/45) is similarly activated by natural syntactic processing and artificial grammar learning. The current study was conducted to investigate the…

  4. The Place of Grammar in the ESL/EFL Classroom: An Annotated Bibliography.

    ERIC Educational Resources Information Center

    Kotapish, Carl E.

    This annotated bibliography includes citations of journal articles and book chapters that focus on current theories related to teaching grammar in English-as-a-Second-Language and English-as-a-Foreign-Language classrooms. Citations include: (1) "Field Independence-Dependence and the Teaching of Grammar" (R. G. Abraham); (2) "Making…

  5. A Diversity of Grammars: Breaking the Boundaries of "The Well Made Box."

    ERIC Educational Resources Information Center

    Sidler, Michelle

    In his 1976 article, "Grammars of Style: New Options in Composition," Winston Weathers calls for a Grammar B, an alternate set of conventions which govern the construction of whole compositions. He urges compositionists to look beyond the "well-made box" and consider other options for compositional patterns and discourse…

  6. The Association between Expressive Grammar Intervention and Social and Emergent Literacy Outcomes for Preschoolers with SLI

    ERIC Educational Resources Information Center

    Washington, Karla N.

    2013-01-01

    Purpose: To determine whether (a) expressive grammar intervention facilitated social and emergent literacy outcomes better than no intervention and (b) expressive grammar gains and/or initial expressive grammar level predicted social and emergent literacy outcomes. Method: This investigation was a follow-up to a recently published study exploring…

  7. Quantization of gauge fields, graph polynomials and graph homology

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

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

    2013-09-15

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

  8. Maxent Harmonic Grammars and Phonetic Duration

    ERIC Educational Resources Information Center

    Lefkowitz, Lee Michael

    2017-01-01

    Research in phonetics has established the grammatical status of gradient phonetic patterns in language, suggesting that there is a component of the grammar that governs systematic relationships between discrete phonological representations and gradiently continuous acoustic or articulatory phonetic representations. This dissertation joins several…

  9. Graphing trillions of triangles

    PubMed Central

    Burkhardt, Paul

    2016-01-01

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

  10. Graphing trillions of triangles.

    PubMed

    Burkhardt, Paul

    2017-07-01

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

  11. Computation-Friendly Shape Grammars with Application to Determining the Interior Layout of Buildings from Image Data

    ERIC Educational Resources Information Center

    Yue, Kui

    2009-01-01

    A shape grammar is a formalism that has been widely applied, in many different fields, to analyzing designs. Computer implementation of a shape grammar interpreter is vital to both research and application. However, implementing a shape grammar interpreter is hard, especially for parametric shapes defined by open terms. This dissertation…

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

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

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

    Sengupta, Dipanjan; Song, Shuaiwen

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

  14. A Lifetime of Grammar Teaching

    ERIC Educational Resources Information Center

    Ellis, Rod

    2012-01-01

    The author has worked as a language teacher, teacher educator, and second language acquisition (SLA) researcher for over forty years. During this time grammar has figured largely in his thinking, in part because it has traditionally been so central to language pedagogy and in part because he became fascinated with how the human mind grapples with…

  15. Leader-following control of multiple nonholonomic systems over directed communication graphs

    NASA Astrophysics Data System (ADS)

    Dong, Wenjie; Djapic, Vladimir

    2016-06-01

    This paper considers the leader-following control problem of multiple nonlinear systems with directed communication topology and a leader. If the state of each system is measurable, distributed state feedback controllers are proposed using neighbours' state information with the aid of Lyapunov techniques and properties of Laplacian matrix for time-invariant communication graph and time-varying communication graph. It is shown that the state of each system exponentially converges to the state of a leader. If the state of each system is not measurable, distributed observer-based output feedback control laws are proposed. As an application of the proposed results, formation control of wheeled mobile robots is studied. The simulation results show the effectiveness of the proposed results.

  16. Thermodynamic characterization of networks using graph polynomials

    NASA Astrophysics Data System (ADS)

    Ye, Cheng; Comin, César H.; Peron, Thomas K. DM.; Silva, Filipi N.; Rodrigues, Francisco A.; Costa, Luciano da F.; Torsello, Andrea; Hancock, Edwin R.

    2015-09-01

    In this paper, we present a method for characterizing the evolution of time-varying complex networks by adopting a thermodynamic representation of network structure computed from a polynomial (or algebraic) characterization of graph structure. Commencing from a representation of graph structure based on a characteristic polynomial computed from the normalized Laplacian matrix, we show how the polynomial is linked to the Boltzmann partition function of a network. This allows us to compute a number of thermodynamic quantities for the network, including the average energy and entropy. Assuming that the system does not change volume, we can also compute the temperature, defined as the rate of change of entropy with energy. All three thermodynamic variables can be approximated using low-order Taylor series that can be computed using the traces of powers of the Laplacian matrix, avoiding explicit computation of the normalized Laplacian spectrum. These polynomial approximations allow a smoothed representation of the evolution of networks to be constructed in the thermodynamic space spanned by entropy, energy, and temperature. We show how these thermodynamic variables can be computed in terms of simple network characteristics, e.g., the total number of nodes and node degree statistics for nodes connected by edges. We apply the resulting thermodynamic characterization to real-world time-varying networks representing complex systems in the financial and biological domains. The study demonstrates that the method provides an efficient tool for detecting abrupt changes and characterizing different stages in network evolution.

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

    PubMed Central

    Angra, Aakanksha; Gardner, Stephanie M.

    2017-01-01

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

  18. Learning and Inductive Inference

    DTIC Science & Technology

    1982-07-01

    a set of graph grammars to describe visual scenes . Other researchers have applied graph grammars to the pattern recognition of handwritten characters...345 1. Issues / 345 2. Mostows’ operationalizer / 350 0. Learning from ezamples / 360 1. Issues / 3t60 2. Learning in control and pattern recognition ...art.icleis on rote learntinig and ailvice- tAik g. K(ennieth Clarkson contributed Ltte article on grmvit atical inference, anid Geoff’ lroiney wrote

  19. What exactly is Universal Grammar, and has anyone seen it?

    PubMed Central

    Dąbrowska, Ewa

    2015-01-01

    Universal Grammar (UG) is a suspect concept. There is little agreement on what exactly is in it; and the empirical evidence for it is very weak. This paper critically examines a variety of arguments that have been put forward as evidence for UG, focussing on the three most powerful ones: universality (all human languages share a number of properties), convergence (all language learners converge on the same grammar in spite of the fact that they are exposed to different input), and poverty of the stimulus (children know things about language which they could not have learned from the input available to them). I argue that these arguments are based on premises which are either false or unsubstantiated. Languages differ from each other in profound ways, and there are very few true universals, so the fundamental crosslinguistic fact that needs explaining is diversity, not universality. A number of recent studies have demonstrated the existence of considerable differences in adult native speakers’ knowledge of the grammar of their language, including aspects of inflectional morphology, passives, quantifiers, and a variety of more complex constructions, so learners do not in fact converge on the same grammar. Finally, the poverty of the stimulus argument presupposes that children acquire linguistic representations of the kind postulated by generative grammarians; constructionist grammars such as those proposed by Tomasello, Goldberg and others can be learned from the input. We are the only species that has language, so there must be something unique about humans that makes language learning possible. The extent of crosslinguistic diversity and the considerable individual differences in the rate, style and outcome of acquisition suggest that it is more promising to think in terms of a language-making capacity, i.e., a set of domain-general abilities, rather than an innate body of knowledge about the structural properties of the target system. PMID:26157406

  20. Phonological Memory and the Acquisition of Grammar in Child L2 Learners

    ERIC Educational Resources Information Center

    Verhagen, Josje; Leseman, Paul; Messer, Marielle

    2015-01-01

    Previous studies show that second language (L2) learners with large phonological memory spans outperform learners with smaller memory spans on tests of L2 grammar. The current study investigated the relationship between phonological memory and L2 grammar in more detail than has been done earlier. Specifically, we asked how phonological memory…

  1. Bolivian Indian Grammars: I and II. Summer Institute of Linguistics Publications in Linguistics and Related Fields.

    ERIC Educational Resources Information Center

    Matteson, Esther, Ed.

    Ten grammars of indigenous Bolivian languages are presented in these two volumes of Bolivian Indian Grammars. The data were gathered and analyzed by members of the Bolivian Branch of the Summer Institute of Linguistics, which has carried on linguistic investigations in Bolivia since 1955. The grammars are presented in the tagmemic model of Pike…

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

  3. A Grammar Library for Information Structure

    ERIC Educational Resources Information Center

    Song, Sanghoun

    2014-01-01

    This dissertation makes substantial contributions to both the theoretical and computational treatment of information structure, with an eye toward creating natural language processing applications such as multilingual machine translation systems. The aim of the present dissertation is to create a grammar library of information structure for the…

  4. The relation between receptive grammar and procedural, declarative, and working memory in specific language impairment.

    PubMed

    Conti-Ramsden, Gina; Ullman, Michael T; Lum, Jarrad A G

    2015-01-01

    What memory systems underlie grammar in children, and do these differ between typically developing (TD) children and children with specific language impairment (SLI)? Whilst there is substantial evidence linking certain memory deficits to the language problems in children with SLI, few studies have investigated multiple memory systems simultaneously, examining not only possible memory deficits but also memory abilities that may play a compensatory role. This study examined the extent to which procedural, declarative, and working memory abilities predict receptive grammar in 45 primary school aged children with SLI (30 males, 15 females) and 46 TD children (30 males, 16 females), both on average 9;10 years of age. Regression analyses probed measures of all three memory systems simultaneously as potential predictors of receptive grammar. The model was significant, explaining 51.6% of the variance. There was a significant main effect of learning in procedural memory and a significant group × procedural learning interaction. Further investigation of the interaction revealed that procedural learning predicted grammar in TD but not in children with SLI. Indeed, procedural learning was the only predictor of grammar in TD. In contrast, only learning in declarative memory significantly predicted grammar in SLI. Thus, different memory systems are associated with receptive grammar abilities in children with SLI and their TD peers. This study is, to our knowledge, the first to demonstrate a significant group by memory system interaction in predicting grammar in children with SLI and their TD peers. In line with Ullman's Declarative/Procedural model of language and procedural deficit hypothesis of SLI, variability in understanding sentences of varying grammatical complexity appears to be associated with variability in procedural memory abilities in TD children, but with declarative memory, as an apparent compensatory mechanism, in children with SLI.

  5. Network meta-analysis, electrical networks and graph theory.

    PubMed

    Rücker, Gerta

    2012-12-01

    Network meta-analysis is an active field of research in clinical biostatistics. It aims to combine information from all randomized comparisons among a set of treatments for a given medical condition. We show how graph-theoretical methods can be applied to network meta-analysis. A meta-analytic graph consists of vertices (treatments) and edges (randomized comparisons). We illustrate the correspondence between meta-analytic networks and electrical networks, where variance corresponds to resistance, treatment effects to voltage, and weighted treatment effects to current flows. Based thereon, we then show that graph-theoretical methods that have been routinely applied to electrical networks also work well in network meta-analysis. In more detail, the resulting consistent treatment effects induced in the edges can be estimated via the Moore-Penrose pseudoinverse of the Laplacian matrix. Moreover, the variances of the treatment effects are estimated in analogy to electrical effective resistances. It is shown that this method, being computationally simple, leads to the usual fixed effect model estimate when applied to pairwise meta-analysis and is consistent with published results when applied to network meta-analysis examples from the literature. Moreover, problems of heterogeneity and inconsistency, random effects modeling and including multi-armed trials are addressed. Copyright © 2012 John Wiley & Sons, Ltd. Copyright © 2012 John Wiley & Sons, Ltd.

  6. Terminator Detection by Support Vector Machine Utilizing aStochastic Context-Free Grammar

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

    Francis-Lyon, Patricia; Cristianini, Nello; Holbrook, Stephen

    2006-12-30

    A 2-stage detector was designed to find rho-independent transcription terminators in the Escherichia coli genome. The detector includes a Stochastic Context Free Grammar (SCFG) component and a Support Vector Machine (SVM) component. To find terminators, the SCFG searches the intergenic regions of nucleotide sequence for local matches to a terminator grammar that was designed and trained utilizing examples of known terminators. The grammar selects sequences that are the best candidates for terminators and assigns them a prefix, stem-loop, suffix structure using the Cocke-Younger-Kasaami (CYK) algorithm, modified to incorporate energy affects of base pairing. The parameters from this inferred structure aremore » passed to the SVM classifier, which distinguishes terminators from non-terminators that score high according to the terminator grammar. The SVM was trained with negative examples drawn from intergenic sequences that include both featureless and RNA gene regions (which were assigned prefix, stem-loop, suffix structure by the SCFG), so that it successfully distinguishes terminators from either of these. The classifier was found to be 96.4% successful during testing.« less

  7. Grammar-based Automatic 3D Model Reconstruction from Terrestrial Laser Scanning Data

    NASA Astrophysics Data System (ADS)

    Yu, Q.; Helmholz, P.; Belton, D.; West, G.

    2014-04-01

    The automatic reconstruction of 3D buildings has been an important research topic during the last years. In this paper, a novel method is proposed to automatically reconstruct the 3D building models from segmented data based on pre-defined formal grammar and rules. Such segmented data can be extracted e.g. from terrestrial or mobile laser scanning devices. Two steps are considered in detail. The first step is to transform the segmented data into 3D shapes, for instance using the DXF (Drawing Exchange Format) format which is a CAD data file format used for data interchange between AutoCAD and other program. Second, we develop a formal grammar to describe the building model structure and integrate the pre-defined grammars into the reconstruction process. Depending on the different segmented data, the selected grammar and rules are applied to drive the reconstruction process in an automatic manner. Compared with other existing approaches, our proposed method allows the model reconstruction directly from 3D shapes and takes the whole building into account.

  8. "I'll Take Commas for $200": An Instructional Intervention Using Games to Help Students Master Grammar Skills

    ERIC Educational Resources Information Center

    Bullard, Sue Burzynski; Anderson, Nancy

    2014-01-01

    Effective writing requires mastering grammar. For journalists, this mastery is critical because research shows poor grammar erodes media credibility. College writing instructors say students do not understand basic grammar concepts, and greater numbers of students are enrolling in remedial writing classes. This quasi-experimental mixed methods…

  9. Nested Tracking Graphs

    DOE PAGES

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

    2017-06-01

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

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

  11. Impact of Gadget Based Learning of Grammar in English at Standard II

    ERIC Educational Resources Information Center

    Singaravelu, G.

    2014-01-01

    The study enlightens the impact of Gadget Based Learning of English Grammar at standard II. Objectives of the study is to find out the learning problems of the students of standard II in Learning English Grammar in Shri Vani Vilas Middle School and to find whether there is any significant difference in achievement mean score between pre test of…

  12. Le montage d'une grammaire seconde (The Construction of a Second Grammar)

    ERIC Educational Resources Information Center

    Adamczewski, Henri

    1975-01-01

    Discusses the influence of modern linguistic research on foreign language instruction. Shows the role of grammar 1 in the acquisition of grammar 2, and specifically when French is 1 and English is 2. Considers that conscious, systematic knowledge of L2, learned through L1, is positive for second language acquisition. (Text is in French.) (TL)

  13. German Grammar in the Students' Words: The "Essentialization" of German Grammar by American College-Level Learners

    ERIC Educational Resources Information Center

    Chavez, Monika

    2011-01-01

    This study of 134 college-level learners of German, enrolled in four years of instruction, showed them to "essentialize" German grammar when asked to describe it to a hypothetical friend. Kubota defined the term essentialization to capture learners' views of the target culture. Its main characteristic is the presupposition of "essential, stable,…

  14. On Anaphora and the Binding Principles in Categorial Grammar

    NASA Astrophysics Data System (ADS)

    Morrill, Glyn; Valentín, Oriol

    In type logical categorial grammar the analysis of an expression is a resource-conscious proof. Anaphora represents a particular challenge to this approach in that the antecedent resource is multiplied in the semantics. This duplication, which corresponds logically to the structural rule of contraction, may be treated lexically or syntactically. Furthermore, anaphora is subject to constraints, which Chomsky (1981) formulated as Binding Principles A, B, and C. In this paper we consider English anaphora in categorial grammar including reference to the binding principles. We invoke displacement calculus, modal categorial calculus, categorial calculus with limited contraction, and entertain addition of negation as failure.

  15. Teaching Grammar to Adult English Language Learners: Focus on Form. CAELA Network Brief

    ERIC Educational Resources Information Center

    Gallup Rodriguez, Amber

    2009-01-01

    Many adult English language learners place a high value on learning grammar. Perceiving a link between grammatical accuracy and effective communication, they associate excellent grammar with opportunities for employment and promotion, the attainment of educational goals, and social acceptance by native speakers. Reflecting the disagreement that…

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

  17. Grammaire et communication (Grammar and Communication).

    ERIC Educational Resources Information Center

    Stirman-Langlois, Martine

    1994-01-01

    A technique for teaching French grammar that involves reading, rereading, and analyzing the language in authentic materials is discussed. The student is led to recognition and generalization of structures in the text. Text examples used here include a comic strip and a publicity blurb for a French city. (MSE)

  18. The relationship between strategic control and conscious structural knowledge in artificial grammar learning.

    PubMed

    Norman, Elisabeth; Scott, Ryan B; Price, Mark C; Dienes, Zoltan

    2016-05-01

    We address Jacoby's (1991) proposal that strategic control over knowledge requires conscious awareness of that knowledge. In a two-grammar artificial grammar learning experiment all participants were trained on two grammars, consisting of a regularity in letter sequences, while two other dimensions (colours and fonts) varied randomly. Strategic control was measured as the ability to selectively apply the grammars during classification. For each classification, participants also made a combined judgement of (a) decision strategy and (b) relevant stimulus dimension. Strategic control was found for all types of decision strategy, including trials where participants claimed to lack conscious structural knowledge. However, strong evidence of strategic control only occurred when participants knew or guessed that the letter dimension was relevant, suggesting that strategic control might be associated with - or even causally requires - global awareness of the nature of the rules even though it does not require detailed knowledge of their content. Copyright © 2016 The Authors. Published by Elsevier Inc. All rights reserved.

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

    NASA Astrophysics Data System (ADS)

    Yunia Mayasari, Ratih; Atmojo Kusmayadi, Tri

    2018-04-01

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

  20. The "Contextual Contact" in Grammar Microteachings in Teaching English as a Foreign Language: A Teacher Training Perspective

    ERIC Educational Resources Information Center

    Sarigöz, Iskender Hakki

    2015-01-01

    The grammar microteachings carried out by trainees in teacher education is a critical issue due to the fact that the teaching of grammar has always been a controversial issue throughout the foreign language teaching (FLT) acculturation. There is always some negative reaction to isolated teaching of grammar in communicative language teaching…

  1. A Comparative Study on Beliefs of Grammar Teaching between High School English Teachers and Students in China

    ERIC Educational Resources Information Center

    Deng, Fangfang; Lin, Yuewu

    2016-01-01

    Grammar is "a system of rules governing the conventional arrangement and relationship of words in a sentence" (Brown 1994) which can facilitate the acquisition of a foreign language and is conducive for cultivating comprehensive language competence. Most teachers regard grammar as a frame of English learning. The grammar teaching beliefs…

  2. LeadMine: a grammar and dictionary driven approach to entity recognition.

    PubMed

    Lowe, Daniel M; Sayle, Roger A

    2015-01-01

    Chemical entity recognition has traditionally been performed by machine learning approaches. Here we describe an approach using grammars and dictionaries. This approach has the advantage that the entities found can be directly related to a given grammar or dictionary, which allows the type of an entity to be known and, if an entity is misannotated, indicates which resource should be corrected. As recognition is driven by what is expected, if spelling errors occur, they can be corrected. Correcting such errors is highly useful when attempting to lookup an entity in a database or, in the case of chemical names, converting them to structures. Our system uses a mixture of expertly curated grammars and dictionaries, as well as dictionaries automatically derived from public resources. We show that the heuristics developed to filter our dictionary of trivial chemical names (from PubChem) yields a better performing dictionary than the previously published Jochem dictionary. Our final system performs post-processing steps to modify the boundaries of entities and to detect abbreviations. These steps are shown to significantly improve performance (2.6% and 4.0% F1-score respectively). Our complete system, with incremental post-BioCreative workshop improvements, achieves 89.9% precision and 85.4% recall (87.6% F1-score) on the CHEMDNER test set. Grammar and dictionary approaches can produce results at least as good as the current state of the art in machine learning approaches. While machine learning approaches are commonly thought of as "black box" systems, our approach directly links the output entities to the input dictionaries and grammars. Our approach also allows correction of errors in detected entities, which can assist with entity resolution.

  3. Esquisse d'une grammaire de l'imaginaire (Sketch of a Grammar of the Fanciful).

    ERIC Educational Resources Information Center

    Ruck, Heribert

    1986-01-01

    Proposes an approach to teaching grammar that calls on the student's imagination and frees the learning process from classroom routine. The technique uses examples of specific constructions in French poetry to illustrate principles of grammar and discourse. (MSE)

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

  5. Graphing Important People

    ERIC Educational Resources Information Center

    Reading Teacher, 2012

    2012-01-01

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

  6. Grammaire francaise pour etudiants americains (French Grammar for American Students): Workbook and Answers.

    ERIC Educational Resources Information Center

    Giauque, Gerald S.

    This workbook in French grammar, intended for American college students, provides instruction and practice in French morphology, syntax, vocabulary, punctuation, and language style at the intermediate level. It is also designed to increase or reinforce the students' understanding of English grammar, based on the assumption that American students…

  7. Validity of a parent-report measure of vocabulary and grammar for Spanish-speaking toddlers.

    PubMed

    Thal, D; Jackson-Maldonado, D; Acosta, D

    2000-10-01

    The validity of the Fundación MacArthur Inventario del Desarrollo de Habilidades Comunicativas: Palabras y Enunciados (IDHC:PE) was examined with twenty 20- and nineteen 28-month-old, typically developing, monolingual, Spanish-speaking children living in Mexico. One measure of vocabulary (number of words) and two measures of grammar (mean of the three longest utterances and grammatical complexity score) from the IDHC:PE were compared to behavioral measures of vocabulary (number of different words from a language sample and number of objects named in a confrontation naming task) and one behavioral measure of grammar (mean length of utterance from a language sample). Only vocabulary measures were assessed in the 20-month-olds because of floor effects on the grammar measures. Results indicated validity for assessing expressive vocabulary in 20-month-olds and expressive vocabulary and grammar in 28-month-olds.

  8. Grammar and the English National Curriculum

    ERIC Educational Resources Information Center

    Paterson, Laura Louise

    2010-01-01

    In 1998 the regulatory body for the National Curriculum, the Qualifications and Curriculum Authority, acknowledged that there was "widespread uncertainty" over the grammar requirements of the English Curriculum. In this paper I argue that the QCA still has not addressed this uncertainty. I analyse the 1999 and 2011 Primary English…

  9. Effects of grammar instruction and fluency training on the learning of the and a by native speakers of japanese

    PubMed Central

    Shimamune, Satoru; Jitsumori, Masako

    1999-01-01

    In a computer-assisted sentence completion task, the effects of grammar instruction and fluency training on learning the use of the definite and indefinite articles of English were examined. Forty-eight native Japanese-speaking students were assigned to four groups: with grammar/accuracy (G/A), without grammar/accuracy (N/A), with grammar/fluency (G/F), and without grammar/fluency (N/F). In the G/A and N/A groups, training continued until performance reached 100% accuracy (accuracy criterion). In the G/F and N/F groups, training continued until 100% accuracy was reached and the correct responses were made at a high speed (fluency criterion). Grammar instruction was given to participants in the G/A and G/F groups but not to those in the N/A and N/F groups. Generalization to new sentences was tested immediately after reaching the required criterion. High levels of generalization occurred, regardless of the type of mastery criterion and whether the grammar instruction was given. Retention tests were conducted 4, 6, and 8 weeks after training. Fluency training effectively improved retention of the performance attained without the grammar instruction. This effect was diminished when grammar instruction was given during training. Learning grammatical rules was not necessary for the generalized use of appropriate definite and indefinite articles or for the maintenance of the performance attained through fluency training. PMID:22477154

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

  11. Evolutionary dynamics on graphs

    NASA Astrophysics Data System (ADS)

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

    2005-01-01

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

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

  13. Cooperative Business Education - 7725 (Reinforcing Knowledge of Grammar): Department 48 - Course 7725.08.

    ERIC Educational Resources Information Center

    Dade County Public Schools, Miami, FL.

    The essential elements of grammar required to write business letters, memorandums, and reports are covered in this quinmester course. The course consists of a complete grammar review and the learning of proofreading skills for students in the Cooperative Business Education program in Dade County High Schools. Instruction techniques include group…

  14. Google matrix of business process management

    NASA Astrophysics Data System (ADS)

    Abel, M. W.; Shepelyansky, D. L.

    2011-12-01

    Development of efficient business process models and determination of their characteristic properties are subject of intense interdisciplinary research. Here, we consider a business process model as a directed graph. Its nodes correspond to the units identified by the modeler and the link direction indicates the causal dependencies between units. It is of primary interest to obtain the stationary flow on such a directed graph, which corresponds to the steady-state of a firm during the business process. Following the ideas developed recently for the World Wide Web, we construct the Google matrix for our business process model and analyze its spectral properties. The importance of nodes is characterized by PageRank and recently proposed CheiRank and 2DRank, respectively. The results show that this two-dimensional ranking gives a significant information about the influence and communication properties of business model units. We argue that the Google matrix method, described here, provides a new efficient tool helping companies to make their decisions on how to evolve in the exceedingly dynamic global market.

  15. Methods of visualizing graphs

    DOEpatents

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

    2008-12-23

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

  16. Yes, We Still Need Universal Grammar

    ERIC Educational Resources Information Center

    Lidz, Jeffrey; Gleitman, Lila R.

    2004-01-01

    In a recent paper [Lidz, J., Gleitman, H., & Gleitman, L. (2003). Understanding how input matters: Verb learning and the footprint of universal grammar. "Cognition," 87, 151-178], we provided cross-linguistic evidence in favor of the following linked assertions: (i) Verb argument structure is a correlate of verb meaning; (ii) However, argument…

  17. IN GRAMMAR'S FALL, WE SINNED ALL.

    ERIC Educational Resources Information Center

    TIBBETTS, A.M.

    THROUGH THEIR LOSS OF FAITH IN TRADITIONAL GRAMMAR, MEN HAVE "SINNED" AND CONTRIBUTED SLIGHTLY BUT IMPORTANTLY TO THE CREATION OF AN AMORAL AND RELATIVISTIC SOCIETY. PROMPTED BY THE SIN OF INTELLECTUAL PRIDE, SOME LINGUISTS SEEM TO ASSUME THAT GRAMMATICAL PROBLEMS CAN BE SOLVED BY RATIOCINATION ALONE. IGNORANCE OF THE PAST--ANOTHER SIN--AND…

  18. Confidence and Competence among Community College Students: Self-Efficacy and Performance in Grammar

    ERIC Educational Resources Information Center

    Collins, Steve; Bissell, Kimberly

    2004-01-01

    Proper grammar is crucial for effective communication. Two surveys of students in an introductory writing course sought to identify predictors of grammar ability. Students demonstrated a limited grasp of the language, struggling with such issues as the distinction between "it's" and "its." Women performed better than men at the beginning of the…

  19. The Gang's All Here: Grammar Goes Global for Purdue, Unisa and Adelaide University

    ERIC Educational Resources Information Center

    Duff, Andrea; Spangenberg, Brady; Carter, Susanna; Miller, Julia

    2010-01-01

    The University of South Australia and Purdue University (Indiana) launched the "Grammar Gang Blog" in June 2008, as a collaborative forum for talking about language. The blog reaches a far-flung community of learners from Australia to the United States, Brisbane to Bangalore and Ghana to Germany. The Grammar Gang--where Owls meet…

  20. Improving language mapping in clinical fMRI through assessment of grammar.

    PubMed

    Połczyńska, Monika; Japardi, Kevin; Curtiss, Susan; Moody, Teena; Benjamin, Christopher; Cho, Andrew; Vigil, Celia; Kuhn, Taylor; Jones, Michael; Bookheimer, Susan

    2017-01-01

    Brain surgery in the language dominant hemisphere remains challenging due to unintended post-surgical language deficits, despite using pre-surgical functional magnetic resonance (fMRI) and intraoperative cortical stimulation. Moreover, patients are often recommended not to undergo surgery if the accompanying risk to language appears to be too high. While standard fMRI language mapping protocols may have relatively good predictive value at the group level, they remain sub-optimal on an individual level. The standard tests used typically assess lexico-semantic aspects of language, and they do not accurately reflect the complexity of language either in comprehension or production at the sentence level. Among patients who had left hemisphere language dominance we assessed which tests are best at activating language areas in the brain. We compared grammar tests (items testing word order in actives and passives, wh -subject and object questions, relativized subject and object clauses and past tense marking) with standard tests (object naming, auditory and visual responsive naming), using pre-operative fMRI. Twenty-five surgical candidates (13 females) participated in this study. Sixteen patients presented with a brain tumor, and nine with epilepsy. All participants underwent two pre-operative fMRI protocols: one including CYCLE-N grammar tests (items testing word order in actives and passives, wh-subject and object questions, relativized subject and object clauses and past tense marking); and a second one with standard fMRI tests (object naming, auditory and visual responsive naming). fMRI activations during performance in both protocols were compared at the group level, as well as in individual candidates. The grammar tests generated more volume of activation in the left hemisphere (left/right angular gyrus, right anterior/posterior superior temporal gyrus) and identified additional language regions not shown by the standard tests (e.g., left anterior

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

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

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

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

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

    DOE PAGES

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

    2016-01-01

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

  3. Assessment of grammar optimizes language tasks for the intracarotid amobarbital procedure.

    PubMed

    Połczyńska, Monika; Kuhn, Taylor; You, S Christine; Walshaw, Patricia; Curtiss, Susan; Bookheimer, Susan

    2017-11-01

    A previous study showed that assessment of language laterality could be improved by adding grammar tests to the recovery phase of the intracarotid amobarbital procedure (IAP) (Połczyńska et al. 2014). The aim of this study was to further investigate the extent to which grammar tests lateralize language function during the recovery phase of the IAP in a larger patient sample. Forty patients with drug-resistant epilepsy (14 females, thirty-two right-handed, mean age 38.5years, SD=10.6) participated in this study. On EEG, 24 patients had seizures originating in the left hemisphere (LH), 13 in the right hemisphere (RH), and 4 demonstrated mixed seizure origin. Thirty participants (75%) had bilateral injections, and ten (25%) had unilateral injections (five RH and five LH). Based on results from the encoding phase, we segregated our study participants to a LH language dominant and a mixed dominance group. In the recovery phase of the IAP, the participants were administered a new grammar test (the CYCLE-N) and a standard language test. We analyzed the laterality index measure and effect sizes in the two tests. In the LH-dominant group, the CYCLE-N generated more profound language deficits in the recovery phase than the standard after injection to either hemisphere (p<0.001). At the same time, the laterality index for the grammar tasks was still higher than for the standard tests. Critically, the CYCLE-N administered in the recovery phase was nearly as effective as the standard tests given during the encoding phase. The results may be significant for individuals with epilepsy undergoing IAP. The grammar tests may be a highly efficient measure for lateralizing language function in the recovery phase. Copyright © 2017 Elsevier Inc. All rights reserved.

  4. LeadMine: a grammar and dictionary driven approach to entity recognition

    PubMed Central

    2015-01-01

    Background Chemical entity recognition has traditionally been performed by machine learning approaches. Here we describe an approach using grammars and dictionaries. This approach has the advantage that the entities found can be directly related to a given grammar or dictionary, which allows the type of an entity to be known and, if an entity is misannotated, indicates which resource should be corrected. As recognition is driven by what is expected, if spelling errors occur, they can be corrected. Correcting such errors is highly useful when attempting to lookup an entity in a database or, in the case of chemical names, converting them to structures. Results Our system uses a mixture of expertly curated grammars and dictionaries, as well as dictionaries automatically derived from public resources. We show that the heuristics developed to filter our dictionary of trivial chemical names (from PubChem) yields a better performing dictionary than the previously published Jochem dictionary. Our final system performs post-processing steps to modify the boundaries of entities and to detect abbreviations. These steps are shown to significantly improve performance (2.6% and 4.0% F1-score respectively). Our complete system, with incremental post-BioCreative workshop improvements, achieves 89.9% precision and 85.4% recall (87.6% F1-score) on the CHEMDNER test set. Conclusions Grammar and dictionary approaches can produce results at least as good as the current state of the art in machine learning approaches. While machine learning approaches are commonly thought of as "black box" systems, our approach directly links the output entities to the input dictionaries and grammars. Our approach also allows correction of errors in detected entities, which can assist with entity resolution. PMID:25810776

  5. Functional grouping of similar genes using eigenanalysis on minimum spanning tree based neighborhood graph.

    PubMed

    Jothi, R; Mohanty, Sraban Kumar; Ojha, Aparajita

    2016-04-01

    Gene expression data clustering is an important biological process in DNA microarray analysis. Although there have been many clustering algorithms for gene expression analysis, finding a suitable and effective clustering algorithm is always a challenging problem due to the heterogeneous nature of gene profiles. Minimum Spanning Tree (MST) based clustering algorithms have been successfully employed to detect clusters of varying shapes and sizes. This paper proposes a novel clustering algorithm using Eigenanalysis on Minimum Spanning Tree based neighborhood graph (E-MST). As MST of a set of points reflects the similarity of the points with their neighborhood, the proposed algorithm employs a similarity graph obtained from k(') rounds of MST (k(')-MST neighborhood graph). By studying the spectral properties of the similarity matrix obtained from k(')-MST graph, the proposed algorithm achieves improved clustering results. We demonstrate the efficacy of the proposed algorithm on 12 gene expression datasets. Experimental results show that the proposed algorithm performs better than the standard clustering algorithms. Copyright © 2016 Elsevier Ltd. All rights reserved.

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

    PubMed

    Angra, Aakanksha; Gardner, Stephanie M

    2017-01-01

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

  7. (In)Flexibility of Constituency in Japanese in Multi-Modal Categorial Grammar with Structured Phonology

    ERIC Educational Resources Information Center

    Kubota, Yusuke

    2010-01-01

    This dissertation proposes a theory of categorial grammar called Multi-Modal Categorial Grammar with Structured Phonology. The central feature that distinguishes this theory from the majority of contemporary syntactic theories is that it decouples (without completely segregating) two aspects of syntax--hierarchical organization (reflecting…

  8. Grammar of Binding in the languages of the world: Innate or learned?

    PubMed

    Cole, Peter; Hermon, Gabriella; Yanti

    2015-08-01

    Languages around the world often appear to manifest nearly identical grammatical properties, but, at the same time, the grammatical differences can also be great, sometimes even seeming to support Joos's (1958) claim that "languages can differ from each other without limit and in unpredictable way" (p. 96). This state of affairs provides a puzzle for both nativist approaches to language like Generative Grammar that posit a fixed "Universal Grammar", and for approaches that minimize the contribution of innate grammatical structure. We approach this puzzling state of affairs by looking at one area of grammar, "Binding", the system of local and long distance anaphoric elements in a language. This is an area of grammar that has long been central to the Generative approach to language structure. We compare the anaphoric systems found in "familiar" (European-like) languages that contain dedicated classes of bound and free anaphors (pronouns and reflexives) with the anaphoric systems in endangered Austronesian languages of Indonesia, languages in which there is overlap or no distinction between pronouns and reflexives (Peranakan Javanese and Jambi Malay). What is of special interest about Jambi anaphora is not only that conservative dialects of Jambi Malay do not distinguish between pronouns and reflexives, but that Jambi anaphora appear to constitute a live snapshot of a unitary class of anaphora in the process of grammaticalization as a distinct system of pronouns and reflexives. We argue that the facts of Jambi anaphora cannot be explained by theories positing a Universal Grammar of Binding. Thus, these facts provide evidence that complex grammatical systems like Binding cannot be innate. Our results from Austronesian languages are confirmed by data from signed and creole languages. Our conclusion is that the human language learning capacity must include the ability to model the full complexity found in the syntax of the world's languages. From the perspective of child

  9. A SHORT SKETCH OF TAJIK GRAMMAR.

    ERIC Educational Resources Information Center

    RASTORGUEVA, V.S.

    PART OF A SERIES OF FOUR RUSSIAN-ENGLISH TRANSLATIONS OF GRAMMARS OF IRANIAN LANGUAGES, THIS BOOKLET DESCRIBES THE TAJIK LANGUAGE OF THE INHABITANTS OF TAJIK SSR, AND IS THE FIRST TO APPEAR IN ENGLISH. (THE ORIGINAL TEXT WAS A SUPPLEMENT TO THE RAHIMI-USPENSKAYA "TAJIK-RUSSIAN DICTIONARY," MOSCOW, 1954.) ALL TAJIK FORMS ARE GIVEN IN…

  10. Multiple Grammars and Second Language Representation

    ERIC Educational Resources Information Center

    Amaral, Luiz; Roeper, Tom

    2014-01-01

    This paper presents an extension of the Multiple Grammars Theory (Roeper, 1999) to provide a formal mechanism that can serve as a generative-based alternative to current descriptive models of interlanguage. The theory extends historical work by Kroch and Taylor (1997), and has been taken into a computational direction by Yang (2003). The proposal…

  11. Education and the Grammar of Assent

    ERIC Educational Resources Information Center

    Harris, Suzy

    2015-01-01

    John Henry Newman is probably known best for "The Idea of a University." In his most philosophical work, "An Essay in Aid of a Grammar of Assent," however, he undertakes a detailed investigation of different ways of knowing and understanding in a manner that is of clear pertinence for philosophical enquiry into education. He…

  12. Teaching Grammar as a Humanities Course.

    ERIC Educational Resources Information Center

    Kliman, Bernice W.

    Nassau Community College (NCC) offers a grammar course as a humanities option that may be taken instead of a literature course. The approach to the course incorporates reader-response theory, feminist criticism, new historicism, and journal writing as the key means for enabling students to learn. Each student has a notebook divided into sections…

  13. Arbitrary grammars generating context-free languages

    NASA Technical Reports Server (NTRS)

    Baker, B. S.

    1972-01-01

    If G is a grammar such that in each noncontext-free rule of G, the right side contains a string of terminals longer than any terminal string appearing between two nonterminals in the left side; then the language generated by G is context-free. Six previous results follow as simple corollaries of this theorem.

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

    PubMed

    Itoh, Takayuki; Klein, Karsten

    2015-01-01

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

  15. Well-Covered Graphs: A Survey

    DTIC Science & Technology

    1991-01-01

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

  16. Spectral Analysis for Weighted Iterated Triangulations of Graphs

    NASA Astrophysics Data System (ADS)

    Chen, Yufei; Dai, Meifeng; Wang, Xiaoqian; Sun, Yu; Su, Weiyi

    Much information about the structural properties and dynamical aspects of a network is measured by the eigenvalues of its normalized Laplacian matrix. In this paper, we aim to present a first study on the spectra of the normalized Laplacian of weighted iterated triangulations of graphs. We analytically obtain all the eigenvalues, as well as their multiplicities from two successive generations. As an example of application of these results, we then derive closed-form expressions for their multiplicative Kirchhoff index, Kemeny’s constant and number of weighted spanning trees.

  17. Computer Experiments in Transformational Grammar; French I. Department of Computer and Communication Sciences Natural Language Studies No. 3.

    ERIC Educational Resources Information Center

    Morin, Yves Ch.

    Described in this paper is the implementation of Querido's French grammar ("Grammaire I, Description transformationelle d'un sous-ensemble du Francais," 1969) on the computer system for transformational grammar at the University of Michigan (Friedman 1969). The purpose was to demonstrate the ease of transcribing a relative formal grammar into the…

  18. Spectral partitioning in equitable graphs.

    PubMed

    Barucca, Paolo

    2017-06-01

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

  19. Spectral partitioning in equitable graphs

    NASA Astrophysics Data System (ADS)

    Barucca, Paolo

    2017-06-01

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

  20. Grammar Predicts Procedural Learning and Consolidation Deficits in Children with Specific Language Impairment

    PubMed Central

    Hedenius, Martina; Persson, Jonas; Tremblay, Antoine; Adi-Japha, Esther; Veríssimo, João; Dye, Cristina D.; Alm, Per; Jennische, Margareta; Tomblin, J. Bruce; Ullman, Michael T.

    2011-01-01

    The Procedural Deficit Hypothesis (PDH) posits that Specific Language Impairment (SLI) can be largely explained by abnormalities of brain structures that subserve procedural memory. The PDH predicts impairments of procedural memory itself, and that such impairments underlie the grammatical deficits observed in the disorder. Previous studies have indeed reported procedural learning impairments in SLI, and have found that these are associated with grammatical difficulties. The present study extends this research by examining the consolidation and longer-term procedural sequence learning in children with SLI. The Alternating Serial Reaction Time (ASRT) task was given to children with SLI and typically-developing (TD) children in an initial learning session and an average of three days later to test for consolidation and longer-term learning. Although both groups showed evidence of initial sequence learning, only the TD children showed clear signs of consolidation, even though the two groups did not differ in longer-term learning. When the children were re-categorized on the basis of grammar deficits rather than broader language deficits, a clearer pattern emerged. Whereas both the grammar impaired and normal grammar groups showed evidence of initial sequence learning, only those with normal grammar showed consolidation and longer-term learning. Indeed, the grammar-impaired group appeared to lose any sequence knowledge gained during the initial testing session. These findings held even when controlling for vocabulary or a broad non-grammatical language measure, neither of which were associated with procedural memory. When grammar was examined as a continuous variable over all children, the same relationships between procedural memory and grammar, but not vocabulary or the broader language measure, were observed. Overall, the findings support and further specify the PDH. They suggest that consolidation and longer-term procedural learning are impaired in SLI, but that

  1. Slavic in Head-Driven Phrase Structure Grammar.

    ERIC Educational Resources Information Center

    Borsley, Robert D., Ed.; Przepiorkowski, Adam, Ed.

    The collection of essays on the properties of Slavic languages in the context of the theory of head-driven phrase structure grammar (HPSG) includes: "Typological Similarities in HPSG" (Tania Avgustinova, Wojciech Skut, Hans Uszkoreit); "Auxiliaries, Verbs and Complementizers in Polish" (Robert D. Borsley); "An Architecture…

  2. A technique for solving constraint satisfaction problems using Prolog's definite clause grammars

    NASA Technical Reports Server (NTRS)

    Nachtsheim, Philip R.

    1988-01-01

    A new technique for solving constraint satisfaction problems using Prolog's definite clause grammars is presented. It exploits the fact that the grammar rule notation can be viewed as a state exchange notation. The novel feature of the technique is that it can perform informed as well as blind search. It provides the Prolog programmer with a new technique for application to a wide range of design, scheduling, and planning problems.

  3. Grammar Schools: Where Are We Now?

    ERIC Educational Resources Information Center

    Tulloch, Margaret

    2015-01-01

    Apart from one amalgamation there are as many grammar schools in England as when Labour took office in 1997. Selection at age 11 still influences English education and unless there are changes its effect is likely to increase. Legislation introduced in 1998 which could have ended selection had no effect. The pressure from the right-wing minority…

  4. A Grammar of Spoken Brazilian Portuguese.

    ERIC Educational Resources Information Center

    Thomas, Earl W.

    This is a first-year text of Portuguese grammar based on the Portuguese of moderately educated Brazilians from the area around Rio de Janeiro. Spoken idiomatic usage is emphasized. An important innovation is found in the presentation of verb tenses; they are presented in the order in which the native speaker learns them. The text is intended to…

  5. Fully Decomposable Split Graphs

    NASA Astrophysics Data System (ADS)

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

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

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

    PubMed

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

    2013-02-01

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

  7. An Evaluation of Universal Grammar and the Phonological Mind1

    PubMed Central

    Everett, Daniel L.

    2016-01-01

    This paper argues against the hypothesis of a “phonological mind” advanced by Berent. It establishes that there is no evidence that phonology is innate and that, in fact, the simplest hypothesis seems to be that phonology is learned like other human abilities. Moreover, the paper fleshes out the original claim of Philip Lieberman that Universal Grammar predicts that not everyone should be able to learn every language, i.e., the opposite of what UG is normally thought to predict. The paper also underscores the problem that the absence of recursion in Pirahã represents for Universal Grammar proposals. PMID:26903889

  8. A python tool for the implementation of domain-specific languages

    NASA Astrophysics Data System (ADS)

    Dejanović, Igor; Vaderna, Renata; Milosavljević, Gordana; Simić, Miloš; Vuković, Željko

    2017-07-01

    In this paper we describe textX, a meta-language and a tool for building Domain-Specific Languages. It is implemented in Python using Arpeggio PEG (Parsing Expression Grammar) parser library. From a single language description (grammar) textX will build a parser and a meta-model (a.k.a. abstract syntax) of the language. The parser is used to parse textual representations of models conforming to the meta-model. As a result of parsing, a Python object graph will be automatically created. The structure of the object graph will conform to the meta-model defined by the grammar. This approach frees a developer from the need to manually analyse a parse tree and transform it to other suitable representation. The textX library is independent of any integrated development environment and can be easily integrated in any Python project. The textX tool works as a grammar interpreter. The parser is configured at run-time using the grammar. The textX tool is a free and open-source project available at GitHub.

  9. Multiple Grammars: Old Wine in Old Bottles

    ERIC Educational Resources Information Center

    Sorace, Antonella

    2014-01-01

    Amaral and Roeper (this issue; henceforth A&R) argue that all speakers -- regardless of whether monolingual or bilingual -- have multiple grammars in their mental language representations. They further claim that this simple assumption can explain many things: optionality in second language (L2) language behaviour, multilingualism, language…

  10. Interrogating the Grammars of Institutions and Injustice

    ERIC Educational Resources Information Center

    Bradley, Deborah

    2017-01-01

    This editorial introduction to "Action, Criticism, and Theory for Music Education" "ACT" 16 (3) explores institutions as sites of paradox whose mission statements (or constitutions in the case of government) suggest concerns for diversity and inclusion but whose "grammars" (Bonilla-Silva 2011) frame thought and action…

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

    NASA Astrophysics Data System (ADS)

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

    2018-04-01

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

  12. Matching Extension in Regular Graphs

    DTIC Science & Technology

    1989-01-01

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

  13. Derive Workshop Matrix Algebra and Linear Algebra.

    ERIC Educational Resources Information Center

    Townsley Kulich, Lisa; Victor, Barbara

    This document presents the course content for a workshop that integrates the use of the computer algebra system Derive with topics in matrix and linear algebra. The first section is a guide to using Derive that provides information on how to write algebraic expressions, make graphs, save files, edit, define functions, differentiate expressions,…

  14. Supporting French Teachers for a Paradigm Shift in Grammar Education: A Teacher Trainer's Perspective

    ERIC Educational Resources Information Center

    Thibeault, Joël

    2016-01-01

    This article presents a series of pedagogical workshops that was offered over two years to a cohort of 50 teachers practising in Ontarian French schools. Focusing on grammar teaching, the workshops' objectives were to: (a) contribute to the teachers' development of linguistic knowledge consistent with the grammar under new provincial standards and…

  15. Spoken Grammar Awareness Raising: Does It Affect the Listening Ability of Iranian EFL Learners?

    ERIC Educational Resources Information Center

    Rashtchi, Mojgan; Afzali, Mahnaz

    2011-01-01

    Advances in spoken corpora analysis have brought about new insights into language pedagogy and have led to an awareness of the characteristics of spoken language. Current findings have shown that grammar of spoken language is different from written language. However, most listening and speaking materials are concocted based on written grammar and…

  16. Unsupervised Metric Fusion Over Multiview Data by Graph Random Walk-Based Cross-View Diffusion.

    PubMed

    Wang, Yang; Zhang, Wenjie; Wu, Lin; Lin, Xuemin; Zhao, Xiang

    2017-01-01

    Learning an ideal metric is crucial to many tasks in computer vision. Diverse feature representations may combat this problem from different aspects; as visual data objects described by multiple features can be decomposed into multiple views, thus often provide complementary information. In this paper, we propose a cross-view fusion algorithm that leads to a similarity metric for multiview data by systematically fusing multiple similarity measures. Unlike existing paradigms, we focus on learning distance measure by exploiting a graph structure of data samples, where an input similarity matrix can be improved through a propagation of graph random walk. In particular, we construct multiple graphs with each one corresponding to an individual view, and a cross-view fusion approach based on graph random walk is presented to derive an optimal distance measure by fusing multiple metrics. Our method is scalable to a large amount of data by enforcing sparsity through an anchor graph representation. To adaptively control the effects of different views, we dynamically learn view-specific coefficients, which are leveraged into graph random walk to balance multiviews. However, such a strategy may lead to an over-smooth similarity metric where affinities between dissimilar samples may be enlarged by excessively conducting cross-view fusion. Thus, we figure out a heuristic approach to controlling the iteration number in the fusion process in order to avoid over smoothness. Extensive experiments conducted on real-world data sets validate the effectiveness and efficiency of our approach.

  17. Eye Movements in Implicit Artificial Grammar Learning

    ERIC Educational Resources Information Center

    Silva, Susana; Inácio, Filomena; Folia, Vasiliki; Petersson, Karl Magnus

    2017-01-01

    Artificial grammar learning (AGL) has been probed with forced-choice behavioral tests (active tests). Recent attempts to probe the outcomes of learning (implicitly acquired knowledge) with eye-movement responses (passive tests) have shown null results. However, these latter studies have not tested for sensitivity effects, for example, increased…

  18. A Reference Grammar of Spoken Kannada.

    ERIC Educational Resources Information Center

    Schiffman, Harold

    This reference grammar is a description of the speech of educated people of the Bangalore/Mysore area of Karnataka State in South India. This particular dialect is used in films and, to some extent, on the radio. The four sections of the book deal with: (1) phonology, (2) the noun phrase, (3) the verb phrase, and (4) syntax. Each item that is…

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

  20. Classification of pregnancy and labor contractions using a graph theory based analysis.

    PubMed

    Nader, N; Hassan, M; Falou, W; Diab, A; Al-Omar, S; Khalil, M; Marque, C

    2015-08-01

    In this paper, we propose a new framework to characterize the electrohysterographic (EHG) signals recorded during pregnancy and labor. The approach is based on the analysis of the propagation of the uterine electrical activity. The processing pipeline includes i) the estimation of the statistical dependencies between the different recorded EHG signals, ii) the characterization of the obtained connectivity matrices using network measures and iii) the use of these measures in clinical application: the classification between pregnancy and labor. Due to its robustness to volume conductor, we used the imaginary part of coherence in order to produce the connectivity matrix which is then transformed into a graph. We evaluate the performance of several graph measures. We also compare the results with the parameter mostly used in the literature: the peak frequency combined with the propagation velocity (PV +PF). Our results show that the use of the network measures is a promising tool to classify labor and pregnancy contractions with a small superiority of the graph strength over PV+PF.

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

  2. A Semantic Graph Query Language

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

    Kaplan, I L

    2006-10-16

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

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

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

    Simmhan, Yogesh; Kumbhare, Alok; Wickramaarachchi, Charith

    2014-08-25

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

  4. Creation Myths of Generative Grammar and the Mathematics of Syntactic Structures

    NASA Astrophysics Data System (ADS)

    Pullum, Geoffrey K.

    Syntactic Structures (Chomsky [6]) is widely believed to have laid the foundations of a cognitive revolution in linguistic science, and to have presented (i) the first use in linguistics of powerful new ideas regarding grammars as generative systems, (ii) a proof that English was not a regular language, (iii) decisive syntactic arguments against context-free phrase structure grammar description, and (iv) a demonstration of how transformational rules could provide a formal solution to those problems. None of these things are true. This paper offers a retrospective analysis and evaluation.

  5. GraphPrints: Towards a Graph Analytic Method for Network Anomaly Detection

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

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

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

  6. Peer Interaction, Cognitive Conflict, and Anxiety on a Grammar Awareness Course for Language Teachers

    ERIC Educational Resources Information Center

    Svalberg, Agneta Marie-Louise

    2012-01-01

    This study explored some MA students' perceptions of a Grammar Awareness course for language teachers. The aim was to understand how group tasks might help students build Grammar Awareness. Two cohorts of students were surveyed and interviewed. In this paper, the survey responses are discussed in some depth. While the first cohort was left to…

  7. On the Richness of Grammar as an Analytical Lens in the Integrated Language Arts

    ERIC Educational Resources Information Center

    Massey, Lance

    2011-01-01

    As a teacher of Bowling Green State University's English 3810, Grammar and Writing, the author is charged with teaching future language arts teachers how to teach grammar so that it actually helps their students become better writers and communicators. Because such teaching rejects the ineffective but time-honored drill-it-and-kill-it approach, in…

  8. Grammar Schools: Brief Flowering of Social Mobility?

    ERIC Educational Resources Information Center

    Barker, Bernard

    2012-01-01

    Grammar schools are increasingly remembered, especially by right-wing ideologues, as the agents of a "brief flowering" of post-war social mobility. This article presents statistical, documentary and interview evidence of secondary education in the eleven plus era, and finds nothing to justify the claim that selective schools produced a general…

  9. Epilogue: Dynamic Morphosyntax in Functional Discourse Grammar

    ERIC Educational Resources Information Center

    Velasco, Daniel Garcia; Hengeveld, Kees; Mackenzie, J. Lachlan

    2012-01-01

    This epilogue addresses the most important topics and challenges for the Morphosyntactic Level in Functional Discourse Grammar that have been raised in the articles in this Special Issue. We begin by exploring the differences between the Morphosyntactic Level in FDG and the treatment of morphosyntactic phenomena in other linguistic frameworks. We…

  10. Graphs and Tracks Revisited

    NASA Astrophysics Data System (ADS)

    Christian, Wolfgang; Belloni, Mario

    2013-04-01

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

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

    ERIC Educational Resources Information Center

    Zucker, Andrew; Kay, Rachel; Staudt, Carolyn

    2014-01-01

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

  12. a Super Voxel-Based Riemannian Graph for Multi Scale Segmentation of LIDAR Point Clouds

    NASA Astrophysics Data System (ADS)

    Li, Minglei

    2018-04-01

    Automatically segmenting LiDAR points into respective independent partitions has become a topic of great importance in photogrammetry, remote sensing and computer vision. In this paper, we cast the problem of point cloud segmentation as a graph optimization problem by constructing a Riemannian graph. The scale space of the observed scene is explored by an octree-based over-segmentation with different depths. The over-segmentation produces many super voxels which restrict the structure of the scene and will be used as nodes of the graph. The Kruskal coordinates are used to compute edge weights that are proportional to the geodesic distance between nodes. Then we compute the edge-weight matrix in which the elements reflect the sectional curvatures associated with the geodesic paths between super voxel nodes on the scene surface. The final segmentation results are generated by clustering similar super voxels and cutting off the weak edges in the graph. The performance of this method was evaluated on LiDAR point clouds for both indoor and outdoor scenes. Additionally, extensive comparisons to state of the art techniques show that our algorithm outperforms on many metrics.

  13. Graphing Inequalities, Connecting Meaning

    ERIC Educational Resources Information Center

    Switzer, J. Matt

    2014-01-01

    Students often have difficulty with graphing inequalities (see Filloy, Rojano, and Rubio 2002; Drijvers 2002), and J. Matt Switzer's students were no exception. Although students can produce graphs for simple inequalities, they often struggle when the format of the inequality is unfamiliar. Even when producing a correct graph of an…

  14. On Edge Exchangeable Random Graphs

    NASA Astrophysics Data System (ADS)

    Janson, Svante

    2017-06-01

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

  15. Multiple graph regularized protein domain ranking.

    PubMed

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

    2012-11-19

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

  16. Private Graphs - Access Rights on Graphs for Seamless Navigation

    NASA Astrophysics Data System (ADS)

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

    2016-06-01

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

  17. Graph Theory Roots of Spatial Operators for Kinematics and Dynamics

    NASA Technical Reports Server (NTRS)

    Jain, Abhinandan

    2011-01-01

    Spatial operators have been used to analyze the dynamics of robotic multibody systems and to develop novel computational dynamics algorithms. Mass matrix factorization, inversion, diagonalization, and linearization are among several new insights obtained using such operators. While initially developed for serial rigid body manipulators, the spatial operators and the related mathematical analysis have been shown to extend very broadly including to tree and closed topology systems, to systems with flexible joints, links, etc. This work uses concepts from graph theory to explore the mathematical foundations of spatial operators. The goal is to study and characterize the properties of the spatial operators at an abstract level so that they can be applied to a broader range of dynamics problems. The rich mathematical properties of the kinematics and dynamics of robotic multibody systems has been an area of strong research interest for several decades. These properties are important to understand the inherent physical behavior of systems, for stability and control analysis, for the development of computational algorithms, and for model development of faithful models. Recurring patterns in spatial operators leads one to ask the more abstract question about the properties and characteristics of spatial operators that make them so broadly applicable. The idea is to step back from the specific application systems, and understand more deeply the generic requirements and properties of spatial operators, so that the insights and techniques are readily available across different kinematics and dynamics problems. In this work, techniques from graph theory were used to explore the abstract basis for the spatial operators. The close relationship between the mathematical properties of adjacency matrices for graphs and those of spatial operators and their kernels were established. The connections hold across very basic requirements on the system topology, the nature of the component

  18. Using Dual-Task Methodology to Dissociate Automatic from Nonautomatic Processes Involved in Artificial Grammar Learning

    ERIC Educational Resources Information Center

    Hendricks, Michelle A.; Conway, Christopher M.; Kellogg, Ronald T.

    2013-01-01

    Previous studies have suggested that both automatic and intentional processes contribute to the learning of grammar and fragment knowledge in artificial grammar learning (AGL) tasks. To explore the relative contribution of automatic and intentional processes to knowledge gained in AGL, we utilized dual-task methodology to dissociate automatic and…

  19. Nigel: A Systemic Grammar for Text Generation.

    ERIC Educational Resources Information Center

    Mann, William C.; Matthiessen, Christian M. I. M.

    This three-paper report describes Nigel, a large, programmed grammar of English which has been created in the framework of systemic linguistics begun by Halliday, and which, in addition to specifying functions and structures of English, has a novel semantic stratum which specifies the situations for use of each grammatical feature. The…

  20. Exploiting Multiple Levels of Parallelism in Sparse Matrix-Matrix Multiplication

    DOE PAGES

    Azad, Ariful; Ballard, Grey; Buluc, Aydin; ...

    2016-11-08

    Sparse matrix-matrix multiplication (or SpGEMM) is a key primitive for many high-performance graph algorithms as well as for some linear solvers, such as algebraic multigrid. The scaling of existing parallel implementations of SpGEMM is heavily bound by communication. Even though 3D (or 2.5D) algorithms have been proposed and theoretically analyzed in the flat MPI model on Erdös-Rényi matrices, those algorithms had not been implemented in practice and their complexities had not been analyzed for the general case. In this work, we present the first implementation of the 3D SpGEMM formulation that exploits multiple (intranode and internode) levels of parallelism, achievingmore » significant speedups over the state-of-the-art publicly available codes at all levels of concurrencies. We extensively evaluate our implementation and identify bottlenecks that should be subject to further research.« less

  1. Graph Visualization for RDF Graphs with SPARQL-EndPoints

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

    Sukumar, Sreenivas R; Bond, Nathaniel

    2014-07-11

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

  2. Multiple graph regularized protein domain ranking

    PubMed Central

    2012-01-01

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

  3. A Development System for Augmented Transition Network Grammars and a Large Grammar for Technical Prose. Technical Report No. 25.

    ERIC Educational Resources Information Center

    Mayer, John; Kieras, David E.

    Using a system based on standard augmented transition network (ATN) parsing approach, this report describes a technique for the rapid development of natural language parsing, called High-Level Grammar Specification Language (HGSL). The first part of the report describes the syntax and semantics of HGSL and the network implementation of each of its…

  4. Do Humans Really Learn A[superscript n] B[superscript n] Artificial Grammars from Exemplars?

    ERIC Educational Resources Information Center

    Hochmann, Jean-Remy; Azadpour, Mahan; Mehler, Jacques

    2008-01-01

    An important topic in the evolution of language is the kinds of grammars that can be computed by humans and other animals. Fitch and Hauser (F&H; 2004) approached this question by assessing the ability of different species to learn 2 grammars, (AB)[superscript n] and A[superscript n] B[superscript n]. A[superscript n] B[superscript n] was taken to…

  5. Searching for Ways with Grammar: Reflections on Keynotes by Debra Myhill and Wayne Sawyer

    ERIC Educational Resources Information Center

    Evans, Jenni

    2012-01-01

    In this article, the author reflects on keynotes by Debra Myhill and Wayne Sawyer in a search for ways with grammar. One of the keynote speakers, Debra Myhill, shared her research into teaching grammar that she had conducted in the UK. Myhill had asked a sample of teachers to follow a specified unit plan and had conducted pre- and post-testing to…

  6. A Grammar of Buem, the Lelemi Language.

    ERIC Educational Resources Information Center

    Allan, Edward Jay

    A detailed grammar of Buem, one of the Togo-Remnant Languages spoken in Ghana's Volta region, describes the major structures and many minor structures occurring in informal and semi-formal speech. The phonetics and much of the phonology are described in taxonomic terms, and the vowel harmony system, syntax, and morphology are described in a…

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

  8. A Space-Saving Approximation Algorithm for Grammar-Based Compression

    NASA Astrophysics Data System (ADS)

    Sakamoto, Hiroshi; Maruyama, Shirou; Kida, Takuya; Shimozono, Shinichi

    A space-efficient approximation algorithm for the grammar-based compression problem, which requests for a given string to find a smallest context-free grammar deriving the string, is presented. For the input length n and an optimum CFG size g, the algorithm consumes only O(g log g) space and O(n log*n) time to achieve O((log*n)log n) approximation ratio to the optimum compression, where log*n is the maximum number of logarithms satisfying log log…log n > 1. This ratio is thus regarded to almost O(log n), which is the currently best approximation ratio. While g depends on the string, it is known that g =Ω(log n) and g=\\\\Omega(\\\\log n) and g=O\\\\left(\\\\frac{n}{log_kn}\\\\right) for strings from k-letter alphabet[12].

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

  10. JavaGenes: Evolving Graphs with Crossover

    NASA Technical Reports Server (NTRS)

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

    2000-01-01

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

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

    PubMed

    Gnutzmann, Sven; Waltner, Daniel

    2016-12-01

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

  12. Using Songs in Enhancing the Teaching of Grammar

    ERIC Educational Resources Information Center

    Roslim, Norwati; Azizul, Aini Faridah; Zain, Mazira Mohd

    2011-01-01

    This paper shares research and studies done in using songs to teach grammar from the theoretical and practical perspectives. The theoretical part focuses on the Affective Filter Hypothesis proposed by Krashen (1982) and the practical part focuses on techniques in using songs in classrooms.

  13. Towards a Pragmatic Grammar of Teachers' Epistemic Networks.

    ERIC Educational Resources Information Center

    Tochon, Francois V.

    Possibilities of conceptual and pragmatic analysis exist for identifying epistemological processing in teacher thinking. These modes of organizing thought condition classroom planning, shape meaning from a virtual didactic knowledge-store, and scaffold further pedagogical interactions. The semio-cognitive grammar proposed is adapted to the…

  14. Corrections on Grammar, Sentence Variety and Developing Detail to Qualify Academic Essay of Indonesian Learners

    ERIC Educational Resources Information Center

    Solikhah, Imroatus

    2017-01-01

    This experimental research examines: (1) significant differences of corrections on grammar, sentence variety and developing details on the quality of the essay by Indonesian learners; and (2) different effect of corrections on grammar, sentence variety, and developing details on the quality of the essay. Treatments for each were served as follows:…

  15. A new method of cardiographic image segmentation based on grammar

    NASA Astrophysics Data System (ADS)

    Hamdi, Salah; Ben Abdallah, Asma; Bedoui, Mohamed H.; Alimi, Adel M.

    2011-10-01

    The measurement of the most common ultrasound parameters, such as aortic area, mitral area and left ventricle (LV) volume, requires the delineation of the organ in order to estimate the area. In terms of medical image processing this translates into the need to segment the image and define the contours as accurately as possible. The aim of this work is to segment an image and make an automated area estimation based on grammar. The entity "language" will be projected to the entity "image" to perform structural analysis and parsing of the image. We will show how the idea of segmentation and grammar-based area estimation is applied to real problems of cardio-graphic image processing.

  16. Learning of grammar-like visual sequences by adults with and without language-learning disabilities.

    PubMed

    Aguilar, Jessica M; Plante, Elena

    2014-08-01

    Two studies examined learning of grammar-like visual sequences to determine whether a general deficit in statistical learning characterizes this population. Furthermore, we tested the hypothesis that difficulty in sustaining attention during the learning task might account for differences in statistical learning. In Study 1, adults with normal language (NL) or language-learning disability (LLD) were familiarized with the visual artificial grammar and then tested using items that conformed or deviated from the grammar. In Study 2, a 2nd sample of adults with NL and LLD were presented auditory word pairs with weak semantic associations (e.g., groom + clean) along with the visual learning task. Participants were instructed to attend to visual sequences and to ignore the auditory stimuli. Incidental encoding of these words would indicate reduced attention to the primary task. In Studies 1 and 2, both groups demonstrated learning and generalization of the artificial grammar. In Study 2, neither the NL nor the LLD group appeared to encode the words presented during the learning phase. The results argue against a general deficit in statistical learning for individuals with LLD and demonstrate that both NL and LLD learners can ignore extraneous auditory stimuli during visual learning.

  17. Applying Semantic-based Probabilistic Context-Free Grammar to Medical Language Processing – A Preliminary Study on Parsing Medication Sentences

    PubMed Central

    Xu, Hua; AbdelRahman, Samir; Lu, Yanxin; Denny, Joshua C.; Doan, Son

    2011-01-01

    Semantic-based sublanguage grammars have been shown to be an efficient method for medical language processing. However, given the complexity of the medical domain, parsers using such grammars inevitably encounter ambiguous sentences, which could be interpreted by different groups of production rules and consequently result in two or more parse trees. One possible solution, which has not been extensively explored previously, is to augment productions in medical sublanguage grammars with probabilities to resolve the ambiguity. In this study, we associated probabilities with production rules in a semantic-based grammar for medication findings and evaluated its performance on reducing parsing ambiguity. Using the existing data set from 2009 i2b2 NLP (Natural Language Processing) challenge for medication extraction, we developed a semantic-based CFG (Context Free Grammar) for parsing medication sentences and manually created a Treebank of 4,564 medication sentences from discharge summaries. Using the Treebank, we derived a semantic-based PCFG (probabilistic Context Free Grammar) for parsing medication sentences. Our evaluation using a 10-fold cross validation showed that the PCFG parser dramatically improved parsing performance when compared to the CFG parser. PMID:21856440

  18. Molecular graph convolutions: moving beyond fingerprints.

    PubMed

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

    2016-08-01

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

  19. The Grammar of Ch'orti' Maya Folktales

    ERIC Educational Resources Information Center

    Dugan, James Timothy

    2014-01-01

    This study describes the grammar of the Ch'orti' Maya language as it appears in a collection of oral literature. I collected the stories that form the basis of this study in and around Jocotan, Guatemala, during 2004 and 2005. I worked with bilingual story-tellers to make audio recordings of the original Ch'orti'-language tales, produce textual…

  20. Using Technology for Teaching Arabic Language Grammar

    ERIC Educational Resources Information Center

    Arrabtah, Adel; Nusour, Tayseer

    2012-01-01

    This study investigates the effect of using technology such as CD-ROM, computers, and internet to teach Arabic language grammar to students at Princess Alia University College at Al-Balqa University. The sample of the study consisted of 122 third year female students; (64) for the experimental group and (58) for the control group. The subjects of…

  1. Information visualisation based on graph models

    NASA Astrophysics Data System (ADS)

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

    2013-05-01

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

  2. Network reconstruction via graph blending

    NASA Astrophysics Data System (ADS)

    Estrada, Rolando

    2016-05-01

    Graphs estimated from empirical data are often noisy and incomplete due to the difficulty of faithfully observing all the components (nodes and edges) of the true graph. This problem is particularly acute for large networks where the number of components may far exceed available surveillance capabilities. Errors in the observed graph can render subsequent analyses invalid, so it is vital to develop robust methods that can minimize these observational errors. Errors in the observed graph may include missing and spurious components, as well fused (multiple nodes are merged into one) and split (a single node is misinterpreted as many) nodes. Traditional graph reconstruction methods are only able to identify missing or spurious components (primarily edges, and to a lesser degree nodes), so we developed a novel graph blending framework that allows us to cast the full estimation problem as a simple edge addition/deletion problem. Armed with this framework, we systematically investigate the viability of various topological graph features, such as the degree distribution or the clustering coefficients, and existing graph reconstruction methods for tackling the full estimation problem. Our experimental results suggest that incorporating any topological feature as a source of information actually hinders reconstruction accuracy. We provide a theoretical analysis of this phenomenon and suggest several avenues for improving this estimation problem.

  3. The Relationship between Teachers' Beliefs of Grammar Instruction and Classroom Practices in the Saudi Context

    ERIC Educational Resources Information Center

    Alghanmi, Bayan; Shukri, Nadia

    2016-01-01

    Teacher cognition (Borg, 2015) of grammar instruction is a relatively new phenomenon that has yet to be explored in the Saudi context. While many studies have focused on the teaching of grammar in general (Ellis, 2006; Corzo, 2013; Braine, 2014), further research needs to be done - particularly when it comes to understanding teachers' beliefs of…

  4. Delta's Key to the Next Generation TOEFL[R] Test: Essential Grammar for the iBT

    ERIC Educational Resources Information Center

    Gallagher, Nancy

    2012-01-01

    Although the TOEFL iBT does not have a discrete grammar section, knowledge of English sentence structure is important throughout the test. Essential Grammar for the iBT reviews the skills that are fundamental to success on tests. Content includes noun and verb forms, clauses, agreement, parallel structure, punctuation, and much more. The book may…

  5. "Something for Linguists": On-The-Fly Grammar Instruction in a Dutch as Foreign Language Classroom

    ERIC Educational Resources Information Center

    Moore, Leslie C.; Park, Seo Hyun

    2014-01-01

    This article examines grammar instruction produced on the fly by a teacher in response to students' questions in a Dutch as foreign language classroom. Such sequences merit attention because they present teachers with the opportunity and the challenge to provide unplanned instruction on an aspect of grammar to which a student has shown herself to…

  6. Graph Kernels for Molecular Similarity.

    PubMed

    Rupp, Matthias; Schneider, Gisbert

    2010-04-12

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

  7. Groupies in multitype random graphs.

    PubMed

    Shang, Yilun

    2016-01-01

    A groupie in a graph is a vertex whose degree is not less than the average degree of its neighbors. Under some mild conditions, we show that the proportion of groupies is very close to 1/2 in multitype random graphs (such as stochastic block models), which include Erdős-Rényi random graphs, random bipartite, and multipartite graphs as special examples. Numerical examples are provided to illustrate the theoretical results.

  8. Upending the Grammar of the Conventional Religious School

    ERIC Educational Resources Information Center

    Aron, Isa

    2014-01-01

    This article provides an overview and analysis of a relatively new phenomenon: congregational schools that have altered the conventional grammar of schooling, either through their structural arrangements or through their curricular approaches. Five pre-bar/bat mitzvah models are discussed: family schools, schools as communities,…

  9. The Role of Core Grammar in Pidgin Development.

    ERIC Educational Resources Information Center

    Macedo, Donaldo P.

    1986-01-01

    Examines the process of pidgin development within the context of the Government and Binding Theory proposed by Chomsky in 1981. Hypothesizes that the contact of various languages may produce a new experience which subsequently fixes the parameters of Universal Grammar, providing a pidgin core gammar. (SED)

  10. Language Dictionaries and Grammars of Guam and Micronesia.

    ERIC Educational Resources Information Center

    Goetzfridt, Nicholas J.; Goniwiecha, Mark C.

    The study of language reference materials, particularly dictionaries and grammar works, for languages of Guam and Micronesia includes a brief history of their evolution and an annotated bibliography. An introductory section describes the geographic situation of Micronesia and chronicles numerous periods of foreign influence: Spanish Colonization…

  11. Massively parallel sparse matrix function calculations with NTPoly

    NASA Astrophysics Data System (ADS)

    Dawson, William; Nakajima, Takahito

    2018-04-01

    We present NTPoly, a massively parallel library for computing the functions of sparse, symmetric matrices. The theory of matrix functions is a well developed framework with a wide range of applications including differential equations, graph theory, and electronic structure calculations. One particularly important application area is diagonalization free methods in quantum chemistry. When the input and output of the matrix function are sparse, methods based on polynomial expansions can be used to compute matrix functions in linear time. We present a library based on these methods that can compute a variety of matrix functions. Distributed memory parallelization is based on a communication avoiding sparse matrix multiplication algorithm. OpenMP task parallellization is utilized to implement hybrid parallelization. We describe NTPoly's interface and show how it can be integrated with programs written in many different programming languages. We demonstrate the merits of NTPoly by performing large scale calculations on the K computer.

  12. A Note on Alternating Minimization Algorithm for the Matrix Completion Problem

    DOE PAGES

    Gamarnik, David; Misra, Sidhant

    2016-06-06

    Here, we consider the problem of reconstructing a low-rank matrix from a subset of its entries and analyze two variants of the so-called alternating minimization algorithm, which has been proposed in the past.We establish that when the underlying matrix has rank one, has positive bounded entries, and the graph underlying the revealed entries has diameter which is logarithmic in the size of the matrix, both algorithms succeed in reconstructing the matrix approximately in polynomial time starting from an arbitrary initialization.We further provide simulation results which suggest that the second variant which is based on the message passing type updates performsmore » significantly better.« less

  13. An examination of the association between interviewer question type and story-grammar detail in child witness interviews about abuse.

    PubMed

    Feltis, Brooke B; Powell, Martine B; Snow, Pamela C; Hughes-Scholes, Carolyn H

    2010-06-01

    This study compared the effects of open-ended versus specific questions, and various types of open-ended questions, in eliciting story-grammar detail in child abuse interviews. The sample included 34 police interviews with child witnesses aged 5-15 years (M age=9 years, 9 months). The interviewers' questions and their relative sub-types were classified according to definitions reported in the child interview training literature. The children's responses were classified according to the proportion of story grammar and the prevalence of individual story grammar elements as defined by Stein and Glenn (1979). Open-ended questions were more effective at eliciting story grammar than specific questions. This finding was revealed across three age groups, two interview phases and irrespective of how question effectiveness was measured. However, not all types of open-ended questions were equally effective. Open-ended questions that encouraged a broad response, or asked the child to elaborate on a part of their account, elicited more story-grammar detail compared to open-ended questions that requested clarification of concepts or descriptions of the next (or another) activity or detail within a sequence. This study demonstrates that children's ability to provide story-grammar detail is maximised when there is minimal prompting from the interviewer. Given the association between story grammar production and victim credibility, greater guidance is warranted in interviewer training programs in relation to the effects and administration of different types of open-ended questions. Copyright 2010 Elsevier Ltd. All rights reserved.

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

    PubMed

    Warnke-Sommer, Julia; Ali, Hesham

    2016-05-06

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

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

    PubMed Central

    Pan, Yongke; Niu, Wenjia

    2017-01-01

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

  16. Contradictory Information in the Input as the Cause of Multiple Grammars: Predictions for Bilingual Acquisition

    ERIC Educational Resources Information Center

    Unsworth, Sharon

    2014-01-01

    The central claim in Amaral and Roeper's (this issue; henceforth A&R) keynote article is that everyone is multilingual, whether they speak one or more languages. In a nutshell, the idea is that each speaker has multiple grammars or "sub-sets of rules (or sub-grammars) that co-exist". Thus, rather than positing complex rules to…

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

    PubMed

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

    2016-01-01

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

  18. Temporal Representation in Semantic Graphs

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

    Levandoski, J J; Abdulla, G M

    2007-08-07

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

  19. Character expansion methods for matrix models of dually weighted graphs

    NASA Astrophysics Data System (ADS)

    Kazakov, Vladimir A.; Staudacher, Matthias; Wynter, Thomas

    1996-04-01

    We consider generalized one-matrix models in which external fields allow control over the coordination numbers on both the original and dual lattices. We rederive in a simple fashion a character expansion formula for these models originally due to Itzykson and Di Francesco, and then demonstrate how to take the large N limit of this expansion. The relationship to the usual matrix model resolvent is elucidated. Our methods give as a by-product an extremely simple derivation of the Migdal integral equation describing the large N limit of the Itzykson-Zuber formula. We illustrate and check our methods by analysing a number of models solvable by traditional means. We then proceed to solve a new model: a sum over planar graphys possessing even coordination numbers on both the original and the dual lattice. We conclude by formulating the equations for the case of arbitrary sets of even, self-dual coupling constants. This opens the way for studying the deep problems of phase transitions from random to flat lattices. January 1995

  20. New Structural Patterns in Moribund Grammar: Case Marking in Heritage German

    PubMed Central

    Yager, Lisa; Hellmold, Nora; Joo, Hyoun-A; Putnam, Michael T.; Rossi, Eleonora; Stafford, Catherine; Salmons, Joseph

    2015-01-01

    Research treats divergences between monolingual and heritage grammars in terms of performance—‘L1 attrition,’ e.g., lexical retrieval—or competence—‘incomplete acquisition’, e.g., lack of overt tense markers (e.g., Polinsky, 1995; Sorace, 2004; Montrul, 2008; Schmid, 2010). One classic difference between monolingual and Heritage German is reduction in morphological case in the latter, especially loss of dative marking. Our evidence from several Heritage German varieties suggests that speakers have not merely lost case, but rather developed innovative structures to mark it. More specifically, Heritage German speakers produce dative forms in line with established patterns of Differential Object Marking (Bossong, 1985, 1991; Aissen, 2003), suggesting a reallocated mapping of case. We take this as evidence for innovative reanalysis in heritage grammars (Putnam and Sánchez, 2013). Following Kamp and Reyle (1993) and Wechsler (2011, 2014), the dative adopts a more indexical discourse function, forging a tighter connection between morphosyntax and semantic properties. Moribund grammars deploy linguistic resources in novel ways, a finding which can help move us beyond simple narratives of ‘attrition’ and ‘incomplete acquisition.’ PMID:26635649

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

    NASA Astrophysics Data System (ADS)

    Cheng, Jian

    The work in Chapter 2 is motivated by Tutte and Jaeger's pioneering work on converting modulo flows into integer-valued flows for ordinary graphs. For a signed graphs (G, sigma), we first prove that for each k ∈ {2, 3}, if (G, sigma) is (k - 1)-edge-connected and contains an even number of negative edges when k = 2, then every modulo k-flow of (G, sigma) can be converted into an integer-valued ( k + 1)-ow with a larger or the same support. We also prove that if (G, sigma) is odd-(2p+1)-edge-connected, then (G, sigma) admits a modulo circular (2 + 1/ p)-flows if and only if it admits an integer-valued circular (2 + 1/p)-flows, which improves all previous result by Xu and Zhang (DM2005), Schubert and Steffen (EJC2015), and Zhu (JCTB2015). Shortest circuit cover conjecture is one of the major open problems in graph theory. It states that every bridgeless graph G contains a set of circuits F such that each edge is contained in at least one member of F and the length of F is at most 7/5∥E(G)∥. This concept was recently generalized to signed graphs by Macajova et al. (JGT2015). In Chapter 3, we improve their upper bound from 11∥E( G)∥ to 14/3 ∥E(G)∥, and if G is 2-edgeconnected and has even negativeness, then it can be further reduced to 11/3 ∥E(G)∥. Tutte's 3-flow conjecture has been studied by many graph theorists in the last several decades. As a new approach to this conjecture, DeVos and Thomassen considered the vectors as ow values and found that there is a close relation between vector S1-flows and integer 3-NZFs. Motivated by their observation, in Chapter 4, we prove that if a graph G admits a vector S1-flow with rank at most two, then G admits an integer 3-NZF. The concept of even factors is highly related to the famous Four Color Theorem. We conclude this dissertation in Chapter 5 with an improvement of a recent result by Chen and Fan (JCTB2016) on the upperbound of even factors. We show that if a graph G contains an even factor, then it

  2. Do Null Subjects (Mis-)Trigger Pro-Drop Grammars?

    ERIC Educational Resources Information Center

    Frazier, Lyn

    2015-01-01

    Native speakers of English regularly hear sentences without overt subjects. Nevertheless, they maintain a [[superscript -]pro] grammar that requires sentences to have an overt subject. It is proposed that listeners of English recognize that speakers reduce predictable material and thus attribute null subjects to this process, rather than changing…

  3. Topologies on directed graphs

    NASA Technical Reports Server (NTRS)

    Lieberman, R. N.

    1972-01-01

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

  4. Walking Out Graphs

    ERIC Educational Resources Information Center

    Shen, Ji

    2009-01-01

    In the Walking Out Graphs Lesson described here, students experience several types of representations used to describe motion, including words, sentences, equations, graphs, data tables, and actions. The most important theme of this lesson is that students have to understand the consistency among these representations and form the habit of…

  5. Quantum walk on a chimera graph

    NASA Astrophysics Data System (ADS)

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

    2018-05-01

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

  6. Graph-Based Object Class Discovery

    NASA Astrophysics Data System (ADS)

    Xia, Shengping; Hancock, Edwin R.

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

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

    PubMed

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

    2018-01-01

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

  8. Claw-Free Maximal Planar Graphs

    DTIC Science & Technology

    1989-01-01

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

  9. Exact representation of the asymptotic drift speed and diffusion matrix for a class of velocity-jump processes

    NASA Astrophysics Data System (ADS)

    Mascia, Corrado

    2016-01-01

    This paper examines a class of linear hyperbolic systems which generalizes the Goldstein-Kac model to an arbitrary finite number of speeds vi with transition rates μij. Under the basic assumptions that the transition matrix is symmetric and irreducible, and the differences vi -vj generate all the space, the system exhibits a large-time behavior described by a parabolic advection-diffusion equation. The main contribution is to determine explicit formulas for the asymptotic drift speed and diffusion matrix in term of the kinetic parameters vi and μij, establishing a complete connection between microscopic and macroscopic coefficients. It is shown that the drift speed is the arithmetic mean of the velocities vi. The diffusion matrix has a more complicate representation, based on the graph with vertices the velocities vi and arcs weighted by the transition rates μij. The approach is based on an exhaustive analysis of the dispersion relation and on the application of a variant of the Kirchoff's matrix tree Theorem from graph theory.

  10. GenieTutor: A Computer Assisted Second-Language Learning System Based on Semantic and Grammar Correctness Evaluations

    ERIC Educational Resources Information Center

    Kwon, Oh-Woog; Lee, Kiyoung; Kim, Young-Kil; Lee, Yunkeun

    2015-01-01

    This paper introduces a Dialog-Based Computer-Assisted second-Language Learning (DB-CALL) system using semantic and grammar correctness evaluations and the results of its experiment. While the system dialogues with English learners about a given topic, it automatically evaluates the grammar and content properness of their English utterances, then…

  11. Cooperative Learning as a Correction and Grammar Revision Technique: Communicative Exchanges, Self-Correction Rates and Scores

    ERIC Educational Resources Information Center

    Servetti, Sara

    2010-01-01

    This paper focuses on cooperative learning (CL) used as a correction and grammar revision technique and considers the data collected in six Italian parallel classes, three of which (sample classes) corrected mistakes and revised grammar through cooperative learning, while the other three (control classes) in a traditional way. All the classes…

  12. Graph-drawing algorithms geometries versus molecular mechanics in fullereness

    NASA Astrophysics Data System (ADS)

    Kaufman, M.; Pisanski, T.; Lukman, D.; Borštnik, B.; Graovac, A.

    1996-09-01

    The algorithms of Kamada-Kawai (KK) and Fruchterman-Reingold (FR) have been recently generalized (Pisanski et al., Croat. Chem. Acta 68 (1995) 283) in order to draw molecular graphs in three-dimensional space. The quality of KK and FR geometries is studied here by comparing them with the molecular mechanics (MM) and the adjacency matrix eigenvectors (AME) algorithm geometries. In order to compare different layouts of the same molecule, an appropriate method has been developed. Its application to a series of experimentally detected fullerenes indicates that the KK, FR and AME algorithms are able to reproduce plausible molecular geometries.

  13. Random Walk Graph Laplacian-Based Smoothness Prior for Soft Decoding of JPEG Images.

    PubMed

    Liu, Xianming; Cheung, Gene; Wu, Xiaolin; Zhao, Debin

    2017-02-01

    Given the prevalence of joint photographic experts group (JPEG) compressed images, optimizing image reconstruction from the compressed format remains an important problem. Instead of simply reconstructing a pixel block from the centers of indexed discrete cosine transform (DCT) coefficient quantization bins (hard decoding), soft decoding reconstructs a block by selecting appropriate coefficient values within the indexed bins with the help of signal priors. The challenge thus lies in how to define suitable priors and apply them effectively. In this paper, we combine three image priors-Laplacian prior for DCT coefficients, sparsity prior, and graph-signal smoothness prior for image patches-to construct an efficient JPEG soft decoding algorithm. Specifically, we first use the Laplacian prior to compute a minimum mean square error initial solution for each code block. Next, we show that while the sparsity prior can reduce block artifacts, limiting the size of the overcomplete dictionary (to lower computation) would lead to poor recovery of high DCT frequencies. To alleviate this problem, we design a new graph-signal smoothness prior (desired signal has mainly low graph frequencies) based on the left eigenvectors of the random walk graph Laplacian matrix (LERaG). Compared with the previous graph-signal smoothness priors, LERaG has desirable image filtering properties with low computation overhead. We demonstrate how LERaG can facilitate recovery of high DCT frequencies of a piecewise smooth signal via an interpretation of low graph frequency components as relaxed solutions to normalized cut in spectral clustering. Finally, we construct a soft decoding algorithm using the three signal priors with appropriate prior weights. Experimental results show that our proposal outperforms the state-of-the-art soft decoding algorithms in both objective and subjective evaluations noticeably.

  14. Graph Theoretic Foundations of Multibody Dynamics Part I: Structural Properties

    PubMed Central

    Jain, Abhinandan

    2011-01-01

    This is the first part of two papers that use concepts from graph theory to obtain a deeper understanding of the mathematical foundations of multibody dynamics. The key contribution is the development of a unifying framework that shows that key analytical results and computational algorithms in multibody dynamics are a direct consequence of structural properties and require minimal assumptions about the specific nature of the underlying multibody system. This first part focuses on identifying the abstract graph theoretic structural properties of spatial operator techniques in multibody dynamics. The second part paper exploits these structural properties to develop a broad spectrum of analytical results and computational algorithms. Towards this, we begin with the notion of graph adjacency matrices and generalize it to define block-weighted adjacency (BWA) matrices and their 1-resolvents. Previously developed spatial operators are shown to be special cases of such BWA matrices and their 1-resolvents. These properties are shown to hold broadly for serial and tree topology multibody systems. Specializations of the BWA and 1-resolvent matrices are referred to as spatial kernel operators (SKO) and spatial propagation operators (SPO). These operators and their special properties provide the foundation for the analytical and algorithmic techniques developed in the companion paper. We also use the graph theory concepts to study the topology induced sparsity structure of these operators and the system mass matrix. Similarity transformations of these operators are also studied. While the detailed development is done for the case of rigid-link multibody systems, the extension of these techniques to a broader class of systems (e.g. deformable links) are illustrated. PMID:22102790

  15. When global structure "Explains Away" local grammar: a Bayesian account of rule-induction in tone sequences.

    PubMed

    Dawson, Colin; Gerken, Louann

    2011-09-01

    While many constraints on learning must be relatively experience-independent, past experience provides a rich source of guidance for subsequent learning. Discovering structure in some domain can inform a learner's future hypotheses about that domain. If a general property accounts for particular sub-patterns, a rational learner should not stipulate separate explanations for each detail without additional evidence, as the general structure has "explained away" the original evidence. In a grammar-learning experiment using tone sequences, manipulating learners' prior exposure to a tone environment affects their sensitivity to the grammar-defining feature, in this case consecutive repeated tones. Grammar-learning performance is worse if context melodies are "smooth" -- when small intervals occur more than large ones -- as Smoothness is a general property accounting for a high rate of repetition. We present an idealized Bayesian model as a "best case" benchmark for learning repetition grammars. When context melodies are Smooth, the model places greater weight on the small-interval constraint, and does not learn the repetition rule as well as when context melodies are not Smooth, paralleling the human learners. These findings support an account of abstract grammar-induction in which learners rationally assess the statistical evidence for underlying structure based on a generative model of the environment. Copyright © 2010 Elsevier B.V. All rights reserved.

  16. Cognitive Adequacy in a Dialogic Functional Discourse Grammar

    ERIC Educational Resources Information Center

    Mackenzie, J. Lachlan

    2012-01-01

    Functional Discourse Grammar (FDG), as a theory of the organization of natural languages, seeks to attain pragmatic, typological and cognitive adequacy. The attempt to achieve cognitive adequacy has been fraught with problems stemming from the vagueness of the concept and the difficulty of adapting to trends in psycholinguistics. Specifically,…

  17. Complexity, Training Paradigm Design, and the Contribution of Memory Subsystems to Grammar Learning

    PubMed Central

    Ettlinger, Marc; Wong, Patrick C. M.

    2016-01-01

    Although there is variability in nonnative grammar learning outcomes, the contributions of training paradigm design and memory subsystems are not well understood. To examine this, we presented learners with an artificial grammar that formed words via simple and complex morphophonological rules. Across three experiments, we manipulated training paradigm design and measured subjects' declarative, procedural, and working memory subsystems. Experiment 1 demonstrated that passive, exposure-based training boosted learning of both simple and complex grammatical rules, relative to no training. Additionally, procedural memory correlated with simple rule learning, whereas declarative memory correlated with complex rule learning. Experiment 2 showed that presenting corrective feedback during the test phase did not improve learning. Experiment 3 revealed that structuring the order of training so that subjects are first exposed to the simple rule and then the complex improved learning. The cumulative findings shed light on the contributions of grammatical complexity, training paradigm design, and domain-general memory subsystems in determining grammar learning success. PMID:27391085

  18. Exploring Graphs: WYSIWYG.

    ERIC Educational Resources Information Center

    Johnson, Millie

    1997-01-01

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

  19. Molecular graph convolutions: moving beyond fingerprints

    NASA Astrophysics Data System (ADS)

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

    2016-08-01

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

  20. Mining and Indexing Graph Databases

    ERIC Educational Resources Information Center

    Yuan, Dayu

    2013-01-01

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

  1. Tanzanian Swahili: Grammar Handbook. Peace Corps Language Handbook Series.

    ERIC Educational Resources Information Center

    Hawkinson, Annie K.

    This grammar handbook analyzes the rules of Tanzanian Swahili and provides different types of exercises on them. It is divided into 36 lessons and is illustrated with pen-and-ink drawings. A bibliography, index, and Swahili-English glossary complete the volume. (AMH)

  2. A Computer Program for Testing Grammars On-Line.

    ERIC Educational Resources Information Center

    Gross, Louis N.

    This paper describes a computer system which is intended to aid the linguist in building a transformational grammar. The program operates as a rule tester, performing three services for the user through sets of functions which allow the user to--specify, change, and print base trees (to which transformations would apply); define transformations…

  3. Path similarity skeleton graph matching.

    PubMed

    Bai, Xiang; Latecki, Longin Jan

    2008-07-01

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

  4. Enabling Graph Appliance for Genome Assembly

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

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

    2015-01-01

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

  5. Proving relations between modular graph functions

    NASA Astrophysics Data System (ADS)

    Basu, Anirban

    2016-12-01

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

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

  7. A Note on Hamiltonian Graphs

    ERIC Educational Resources Information Center

    Skurnick, Ronald; Davi, Charles; Skurnick, Mia

    2005-01-01

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

  8. Molecular graph convolutions: moving beyond fingerprints

    PubMed Central

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

    2016-01-01

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

  9. SING: Subgraph search In Non-homogeneous Graphs

    PubMed Central

    2010-01-01

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

  10. Faut-il Mettre "Un Bonnet Rouge" a la grammaire francaise (Must We Put a "Bonnet Rouge" on French Grammar?).

    ERIC Educational Resources Information Center

    Jaussaud, Francoise

    1989-01-01

    An experimental approach to French grammar instruction at the American School of Madrid, based on a restructuring of the grammar around the verb, provides a promising new perspective for language pedagogy. (MSE)

  11. Recursive Feature Extraction in Graphs

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

    2014-08-14

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

  12. The Case for a Realistic Beginning-Level Grammar Syllabus: The Round Peg in the Round Hole

    ERIC Educational Resources Information Center

    Heining-Boynton, Audrey L.

    2010-01-01

    The time has come to create a realistic grammar syllabus in the beginning language courses. Yet why do some in the profession insist that all grammar must be taught in the first year of language learning? Abundant data from decades of research on topics such as human memory, chunking, and second language acquisition exist that overwhelmingly…

  13. Output-Sensitive Construction of Reeb Graphs.

    PubMed

    Doraiswamy, H; Natarajan, V

    2012-01-01

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

  14. Functional Grammar and Teaching of Reading--A Pedagogy Based on Graded Teaching of College English in China

    ERIC Educational Resources Information Center

    Xu, Tuo; Zhang, Beili

    2015-01-01

    This article discusses the importance of functional grammar and demonstrates its application to the teaching of reading among graded college students. Functional grammar holds that a discourse is composed of two levels: the interior level and the exterior level. Therefore, reading activities involve both linguistic elements and contexts.…

  15. EEG: Elements of English Grammar: Rules Explained Simply.

    ERIC Educational Resources Information Center

    Van Winkle, Harold

    Intended to help interested people speak and write more correctly through self-instruction, this book presents the basic rules of standard English grammar in an easy-to-understand manner. The book's six chapters are as follows: (1) The Sentence; (2) Parts of Speech; (3) Case; (4) Modifiers; (5) Agreement; and (6) Building Better Sentences. The…

  16. Multigraph: Reusable Interactive Data Graphs

    NASA Astrophysics Data System (ADS)

    Phillips, M. B.

    2010-12-01

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

  17. The One Universal Graph — a free and open graph database

    NASA Astrophysics Data System (ADS)

    Ng, Liang S.; Champion, Corbin

    2016-02-01

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

  18. The P600 in Implicit Artificial Grammar Learning.

    PubMed

    Silva, Susana; Folia, Vasiliki; Hagoort, Peter; Petersson, Karl Magnus

    2017-01-01

    The suitability of the artificial grammar learning (AGL) paradigm to capture relevant aspects of the acquisition of linguistic structures has been empirically tested in a number of EEG studies. Some have shown a syntax-related P600 component, but it has not been ruled out that the AGL P600 effect is a response to surface features (e.g., subsequence familiarity) rather than the underlying syntax structure. Therefore, in this study, we controlled for the surface characteristics of the test sequences (associative chunk strength) and recorded the EEG before (baseline preference classification) and after (preference and grammaticality classification) exposure to a grammar. After exposure, a typical, centroparietal P600 effect was elicited by grammatical violations and not by unfamiliar subsequences, suggesting that the AGL P600 effect signals a response to structural irregularities. Moreover, preference and grammaticality classification showed a qualitatively similar ERP profile, strengthening the idea that the implicit structural mere-exposure paradigm in combination with preference classification is a suitable alternative to the traditional grammaticality classification test. Copyright © 2016 Cognitive Science Society, Inc.

  19. A proximity-based graph clustering method for the identification and application of transcription factor clusters.

    PubMed

    Spadafore, Maxwell; Najarian, Kayvan; Boyle, Alan P

    2017-11-29

    Transcription factors (TFs) form a complex regulatory network within the cell that is crucial to cell functioning and human health. While methods to establish where a TF binds to DNA are well established, these methods provide no information describing how TFs interact with one another when they do bind. TFs tend to bind the genome in clusters, and current methods to identify these clusters are either limited in scope, unable to detect relationships beyond motif similarity, or not applied to TF-TF interactions. Here, we present a proximity-based graph clustering approach to identify TF clusters using either ChIP-seq or motif search data. We use TF co-occurrence to construct a filtered, normalized adjacency matrix and use the Markov Clustering Algorithm to partition the graph while maintaining TF-cluster and cluster-cluster interactions. We then apply our graph structure beyond clustering, using it to increase the accuracy of motif-based TFBS searching for an example TF. We show that our method produces small, manageable clusters that encapsulate many known, experimentally validated transcription factor interactions and that our method is capable of capturing interactions that motif similarity methods might miss. Our graph structure is able to significantly increase the accuracy of motif TFBS searching, demonstrating that the TF-TF connections within the graph correlate with biological TF-TF interactions. The interactions identified by our method correspond to biological reality and allow for fast exploration of TF clustering and regulatory dynamics.

  20. A new algorithm to find fuzzy Hamilton cycle in a fuzzy network using adjacency matrix and minimum vertex degree.

    PubMed

    Nagoor Gani, A; Latha, S R

    2016-01-01

    A Hamiltonian cycle in a graph is a cycle that visits each node/vertex exactly once. A graph containing a Hamiltonian cycle is called a Hamiltonian graph. There have been several researches to find the number of Hamiltonian cycles of a Hamilton graph. As the number of vertices and edges grow, it becomes very difficult to keep track of all the different ways through which the vertices are connected. Hence, analysis of large graphs can be efficiently done with the assistance of a computer system that interprets graphs as matrices. And, of course, a good and well written algorithm will expedite the analysis even faster. The most convenient way to quickly test whether there is an edge between two vertices is to represent graphs using adjacent matrices. In this paper, a new algorithm is proposed to find fuzzy Hamiltonian cycle using adjacency matrix and the degree of the vertices of a fuzzy graph. A fuzzy graph structure is also modeled to illustrate the proposed algorithms with the selected air network of Indigo airlines.

  1. Computing Information Value from RDF Graph Properties

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

    al-Saffar, Sinan; Heileman, Gregory

    2010-11-08

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

  2. Kevin Bacon and Graph Theory

    ERIC Educational Resources Information Center

    Hopkins, Brian

    2004-01-01

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

  3. Implicit Acquisition of Grammars with Crossed and Nested Non-Adjacent Dependencies: Investigating the Push-Down Stack Model

    ERIC Educational Resources Information Center

    Udden, Julia; Ingvar, Martin; Hagoort, Peter; Petersson, Karl M.

    2012-01-01

    A recent hypothesis in empirical brain research on language is that the fundamental difference between animal and human communication systems is captured by the distinction between finite-state and more complex phrase-structure grammars, such as context-free and context-sensitive grammars. However, the relevance of this distinction for the study…

  4. Characteristics of Early Vocabulary and Grammar Development in Slovenian-Speaking Infants and Toddlers: A CDI-Adaptation Study

    ERIC Educational Resources Information Center

    Marjanovic-Umek, Ljubica; Fekonja-Peklaj, Urska; Podlesek, Anja

    2013-01-01

    A large body of research shows that vocabulary does not develop independently of grammar, representing a better predictor of the grammatical complexity of toddlers' utterances than age. This study examines for the first time the characteristics of vocabulary and grammar development in Slovenian-speaking infants and toddlers using the Slovenian…

  5. Model predictive control of P-time event graphs

    NASA Astrophysics Data System (ADS)

    Hamri, H.; Kara, R.; Amari, S.

    2016-12-01

    This paper deals with model predictive control of discrete event systems modelled by P-time event graphs. First, the model is obtained by using the dater evolution model written in the standard algebra. Then, for the control law, we used the finite-horizon model predictive control. For the closed-loop control, we used the infinite-horizon model predictive control (IH-MPC). The latter is an approach that calculates static feedback gains which allows the stability of the closed-loop system while respecting the constraints on the control vector. The problem of IH-MPC is formulated as a linear convex programming subject to a linear matrix inequality problem. Finally, the proposed methodology is applied to a transportation system.

  6. The Emergence of Grammar: Early Verbs and beyond

    ERIC Educational Resources Information Center

    Armon-Lotem, Sharon; Berman, Ruth A.

    2003-01-01

    The paper examines the first twenty verb-forms recorded for six Hebrew-speaking children aged between 1;2 and 2;1, and how they evolve into fully inflected verbs for three of these children. Discussion focuses first on what word-forms children initially select for the verbs they produce, what role these forms play in children's emergent grammar,…

  7. What Should Be Explicit in Explicit Grammar Instruction?

    ERIC Educational Resources Information Center

    Nagai, Noriko; Ayano, Seiki; Okada, Keiko; Nakanishi, Takayuki

    2015-01-01

    This article proposes an approach to explicit grammar instruction that seeks to develop metalinguistic knowledge of the L2 and raise L2 learners' awareness of their L1, which is crucial for the success of second language acquisition (Ellis 1997, 2002). If explicit instruction is more effective than implicit instruction (Norris and Ortega 2000),…

  8. A Practical Spanish Grammar for Border Patrol Officers.

    ERIC Educational Resources Information Center

    Border Patrol Academy, El Paso, TX.

    Designed to be used in the Spanish training program for probationary officers at the Border Patrol Academy in El Paso, Texas, this revised 21-lesson traditional grammar text includes special features that make it pertinent to the job of a patrol inspector in the Mexican border area. An extensive appendix is comprised of exercise translations,…

  9. Multi-A Graph Patrolling and Partitioning

    NASA Astrophysics Data System (ADS)

    Elor, Y.; Bruckstein, A. M.

    2012-12-01

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

  10. Sketch Matching on Topology Product Graph.

    PubMed

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

    2015-08-01

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

  11. Discussion. How Far Does a Construction Grammar Approach to Argument Structure Take Us in Understanding Children's Language Development?

    ERIC Educational Resources Information Center

    Journal of Child Language, 1998

    1998-01-01

    Presents the responses of 12 authors to Michael Tomasello's essay, which comments on Adele Goldberg's recent book, "Constructions: A Construction Grammar Approach to Argument Structure." Goldberg's book develops the theory of construction grammar for a set of problems associated with verb-argument structure. (SM)

  12. The Histories and Mysteries of Grammar Instruction: Supporting Elementary Teachers in the Time of the Common Core

    ERIC Educational Resources Information Center

    Gartland, Lauren B.; Smolkin, Laura B.

    2016-01-01

    The reemergence of grammar instruction in the Common Core State Standards has likely left teachers confused. On the one hand, they have been told repeatedly that grammar instruction does not improve student outcomes, and can, in fact, be "harmful" to students. However, on the other hand, many Anglophone countries, including the United…

  13. The effect of subjective awareness measures on performance in artificial grammar learning task.

    PubMed

    Ivanchei, Ivan I; Moroshkina, Nadezhda V

    2018-01-01

    Systematic research into implicit learning requires well-developed awareness-measurement techniques. Recently, trial-by-trial measures have been widely used. However, they can increase complexity of a study because they are an additional experimental variable. We tested the effects of these measures on performance in artificial grammar learning study. Four groups of participants were assigned to different awareness measures conditions: confidence ratings, post-decision wagering, decision strategy attribution or none. Decision-strategy-attribution participants demonstrated better grammar learning and longer response times compared to controls. They also exhibited a conservative bias. Grammaticality by itself was a stronger predictor of strings endorsement in decision-strategy-attribution group compared to other groups. Confidence ratings and post-decision wagering only affected the response times. These results were supported by an additional experiment that used a balanced chunk strength design. We conclude that a decision-strategy-attribution procedure may force participants to adopt an analytical decision-making strategy and rely mostly on conscious knowledge of artificial grammar. Copyright © 2017 Elsevier Inc. All rights reserved.

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

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

  16. Counting spanning trees on fractal graphs and their asymptotic complexity

    NASA Astrophysics Data System (ADS)

    Anema, Jason A.; Tsougkas, Konstantinos

    2016-09-01

    Using the method of spectral decimation and a modified version of Kirchhoff's matrix-tree theorem, a closed form solution to the number of spanning trees on approximating graphs to a fully symmetric self-similar structure on a finitely ramified fractal is given in theorem 3.4. We show how spectral decimation implies the existence of the asymptotic complexity constant and obtain some bounds for it. Examples calculated include the Sierpiński gasket, a non-post critically finite analog of the Sierpiński gasket, the Diamond fractal, and the hexagasket. For each example, the asymptotic complexity constant is found.

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

    ERIC Educational Resources Information Center

    Xi, Xiaoming

    2010-01-01

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

  18. Decomposition Algorithm for Global Reachability Analysis on a Time-Varying Graph with an Application to Planetary Exploration

    NASA Technical Reports Server (NTRS)

    Kuwata, Yoshiaki; Blackmore, Lars; Wolf, Michael; Fathpour, Nanaz; Newman, Claire; Elfes, Alberto

    2009-01-01

    Hot air (Montgolfiere) balloons represent a promising vehicle system for possible future exploration of planets and moons with thick atmospheres such as Venus and Titan. To go to a desired location, this vehicle can primarily use the horizontal wind that varies with altitude, with a small help of its own actuation. A main challenge is how to plan such trajectory in a highly nonlinear and time-varying wind field. This paper poses this trajectory planning as a graph search on the space-time grid and addresses its computational aspects. When capturing various time scales involved in the wind field over the duration of long exploration mission, the size of the graph becomes excessively large. We show that the adjacency matrix of the graph is block-triangular, and by exploiting this structure, we decompose the large planning problem into several smaller subproblems, whose memory requirement stays almost constant as the problem size grows. The approach is demonstrated on a global reachability analysis of a possible Titan mission scenario.

  19. Improving DHH Students' Grammar through an Individualized Software Program

    ERIC Educational Resources Information Center

    Cannon, Joanna E.; Easterbrooks, Susan R.; Gagne, Phill; Beal-Alvarez, Jennifer

    2011-01-01

    The purpose of this study was to determine if the frequent use of a targeted, computer software grammar instruction program, used as an individualized classroom activity, would influence the comprehension of morphosyntax structures (determiners, tense, and complementizers) in deaf/hard-of-hearing (DHH) participants who use American Sign Language…

  20. RATGRAPH: Computer Graphing of Rational Functions.

    ERIC Educational Resources Information Center

    Minch, Bradley A.

    1987-01-01

    Presents an easy-to-use Applesoft BASIC program that graphs rational functions and any asymptotes that the functions might have. Discusses the nature of rational functions, graphing them manually, employing a computer to graph rational functions, and describes how the program works. (TW)