A graph grammar approach to artificial life.
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. PMID:15479546
Graphs and Grammars for Histology: An Introduction
Prewitt, Judith M. S.
1979-01-01
The invention of the microscope disclosed a whole new world, that of the hitherto invisibly small. Histologic evidence as revealed by the microscope has become a cornerstone of medical diagnosis, and efforts are now being made to lay foundations so that the medical visual information processing burden can be alleviated significantly by cost-effective automation. This paper lays image processing foundations by presenting a graph-theoretic and syntactic model for the analysis of histologic patterns, and presents results to date.
An approach to multiscale modelling with graph grammars
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
Generative Graph Grammar of Neo-Vaiśeṣika Formal Ontology (NVFO)
NASA Astrophysics Data System (ADS)
Tavva, Rajesh; Singh, Navjyoti
NLP applications for Sanskrit so far work within computational paradigm of string grammars. However, to compute 'meanings', as in traditional śā bdabodha prakriyā-s, there is a need to develop suitable graph grammars. Ontological structures are fundamentally graphs. We work within the formal framework of Neo-Vaiśeṣika Formal Ontology (NVFO) to propose a generative graph grammar. The proposed formal grammar only produces well-formed graphs that can be readily interpreted in accordance with Vaiśeṣ ika Ontology. We show that graphs not permitted by Vaiśeṣ ika ontology are not generated by the proposed grammar. Further, we write Interpreter of these graphical structures. This creates computational environment which can be deployed for writing computational applications of Vaiśeṣ ika ontology. We illustrate how this environment can be used to create applications like computing śā bdabodha of sentences.
Quantum graphs and random-matrix theory
NASA Astrophysics Data System (ADS)
Pluhař, Z.; Weidenmüller, H. A.
2015-07-01
For simple connected graphs with incommensurate bond lengths and with unitary symmetry we prove the Bohigas-Giannoni-Schmit (BGS) conjecture in its most general form. Using supersymmetry and taking the limit of infinite graph size, we show that the generating function for every (P,Q) correlation function for both closed and open graphs coincides with the corresponding expression of random-matrix theory. We show that the classical Perron-Frobenius operator is bistochastic and possesses a single eigenvalue +1. In the quantum case that implies the existence of a zero (or massless) mode of the effective action. That mode causes universal fluctuation properties. Avoiding the saddle-point approximation we show that for graphs that are classically mixing (i.e. for which the spectrum of the classical Perron-Frobenius operator possesses a finite gap) and that do not carry a special class of bound states, the zero mode dominates in the limit of infinite graph size.
The uniqueness of DMAX-matrix graph invariants.
Dehmer, Matthias; Shi, Yongtang
2014-01-01
In this paper, we examine the uniqueness (discrimination power) of a newly proposed graph invariant based on the matrix DMAX defined by Randić et al. In order to do so, we use exhaustively generated graphs instead of special graph classes such as trees only. Using these graph classes allow us to generalize the findings towards complex networks as they usually do not possess any structural constraints. We obtain that the uniqueness of this newly proposed graph invariant is approximately as low as the uniqueness of the Balaban J index on exhaustively generated (general) graphs. PMID:24392099
Applications of optical Boolean matrix operations to graph theory.
Gibson, P M; Caulfield, H J
1991-09-10
The transition from optical numerical matrix algebra to optical Boolean matrix algebra is explored in detail. All important Boolean matrix algebra tasks can be performed optically. Quantitative measurement is replaced by a simple light-or-no-light decision, something optics can do well. The parallelism advantage of optics becomes greater as the matrix size increases. As an illustration of utility, we consider graph theory. PMID:20706446
Link prediction on evolving graphs using matrix and tensor factorizations.
Dunlavy, Daniel M.; Acar, Evrim; Kolda, Tamara Gibson
2010-06-01
The data in many disciplines such as social networks, web analysis, etc. is link-based, and the link structure can be exploited for many different data mining tasks. In this paper, we consider the problem of temporal link prediction: Given link data for time periods 1 through T, can we predict the links in time period T + 1? Specifically, we look at bipartite graphs changing over time and consider matrix- and tensor-based methods for predicting links. We present a weight-based method for collapsing multi-year data into a single matrix. We show how the well-known Katz method for link prediction can be extended to bipartite graphs and, moreover, approximated in a scalable way using a truncated singular value decomposition. Using a CANDECOMP/PARAFAC tensor decomposition of the data, we illustrate the usefulness of exploiting the natural three-dimensional structure of temporal link data. Through several numerical experiments, we demonstrate that both matrix- and tensor-based techniques are effective for temporal link prediction despite the inherent difficulty of the problem.
Quantum state representation based on combinatorial Laplacian matrix of star-relevant graph
NASA Astrophysics Data System (ADS)
Li, Jian-Qiang; Chen, Xiu-Bo; Yang, Yi-Xian
2015-12-01
In this paper the density matrices derived from combinatorial Laplacian matrix of graphs is considered. More specifically, the paper places emphasis on the star-relevant graph, which means adding certain edges on peripheral vertices of star graph. Initially, we provide the spectrum of the density matrices corresponding to star-like graph (i.e., adding an edge on star graph) and present that the Von Neumann entropy increases under the graph operation (adding an edge on star graph) and the graph operation cannot be simulated by local operation and classical communication (LOCC). Subsequently, we illustrate the spectrum of density matrices corresponding to star-alike graph (i.e., adding one edge on star-like graph) and exhibit that the Von Neumann entropy increases under the graph operation (adding an edge on star-like graph) and the graph operation cannot be simulated by LOCC. Finally, the spectrum of density matrices corresponding to star-mlike graph (i.e., adding m nonadjacent edges on the peripheral vertices of star graph) is demonstrated and the relation between the graph operation and Von Neumann entropy, LOCC is revealed in this paper.
Tracing retinal blood vessels by matrix-forest theorem of directed graphs.
Cheng, Li; De, Jaydeep; Zhang, Xiaowei; Lin, Feng; Li, Huiqi
2014-01-01
This paper aims to trace retinal blood vessel trees in fundus images. This task is far from being trivial as the crossover of vessels are commonly encountered in image-based vessel networks. Meanwhile it is often crucial to separate the vessel tree structures in applications such as diabetic retinopathy analysis. In this work, a novel directed graph based approach is proposed to cast the task as label propagation over directed graphs, such that the graph is to be partitioned into disjoint sub-graphs, or equivalently, each of the vessel trees is traced and separated from the rest of the vessel network. Then the tracing problem is addressed by making novel usage of the matrix-forest theorem in algebraic graph theory. Empirical experiments on synthetic as well as publicly available fundus image datasets demonstrate the applicability of our approach. PMID:25333171
Local quality functions for graph clustering with non-negative matrix factorization
NASA Astrophysics Data System (ADS)
van Laarhoven, Twan; Marchiori, Elena
2014-12-01
Many graph clustering quality functions suffer from a resolution limit, namely the inability to find small clusters in large graphs. So-called resolution-limit-free quality functions do not have this limit. This property was previously introduced for hard clustering, that is, graph partitioning. We investigate the resolution-limit-free property in the context of non-negative matrix factorization (NMF) for hard and soft graph clustering. To use NMF in the hard clustering setting, a common approach is to assign each node to its highest membership cluster. We show that in this case symmetric NMF is not resolution-limit free, but that it becomes so when hardness constraints are used as part of the optimization. The resulting function is strongly linked to the constant Potts model. In soft clustering, nodes can belong to more than one cluster, with varying degrees of membership. In this setting resolution-limit free turns out to be too strong a property. Therefore we introduce locality, which roughly states that changing one part of the graph does not affect the clustering of other parts of the graph. We argue that this is a desirable property, provide conditions under which NMF quality functions are local, and propose a novel class of local probabilistic NMF quality functions for soft graph clustering.
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…
Li, Qu; 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. PMID:24757410
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.
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.
Exact scattering matrix of graphs in magnetic field and quantum noise
Caudrelier, Vincent; Mintchev, Mihail; Ragoucy, Eric
2014-08-15
We consider arbitrary quantum wire networks modelled by finite, noncompact, connected quantum graphs in the presence of an external magnetic field. We find a general formula for the total scattering matrix of the network in terms of its local scattering properties and its metric structure. This is applied to a quantum ring with N external edges. Connecting the external edges of the ring to heat reservoirs, we study the quantum transport on the graph in ambient magnetic field. We consider two types of dynamics on the ring: the free Schrödinger and the free massless Dirac equations. For each case, a detailed study of the thermal noise is performed analytically. Interestingly enough, in presence of a magnetic field, the standard linear Johnson-Nyquist law for the low temperature behaviour of the thermal noise becomes nonlinear. The precise regime of validity of this effect is discussed and a typical signature of the underlying dynamics is observed.
Lawniczak, Michał; Hul, Oleh; Bauch, Szymon; Seba, Petr; Sirko, Leszek
2008-05-01
We present the results of an experimental and numerical study of the distribution of the reflection coefficient P(R) and the distributions of the imaginary P(v) and the real P(u) parts of the Wigner reaction K matrix for irregular fully connected hexagon networks (graphs) in the presence of strong absorption. In the experiment we used microwave networks, which were built of coaxial cables and attenuators connected by joints. In the numerical calculations experimental networks were described by quantum fully connected hexagon graphs. The presence of absorption introduced by attenuators was modeled by optical potentials. The distribution of the reflection coefficient P(R) and the distributions of the reaction K matrix were obtained from measurements and numerical calculations of the scattering matrix S of the networks and graphs, respectively. We show that the experimental and numerical results are in good agreement with the exact analytic ones obtained within the framework of random matrix theory. PMID:18643145
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 the representation of grammar formalisms.
ERIC Educational Resources Information Center
Wood, Mary McGee; Hudson, Richard, Ed.
Written as an objective critical assessment, this book is the first linguistic theory guide to categorial grammars. Categorial grammars offer a radical alternative to the phrase-structure paradigm, with roots in the philosophy of language, logic, and algebra. Their historical evolution is outlined and their formal basis is discussed, beginning…
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…
A matrix product algorithm for stochastic dynamics on locally tree-like graphs
NASA Astrophysics Data System (ADS)
Barthel, Thomas; de Bacco, Caterina; Franz, Silvio
In this talk, I describe a novel algorithm for the efficient simulation of generic stochastic dynamics of classical degrees of freedom defined on the vertices of locally tree-like graphs. Such models correspond for example to spin-glass systems, Boolean networks, neural networks, or other technological, biological, and social networks. Building upon the cavity method and ideas from quantum many-body theory, the algorithm is based on a matrix product approximation of the so-called edge messages - conditional probabilities of vertex variable trajectories. The matrix product edge messages (MPEM) are constructed recursively. Computation costs and accuracy can be tuned by controlling the matrix dimensions of the MPEM in truncations. In contrast to Monte Carlo simulations, the approach has a better error scaling and works for both, single instances as well as the thermodynamic limit. Due to the absence of cancellation effects, observables with small expectation values can be evaluated accurately, allowing for the study of decay processes and temporal correlations with unprecedented accuracy. The method is demonstrated for the prototypical non-equilibrium Glauber dynamics of an Ising spin system. Reference: arXiv:1508.03295.
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.
ERIC Educational Resources Information Center
Berry, Roger
2015-01-01
This paper looks at the continued survival of "myths" about English grammar, for example, the statement that in negative and interrogative sentences "any" should be used instead of "some". It is based on a survey of 195 Hong Kong students majoring in English, in five different cohorts, which found that such myths are…
ERIC Educational Resources Information Center
Cernik, Jiri
The grammar is designed to be used as a reference for addressing structural problems in Czech. The guide is organized into 11 chapters. The first describes the pronunciation of written Czech and explains spelling conventions. Aspects of the language covered here include the alphabet, arrangement of words in the dictionary, vowels, diphthongs,…
ERIC Educational Resources Information Center
Sipe, Rebecca Bowers
2006-01-01
As a new faculty member, the author was invited by colleagues to help protect a resource they believed was essential to their instructional program. The importance of teaching grammar in a didactic fashion as a precursor to student writing constituted an unchallenged belief in the department. Faculty members were committed to the notion that…
ERIC Educational Resources Information Center
Stanley, Julia P.
From the beginnings of English grammar in the early sixteenth century, our language has been described by men, and the usage promulgated as the "standard" has been that of men. Because men have been able to effectively control English through their control of the communications media and educational institutions, they have made our language an…
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…
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…
Graphs, matrices, and the GraphBLAS: Seven good reasons
Kepner, Jeremy; Bader, David; Buluç, Aydın; Gilbert, John; Mattson, Timothy; Meyerhenke, Henning
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 implement 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.
Graphs, matrices, and the GraphBLAS: Seven good reasons
Kepner, Jeremy; Bader, David; Buluç, Aydın; Gilbert, John; Mattson, Timothy; Meyerhenke, Henning
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
Charniak, E.
1996-12-31
By a {open_quotes}tree-bank grammar{close_quotes} we mean a context-free grammar created by reading the production rules directly from hand-parsed sentences in a tree bank. Common wisdom has it that such grammars do not perform well, though we know of no published data on the issue. The primary purpose of this paper is to show that the common wisdom is wrong. In particular, we present results on a tree-bank grammar based on the Penn Wall Street Journal tree bank. To the best of our knowledge, this grammar outperforms all other non-word-based statistical parsers/grammars on this corpus. That is, it outperforms parsers that consider the input as a string of tags and ignore the actual words of the corpus.
Logofet, D O; Belova, I N; Kazantseva, E S; Onipchenko, V G
2016-01-01
For the plant species, which is considered a short-lived perennial, we have composed a scale of ontogenetic stages and the life cycle graph (LCG) according to annual observations on permanent sample plots in an Alpine lichen heath during the 2009-2014 period. The LCG that reflects seed reproduction has been reduced to the one that avoids the stage of soil seed bank, yet preserves the arcs of annual recruitment. The corresponding matrix model of stage-structured population dynamics has four stages: juvenile plants (including seedlings), virginal, generative, and 'terminally generative' (the plants die after seed production). Model calibration reduces to directly calculating the rates of transition between stages and those of delays within stages from the data of only one time step, while keeping the two reproduction rates uncertain, yet confined to the quantitative bounds of observed recruitment. This has enabled us to determine a feasible range for the dominant eigenvalue of the model matrix, i.e., the quantitative bounds for the measure of how the local population adapts to its environment, at each of the five time steps, resulting in aformally nonautonomous model. To obtain 'age-specific parameters' from a stage-classified model, we have applied the technique that constructs a virtual absorbing Markov chain and calculates its fundamental matrix. In a nonautonomous model, the estimates of life expectancy also depend on the time of observation (that fixes certain environmental conditions), and vary from two to nearly seven years. The estimates reveal how specifically short lives the short-lived perennial, while their range motivates the task to average the model matrices over the whole period of observation. The model indicates that Eritrichium caucasicum plants spend the most part of their life span in the virginal stage under each of the environment conditions observed, thus revealing the place retention strategy by C. K6rner (2003), or the delayed
Grammar Instruction and Technology
ERIC Educational Resources Information Center
Lacina, Jan
2005-01-01
Much of the research literature from the past 25 years has supported the importance of teaching grammar in the context of writing instruction (Calkins, 1980; DiStefano & Killion, 1984; Weaver, 1996,1998). Unlike other content areas, practice does not make perfect when learning grammar. While isolated drill and practice of grammatical concepts may…
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…
ERIC Educational Resources Information Center
Dumond, Val
Noting that grammar is alive, changing, and controversial, this book offers a combination of guidelines and creative language use for people who have already been exposed to the rules of grammar to help them start building their own style of speaking and writing. The first part of the book "Recalling the Parts of Speech," provides a review of the…
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…
Phonology without universal grammar
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
Phonology without universal grammar.
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
Grammar and the Language Arts.
ERIC Educational Resources Information Center
Faulkner, Janice H.
This book introduces a specific approach to sentence analysis by comparing traditional grammar with newer methods, including transformational grammar. The first chapter discusses the teaching of grammar and language skills and the use of standard and nonstandard dialects. Traditional grammar is defined and discussed in chapter 2. The other…
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…
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
Knowing Chinese character grammar.
Myers, James
2016-02-01
Chinese character structure has often been described as representing a kind of grammar, but the notion of character grammar has hardly been explored. Patterns in character element reduplication are particularly grammar-like, displaying discrete combinatoriality, binarity, phonology-like final prominence, and potentially the need for symbolic rules (X→XX). To test knowledge of these patterns, Chinese readers were asked to judge the acceptability of fake characters varying both in grammaticality (obeying or violating reduplication constraints) and in lexicality (of the reduplicative configurations). While lexical knowledge was important (lexicality improved acceptability and grammatical configurations were accepted more quickly when also lexical), grammatical knowledge was important as well, with grammaticality improving acceptability equally for lexical and nonlexical configurations. Acceptability was also higher for more frequent reduplicative elements, suggesting that the reduplicative configurations were decomposed. Chinese characters present an as-yet untapped resource for exploring fundamental questions about the nature of the human capacity for grammar. PMID:26684059
ERIC Educational Resources Information Center
Spinks, Nelda H.; Wells, Barron W.; Meche, Melanie
1997-01-01
Analysis of the use of Gram.mat.ik IV grammar checker software in business communication classes found 114 errors the program did not identify in 67 student papers. Modifications of the software were recommended to increase its usefulness. (SK)
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…
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…
ERIC Educational Resources Information Center
Noble, Tracy; And Others
Graphs without a time axis, such as velocity-versus-position graphs, offer interesting possibilities for exploring graphing and motion. Relations depicted by these graphs are not limited to functions. Interviews with a high school student named Olivia, who uses a motion detector to create such graphs, indicate that she uses thought experiments as…
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…
GPS (Grammar Positioning System)
ERIC Educational Resources Information Center
Blaauw-Hara, Mark; Anderson, Andy
2007-01-01
In this Cross Talk, Mark Blaauw-Hara, the author of "Mapping the Frontier: A Survey of Twenty Years of Grammar Articles in 'TETYC,'" and one of the manuscript's reviewers, Andy Anderson, engage in a brief conversation about the essay, its content, and the processes of writing, reviewing, and revising. This article is presented in three sections:…
ERIC Educational Resources Information Center
NOSS, RICHARD B.
A REFERENCE GRAMMAR FOR THE THAI LANGUAGE IS PROVIDED. THE MAIN STRUCTURAL FEATURES OF STANDARD SPOKEN THAI ARE OUTLINED AND ELABORATED BY SUBCLASSIFICATION AND EXAMPLE. IN ADDITION, AN INDEX OF MINOR FORM-CLASS MEMBERS IS PROVIDED. THE APPROACH TO CLASSIFICATION OF GRAMMATICAL FEATURES FOLLOWS CURRENT TECHNIQUES OF AMERICAN DESCRIPTIVE…
Grammar Gremlins Haunt Writers.
ERIC Educational Resources Information Center
Phillips, Kay
1999-01-01
Argues that grammar instruction is important and should begin early. Lists rules for using the comma, colon, and semi-colon. Notes 10 tips for top-notch writing. Notes grammatical areas often troublesome to students. Includes a short quiz. (SR)
ERIC Educational Resources Information Center
Nunan, David
1998-01-01
Argues for an alternative to the conventional linear model of language acquisition in the learning of second-language grammar, proposing a more organic approach. The two approaches are contrasted, drawing on research in second-language learning and discourse analysis that supports the organic view. Some pedagogical implications of this approach…
ERIC Educational Resources Information Center
Batstone, Rob; Ellis, Rod
2009-01-01
A key aspect of the acquisition of grammar for second language learners involves learning how to make appropriate connections between grammatical forms and the meanings which they typically signal. We argue that learning form/function mappings involves three interrelated principles. The first is the Given-to-New Principle, where existing world…
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 language…
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…
ERIC Educational Resources Information Center
Bloom, Lois
1971-01-01
Children's early attempts at syntax, previously described in terms of pivot grammar, are discussed in the light of the author's research on the semantic intentions of early two-word sentences. Underlying conceptual relations were identified when such utterances were examined along with context and behavior. (Author/KW)
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…
ERIC Educational Resources Information Center
CARDONA, GEORGE
THIS REFERENCE GRAMMAR WAS WRITTEN TO FILL THE NEED FOR AN UP-TO-DATE ANALYSIS OF THE MODERN LANGUAGE SUITABLE FOR LANGUAGE LEARNERS AS WELL AS LINGUISTS. THE AUTHOR LISTS IN THE INTRODUCTION THOSE STUDIES PREVIOUS TO THIS ONE WHICH MAY BE OF INTEREST TO THE READER. INCLUDED IN HIS ANALYSIS OF THE LANGUAGE ARE MAJOR CHAPTERS ON--(1) PHONOLOGY, (2)…
ERIC Educational Resources Information Center
SAMARIN, WILLIAM J.
THE GRAMMAR OF SANGO (THE LINGUA-FRANCA OF THE CENTRAL AFRICAN REPUBLIC) IS DESCRIBED IN THREE PARTS OF THIS TEXT. TWO ADDITIONAL PARTS ARE DEVOTED TO RELATED INFORMATION AND ILLUSTRATION. PART ONE, PHONOLOGY, IS CONCERNED WITH A DESCRIPTION AND EXEMPLIFICATION OF THE PHONEMES OF SANGO, A DISCUSSION OF THE VARIATIONS BETWEEN WORDS WHICH RESULT…
ERIC Educational Resources Information Center
Truscott, John
2014-01-01
Optionality is a central phenomenon in second language acquisition (SLA), for which any adequate theory must account. Amaral and Roeper (this issue; henceforth A&R) offer an appealing approach to it, using Roeper's Multiple Grammars Theory, which was created with first language in mind but which extends very naturally to SLA. They include…
Parsing and translation of (attributed) expansive graph languages for scene analysis.
Shi, Q Y; Fu, K S
1983-05-01
In this paper, we suggest a class of (attributed) expansive graph grammars which generate languages contained in a graph family ¿. It turns out that by means of node renumbering using a very effi-cient algorithm, any graph in ¿ can be converted into a standard form, which enables the use of related string representation for that graph to facilitate the syntax analysis. As a consequence, the syntax analysis of (attributed) expansive graph language is very efficient and almost like the parsing of tree languages. Furthermore, a syntax-directed transla-tion can be established for mapping one (attributed) expansive graph language to another. Finally, since many relational graphs for scene analysis can be considered as belonging to these graph languages, the proposed graph grammar model appears to be quite attractive from the application point of view. PMID:21869132
Spectral fluctuations of quantum graphs
Pluhař, Z.; Weidenmüller, H. A.
2014-10-15
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.
Grammar Dilemma: Teaching Grammar as a Resource for Making Meaning
ERIC Educational Resources Information Center
Liamkina, Olga; Ryshina-Pankova, Marianna
2012-01-01
Adopting a functional perspective that views grammar as a rich resource for making contextualized meanings in a culture- and language-specific way, the article reconsiders the role of explicit grammar instruction in developing communicative abilities of second language learners. It draws on two distinct but complementary research frameworks,…
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…
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…
Interpretation-Based Grammar Teaching.
ERIC Educational Resources Information Center
Ellis, Rod
1993-01-01
In contrast to the usual approach to teaching grammar, this article argues for a comprehension-based approach. Based on a model of second-language acquisition, it examines a number of possible goals for grammar instruction (e.g., to promote "intake" of new grammatical features by helping learners notice input features and comprehend the meaning).…
Interpretation Tasks for Grammar Teaching.
ERIC Educational Resources Information Center
Ellis, Rod
1995-01-01
The traditional approach to grammar teaching provides learners with opportunities to produce specific grammatical structures. This article explores an alternative approach, one based on interpreting input. The rationale for the approach is discussed, as are the principles for designing interpretation tasks for grammar teaching. (Contains 35…
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…
Ghanbari, Yasser; Smith, Alex R; Schultz, Robert T; Verma, Ragini
2014-12-01
Diffusion tensor imaging (DTI) offers rich insights into the physical characteristics of white matter (WM) fiber tracts and their development in the brain, facilitating a network representation of brain's traffic pathways. Such a network representation of brain connectivity has provided a novel means of investigating brain changes arising from pathology, development or aging. The high dimensionality of these connectivity networks necessitates the development of methods that identify the connectivity building blocks or sub-network components that characterize the underlying variation in the population. In addition, the projection of the subject networks into the basis set provides a low dimensional representation of it, that teases apart different sources of variation in the sample, facilitating variation-specific statistical analysis. We propose a unified framework of non-negative matrix factorization and graph embedding for learning sub-network patterns of connectivity by their projective non-negative decomposition into a reconstructive basis set, as well as, additional basis sets representing variational sources in the population like age and pathology. The proposed framework is applied to a study of diffusion-based connectivity in subjects with autism that shows localized sparse sub-networks which mostly capture the changes related to pathology and developmental variations. PMID:25037933
Graph Coarsening for Path Finding in Cybersecurity Graphs
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 of being used by adversaries.
Technology Helps Students Learn Grammar.
ERIC Educational Resources Information Center
Bowen, Candace Perkins
1999-01-01
Describes several recent approaches on college campuses that use technology (including both Web sites and CD-ROM virtual environments) to help journalism students learn grammar. Notes successes and problems. (SR)
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)
ERIC Educational Resources Information Center
Connery, Keely Flynn
2007-01-01
Graphing predictions is especially important in classes where relationships between variables need to be explored and derived. In this article, the author describes how his students sketch the graphs of their predictions before they begin their investigations on two laboratory activities: Distance Versus Time Cart Race Lab and Resistance; and…
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…
Teaching Grammar as a Liberating Force
ERIC Educational Resources Information Center
Cullen, Richard
2008-01-01
The idea of grammar as a "liberating force" comes from a paper by Henry Widdowson (1990) in which grammar is depicted as a resource which liberates the language user from an over-dependency on lexis and context for the expression of meaning. In this paper, I consider the implications for second language teaching of the notion of grammar as a…
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…
Drama Grammar: Towards a Performative Postmethod Pedagogy
ERIC Educational Resources Information Center
Even, Susanne
2011-01-01
This article presents the original concept of drama grammar, the synthesis of grammar instruction and drama pedagogy, which integrates both structural and communicative paradigms through a dialectic combination of acting and linguistic analysis. Based on the principles of drama pedagogy, drama grammar makes use of techniques from the performing…
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 THE TESTER AND…
Treacherous Allies: Foreign Language Grammar Checkers.
ERIC Educational Resources Information Center
Jacobs, Gabriel; Rodgers, Catherine
1999-01-01
Discusses the use of a French computerized grammar checker as a learning and teaching resource. Presents the results of a controlled series of experiments in which groups of students were given the task of correcting French texts containing grammatical, lexical, and orthographical errors using an on-screen grammar checker or grammar books and…
Continuous-time quantum walks on star graphs
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.
Teachers' Theories in Grammar Teaching.
ERIC Educational Resources Information Center
Borg, Simon
1999-01-01
Considers how research into researchers' theories in English language teaching (ELT) can enhance our understanding of instruction and provide the basis of effective teacher-development work. The nature of teachers' theories is illustrated with examples from classroom research on grammar teaching. Discusses a study conducted with five…
Micmac Teaching Grammar. Preliminary Version.
ERIC Educational Resources Information Center
Delisle, Gilles L.; Metallic, Manny L.
This teaching grammar is designed primarily for university-level students, but may also be used for adult courses, high school classes, and in junior colleges. The text takes the transformational-generative approach to language, in which the notions of system, derivation, and relation are emphasized rather than categorization and classification.…
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…
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…
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…
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…
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…
Prosody and Grammar in Kabardian
ERIC Educational Resources Information Center
Applebaum, Ayla Ayda Bozkurt
2013-01-01
This study provides a systematic phonetic analysis of the basic entities of Kabardian prosodic units above the word and investigates the predictability of prosodic units from grammatical and discourse factors. This dissertation is the first extensive description of Kabardian prosody and grammar based on natural data. This study proposes that…
Complex Grammar in Williams Syndrome
ERIC Educational Resources Information Center
Perovic, Alexandra; Wexler, Ken
2007-01-01
This study investigated knowledge of binding and raising in two groups of children with Williams syndrome (WS), 6-12 and 12-16-years-old, compared to typically developing (TD) controls matched on non-verbal MA, verbal MA, and grammar. In typical development, difficulties interpreting pronouns, but not reflexives, persist until the age of around 6,…
Learnable Classes of Categorial Grammars.
ERIC Educational Resources Information Center
Kanazawa, Makoto
Learnability theory is an attempt to illuminate the concept of learnability using a mathematical model of learning. Two models of learning of categorial grammars are examined here: the standard model, in which sentences presented to the learner are flat strings of words, and one in which sentences are presented in the form of functor-argument…
An analysis of spectral transformation techniques on graphs
NASA Astrophysics Data System (ADS)
Djurović, Igor; Sejdić, Ervin; Bulatović, Nikola; Simeunović, Marko
2015-05-01
Emerging methods for the spectral analysis of graphs are analyzed in this paper, as graphs are currently used to study interactions in many fields from neuroscience to social networks. There are two main approaches related to the spectral transformation of graphs. The first approach is based on the Laplacian matrix. The graph Fourier transform is defined as an expansion of a graph signal in terms of eigenfunctions of the graph Laplacian. The calculated eigenvalues carry the notion of frequency of graph signals. The second approach is based on the graph weighted adjacency matrix, as it expands the graph signal into a basis of eigenvectors of the adjacency matrix instead of the graph Laplacian. Here, the notion of frequency is then obtained from the eigenvalues of the adjacency matrix or its Jordan decomposition. In this paper, advantages and drawbacks of both approaches are examined. Potential challenges and improvements to graph spectral processing methods are considered as well as the generalization of graph processing techniques in the spectral domain. Its generalization to the time-frequency domain and other potential extensions of classical signal processing concepts to graph datasets are also considered. Lastly, it is given an overview of the compressive sensing on graphs concepts.
NASA Astrophysics Data System (ADS)
Beeken, Paul
2014-11-01
Graphing is an essential skill that forms the foundation of any physical science.1 Understanding the relationships between measurements ultimately determines which modeling equations are successful in predicting observations.2 Over the years, science and math teachers have approached teaching this skill with a variety of techniques. For secondary school instruction, the job of graphing skills falls heavily on physics teachers. By virtue of the nature of the topics we cover, it is our mission to develop this skill to the fine art that it is.
Grammar on the Information Superhighway: Proceed with Caution.
ERIC Educational Resources Information Center
Perrin, Robert
2003-01-01
Describes six categories of websites on grammar. Considers the advantages and disadvantages that Internet grammar provides. Presents an annotated list of 15 web sites on grammar. Suggests adopting a positive but cautious approach to grammar on the Internet. Concludes that grammar on the Internet is a potentially helpful resource to use in addition…
Grammar Teaching Revisited: EFL Teachers between Grammar Abstinence and Formal Grammar Teaching
ERIC Educational Resources Information Center
Nazari, Ahmad; Allahyar, Negah
2012-01-01
The study of English language teachers' cognitions and its relationship to teachers' classroom practices have recently been the focus of language teaching and teacher education (Borg, 2006 & 2010). However, rarely have the studies delved into teachers' knowledge about grammar (reviewed by Borg, 2001) or investigated the relationships between…
ERIC Educational Resources Information Center
Beeken, Paul
2014-01-01
Graphing is an essential skill that forms the foundation of any physical science. Understanding the relationships between measurements ultimately determines which modeling equations are successful in predicting observations. Over the years, science and math teachers have approached teaching this skill with a variety of techniques. For secondary…
Inferring Pedigree Graphs from Genetic Distances
NASA Astrophysics Data System (ADS)
Tamura, Takeyuki; Ito, Hiro
In this paper, we study a problem of inferring blood relationships which satisfy a given matrix of genetic distances between all pairs of n nodes. Blood relationships are represented by our proposed graph class, which is called a pedigree graph. A pedigree graph is a directed acyclic graph in which the maximum indegree is at most two. We show that the number of pedigree graphs which satisfy the condition of given genetic distances may be exponential, but they can be represented by one directed acyclic graph with n nodes. Moreover, an O(n3) time algorithm which solves the problem is also given. Although phylogenetic trees and phylogenetic networks are similar data structures to pedigree graphs, it seems that inferring methods for phylogenetic trees and networks cannot be applied to infer pedigree graphs since nodes of phylogenetic trees and networks represent species whereas nodes of pedigree graphs represent individuals. We also show an O(n2) time algorithm which detects a contradiction between a given pedigreee graph and distance matrix of genetic distances.
Kent Sakoda Discusses Pidgin Grammar
ERIC Educational Resources Information Center
Sakoda, Kent; Tamura, Eileen H.
2008-01-01
For a number of years, Kent Sakoda has been teaching at the University of Hawai'i at Manoa in the Department of Second Language Studies. His course, "Pidgin and Creole English in Hawai'i," is popular among students on campus. He has also taught at Hawai'i Pacific University. Because of his expertise on the grammar of Pidgin (Hawai'i Creole),…
The minimalist grammar of action
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
Product Grammars for Alignment and Folding.
Höner Zu Siederdissen, Christian; Hofacker, Ivo L; Stadler, Peter F
2015-01-01
We develop a theory of algebraic operations over linear and context-free grammars that makes it possible to combine simple "atomic" grammars operating on single sequences into complex, multi-dimensional grammars. We demonstrate the utility of this framework by constructing the search spaces of complex alignment problems on multiple input sequences explicitly as algebraic expressions of very simple one-dimensional grammars. In particular, we provide a fully worked frameshift-aware, semiglobal DNA-protein alignment algorithm whose grammar is composed of products of small, atomic grammars. The compiler accompanying our theory makes it easy to experiment with the combination of multiple grammars and different operations. Composite grammars can be written out in L(A)T(E)X for documentation and as a guide to implementation of dynamic programming algorithms. An embedding in Haskell as a domain-specific language makes the theory directly accessible to writing and using grammar products without the detour of an external compiler. Software and supplemental files available here: http://www.bioinf. uni-leipzig.de/Software/gramprod/. PMID:26357262
Generalized graph states based on Hadamard matrices
Cui, Shawn X.; Yu, Nengkun; Zeng, Bei
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 the 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.
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…
Deterministic dense coding and faithful teleportation with multipartite graph states
Huang, C.-Y.; Yu, I-C.; Lin, F.-L.; Hsu, L.-Y.
2009-05-15
We propose schemes to perform the deterministic dense coding and faithful teleportation with multipartite graph states. We also find the sufficient and necessary condition of a viable graph state for the proposed schemes. That is, for the associated graph, the reduced adjacency matrix of the Tanner-type subgraph between senders and receivers should be invertible.
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.
Pattern vectors from algebraic graph theory.
Wilson, Richard C; Hancock, Edwin R; Luo, Bin
2005-07-01
Graph structures have proven computationally cumbersome for pattern analysis. The reason for this is that, before graphs can be converted to pattern vectors, correspondences must be established between the nodes of structures which are potentially of different size. To overcome this problem, in this paper, we turn to the spectral decomposition of the Laplacian matrix. We show how the elements of the spectral matrix for the Laplacian can be used to construct symmetric polynomials that are permutation invariants. The coefficients of these polynomials can be used as graph features which can be encoded in a vectorial manner. We extend this representation to graphs in which there are unary attributes on the nodes and binary attributes on the edges by using the spectral decomposition of a Hermitian property matrix that can be viewed as a complex analogue of the Laplacian. To embed the graphs in a pattern space, we explore whether the vectors of invariants can be embedded in a low-dimensional space using a number of alternative strategies, including principal components analysis (PCA), multidimensional scaling (MDS), and locality preserving projection (LPP). Experimentally, we demonstrate that the embeddings result in well-defined graph clusters. Our experiments with the spectral representation involve both synthetic and real-world data. The experiments with synthetic data demonstrate that the distances between spectral feature vectors can be used to discriminate between graphs on the basis of their structure. The real-world experiments show that the method can be used to locate clusters of graphs. PMID:16013758
Tight Lower Bound for Percolation Threshold on an Infinite Graph
NASA Astrophysics Data System (ADS)
Hamilton, Kathleen E.; Pryadko, Leonid P.
2014-11-01
We construct a tight lower bound for the site percolation threshold on an infinite graph, which becomes exact for an infinite tree. The bound is given by the inverse of the maximal eigenvalue of the Hashimoto matrix used to count nonbacktracking walks on the original graph. Our bound always exceeds the inverse spectral radius of the graph's adjacency matrix, and it is also generally tighter than the existing bound in terms of the maximum degree. We give a constructive proof for existence of such an eigenvalue in the case of a connected infinite quasitransitive graph, a graph-theoretic analog of a translationally invariant system.
Grammar and Usage: History and Myth
ERIC Educational Resources Information Center
Watson, Ken
2010-01-01
The paper first traces the history of thinking about language from the Greek writers of the fifth century BC to the development of the first Greek grammar in about 100 BC. Since the glories of Ancient Greek literature predate the development of grammar, there is every reason to doubt the received wisdom that one must have an explicit knowledge of…
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 learning in which…
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…
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…
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).…
Towards a Pedagogy of Grammar Instruction
ERIC Educational Resources Information Center
Richards, Jack C.; Reppen, Randi
2014-01-01
Grammar can be viewed both as knowledge and as ability. When viewed as knowledge, the focus is on rules for sentence formation. When viewed as ability, the focus is on how grammar is used as a resource in the creation of spoken and written texts. Twelve principles are proposed as the basis for a pedagogy that focusses on acquiring learning to use…
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…
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.…
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,…
TRANSFORMATIONAL GRAMMAR--A GUIDE FOR TEACHERS.
ERIC Educational Resources Information Center
AURBACH, JOSEPH; AND OTHERS
THE AUTHORS HAVE DESIGNED THIS GUIDE FOR NON-LINGUISTICALLY ORIENTED ENGLISH AND LANGUAGE ARTS TEACHERS WHO ARE FACED WITH THE PROBLEM OF TEACHING "THE NEW GRAMMAR." THE INTRODUCTION PRESENTS A RATIONALE FOR THE TEACHING OF LINGUISTICS IN THE CLASSROOM--"THE NEW GRAMMARS, INTELLIGENTLY APPLIED, MAY HELP CHILDREN NOT ONLY UNDERSTAND THE SYNTAX OF…
Studies in French Grammar and Phonology.
ERIC Educational Resources Information Center
Benguerel, Andre-Pierre; Grundstrom, Allan W.
The monograph contains two papers. The first presents a generative grammar for verbal forms in French. It consists of an ordered set of rewrite rules and a set of tables. It generates all existing verbal forms without generating any non-existing ones. The departure from an ordinary generative grammar lies in the use of a tabular form for…
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…
Studying Grammar in the Technological Age
ERIC Educational Resources Information Center
Ediger, Marlow
2012-01-01
When being a student in grade school as well as in high school (1934-1946), grammar was heavily emphasized in English/language arts classes, particularly in grades four through the senior year in high school. Evidently, teachers and school administrators then saw a theoretical way to assist pupils in writing achievement. Grammar and writing were…
Metamodel-Driven Evolution with Grammar Inference
NASA Astrophysics Data System (ADS)
Bryant, Barrett R.; Liu, Qichao; Mernik, Marjan
2010-10-01
Domain-specific modeling (DSM) has become one of the most popular techniques for incorporating model-driven engineering (MDE) into software engineering. In DSM, domain experts define metamodels to describe the essential problems in a domain. A model conforms to a schema definition represented by a metamodel in a similar manner to a programming language conforms to a grammar. Metamodel-driven evolution is when a metamodel undergoes evolutions to incorporate new concerns in the domain. However, this results in losing the ability to use existing model instances. Grammar inference is the problem of inferring a grammar from sample strings which the grammar should generate. This paper describes our work in solving the problem of metamodel-driven evolution with grammar inference, by inferring the metamodel from model instances.
Dynamic graph system for a semantic database
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.
Dynamic graph system for a semantic database
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.
Synchronizability of random rectangular graphs
Estrada, Ernesto 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.
College Handbooks and Early Practical Grammars: A Question of Genre.
ERIC Educational Resources Information Center
Sklar, Elizabeth S.
An examination of the history of the practical grammar, of which the college handbook is the modern reflex, reveals why the grammar handbook is so stubbornly resistant to changes in linguistic theory, usage, or ideology. First, codifying English grammar and producing texts for teaching English grammar to school children during the eighteenth…
Grammar and Its Teaching: Challenging the Myths. ERIC Digest.
ERIC Educational Resources Information Center
Larsen-Freeman, Diane
This digest considers the misconception that grammar is a collection of arbitrary rules about static structures in a language by challenging 10 common myths about grammar and its teaching. The myths include the following: (1) grammar is acquired naturally; it need not be taught; (2) grammar is a collection of meaningless forms; (3) grammar…
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)
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)
An Analysis of Spoken Grammar: The Case for Production
ERIC Educational Resources Information Center
Mumford, Simon
2009-01-01
Corpus-based grammars, notably "Cambridge Grammar of English," give explicit information on the forms and use of native-speaker grammar, including spoken grammar. Native-speaker norms as a necessary goal in language teaching are contested by supporters of English as a Lingua Franca (ELF); however, this article argues for the inclusion of selected…
An introduction to chordal graphs and clique trees
Blair, J.R.S.; Peyton, B.W.
1991-12-31
Clique trees and chordal graphs have carved out a niche for themselves in recent work on sparse matrix algorithms, due primarily to research questions associated with advanced computer architectures. This paper is a unified and elementary introduction to the standard characterizations of chordal graphs and clique trees. The pace is leisurely, as detailed proofs of all results are included. We also briefly discuss applications of chordal graphs and clique trees in sparse matrix computations.
An introduction to chordal graphs and clique trees
Blair, J.R.S. . Dept. of Computer Science); Peyton, B.W. )
1991-01-01
Clique trees and chordal graphs have carved out a niche for themselves in recent work on sparse matrix algorithms, due primarily to research questions associated with advanced computer architectures. This paper is a unified and elementary introduction to the standard characterizations of chordal graphs and clique trees. The pace is leisurely, as detailed proofs of all results are included. We also briefly discuss applications of chordal graphs and clique trees in sparse matrix computations.
An introduction to chordal graphs and clique trees
Blair, J.R.S.; Peyton, B.W.
1992-11-01
Clique trees and chordal graphs have carved out a niche for themselves in recent work on sparse matrix algorithms, due primarily to research questions associated with advanced computer architectures. This paper is a unified and elementary introduction to the standard characterizations of chordal graphs and clique trees. The pace is leisurely, as detailed proofs of all results are included. We also briefly discuss applications of chordal graphs and clique trees in sparse matrix computations.
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.
Terminal context in context-sensitive grammars.
NASA Technical Reports Server (NTRS)
Book, R. V.
1972-01-01
Investigation of the conditions whereunder context-sensitive grammars generate context-free languages. The obtained results indicate that, if every noncontext-free rewriting rule of a context-sensitive grammar has as left context a string of terminal symbols and the left context is at least as long as the right context, then the language generated is context-free. Likewise, if every noncontext-free rewriting rule of a context-sensitive grammar has strings of terminal symbols as left and right contexts, then the language generated is also context-free.
Smoly, Ilan; Carmel, Amir; Shemer-Avni, Yonat; Yeger-Lotem, Esti; Ziv-Ukelson, Michal
2016-03-01
Network querying is a powerful approach to mine molecular interaction networks. Most state-of-the-art network querying tools either confine the search to a prespecified topology in the form of some template subnetwork, or do not specify any topological constraints at all. Another approach is grammar-based queries, which are more flexible and expressive as they allow for expressing the topology of the sought pattern according to some grammar-based logic. Previous grammar-based network querying tools were confined to the identification of paths. In this article, we extend the patterns identified by grammar-based query approaches from paths to trees. For this, we adopt a higher order query descriptor in the form of a regular tree grammar (RTG). We introduce a novel problem and propose an algorithm to search a given graph for the k highest scoring subgraphs matching a tree accepted by an RTG. Our algorithm is based on the combination of dynamic programming with color coding, and includes an extension of previous k-best parsing optimization approaches to avoid isomorphic trees in the output. We implement the new algorithm and exemplify its application to mining viral infection patterns within molecular interaction networks. Our code is available online. PMID:26953875
Abstract Expression Grammar Symbolic Regression
NASA Astrophysics Data System (ADS)
Korns, Michael F.
This chapter examines the use of Abstract Expression Grammars to perform the entire Symbolic Regression process without the use of Genetic Programming per se. The techniques explored produce a symbolic regression engine which has absolutely no bloat, which allows total user control of the search space and output formulas, which is faster, and more accurate than the engines produced in our previous papers using Genetic Programming. The genome is an all vector structure with four chromosomes plus additional epigenetic and constraint vectors, allowing total user control of the search space and the final output formulas. A combination of specialized compiler techniques, genetic algorithms, particle swarm, aged layered populations, plus discrete and continuous differential evolution are used to produce an improved symbolic regression sytem. Nine base test cases, from the literature, are used to test the improvement in speed and accuracy. The improved results indicate that these techniques move us a big step closer toward future industrial strength symbolic regression systems.
Cognitive grammar and aphasic discourse.
Manning, Molly; Franklin, Sue
2016-01-01
In cognitive grammar (CG), there is no clear division between language and other cognitive processes; all linguistic form is conceptually meaningful. In this pilot study, a CG approach was applied to investigate whether people with aphasia (PWA) have cognitive linguistic difficulty not predicted from traditional, componential models of aphasia. Narrative samples from 22 PWA (6 fluent, 16 non-fluent) were compared with samples from 10 participants without aphasia. Between-group differences were tested statistically. PWA had significant difficulty with temporal sequencing, suggesting problems that are not uniquely linguistic. For some, these problems were doubly dissociated with naming, used as a general measure of severity, which indicates that cognitive linguistic difficulties are not linked with more widespread brain damage. Further investigation may lead to a richer account of aphasia in line with contemporary linguistics and cognitive science approaches. PMID:26900999
Teaching and Research: Options in Grammar Teaching.
ERIC Educational Resources Information Center
Ellis, Rod
1998-01-01
Reviews research that addresses how grammar can best be taught in terms of four theoretically motivated instructional options: (1) structured input; (2) explicit instruction; (3) production practice; (4) negative feedback. (Author/JL)
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…
ERIC Educational Resources Information Center
Nibbelink, William
1982-01-01
An instructional sequence for teaching graphing that has been extensively field tested in kindergarten through grade six is detailed. The material begins with point graphs, employs a movable y-axis to begin with minimal clutter, and has graphs constructed before reading graphs is required. (MP)
NASA Astrophysics Data System (ADS)
Diot, Emilie; Gavoille, Cyril
In this paper we investigate the structural properties of k-path separable graphs, that are the graphs that can be separated by a set of k shortest paths. We identify several graph families having such path separability, and we show that this property is closed under minor taking. In particular we establish a list of forbidden minors for 1-path separable graphs.
Grammar Alive! A Guide for Teachers.
ERIC Educational Resources Information Center
Haussamen, Brock
Designed to be a resource for the myriad K-12 teachers who wonder what to do about grammar--how to teach it, how to apply it, how to learn what they themselves were never taught---this book offers an informal, hands-on approach to grammar in the classroom. The book presents teachers with ways to negotiate the often conflicting goals of testing,…
Inverse scattering problem for quantum graph vertices
Cheon, Taksu; Turek, Ondrej; Exner, Pavel
2011-06-15
We demonstrate how the inverse scattering problem of a quantum star graph can be solved by means of diagonalization of the Hermitian unitary matrix when the vertex coupling is of the scale-invariant (or Fueloep-Tsutsui) form. This enables the construction of quantum graphs with desired properties in a tailor-made fashion. The procedure is illustrated on the example of quantum vertices with equal transmission probabilities.
Spectral statistics of nearly unidirectional quantum graphs
NASA Astrophysics Data System (ADS)
Akila, Maram; Gutkin, Boris
2015-08-01
The energy levels of a quantum graph with time reversal symmetry and unidirectional classical dynamics are doubly degenerate and obey the spectral statistics of the Gaussian unitary ensemble. These degeneracies, however, are lifted when the unidirectionality is broken in one of the graph’s vertices by a singular perturbation. Based on a random matrix model we derive an analytic expression for the nearest neighbour distribution between energy levels of such systems. As we demonstrate the result agrees excellently with the actual statistics for graphs with a uniform distribution of eigenfunctions. Yet, it exhibits quite substantial deviations for classes of graphs which show strong scarring.
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.
ERIC Educational Resources Information Center
Watson, Annabel Mary
2015-01-01
This paper reports on an investigation of L1 English teachers' conceptual and evaluative beliefs about teaching grammar, one strand of a larger Economic and Social Research Council (ESRC)-funded investigation into the impact of contextualised grammar teaching [RES-062-23-0775]. Thirty-one teachers in English secondary schools were interviewed…
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…
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…
The Tower of Babel and the Teaching of Grammar: Writing Instruction for a New Century.
ERIC Educational Resources Information Center
Martinsen, Amy
2000-01-01
Considers the teaching of grammar and its importance in the writing classroom. Examines what grammar is; why writing instruction has moved away from grammar; differing opinions regarding grammar and writing instruction; and grammar's place in the writing classroom of the new century. Argues that grammar must be applied to students' own writing.…
On the Spectral Gap of a Quantum Graph
NASA Astrophysics Data System (ADS)
Kennedy, James B.; Kurasov, Pavel; Malenová, Gabriela; Mugnolo, Delio
2016-09-01
We consider the problem of finding universal bounds of "isoperimetric" or "isodiametric" type on the spectral gap of the Laplacian on a metric graph with natural boundary conditions at the vertices, in terms of various analytical and combinatorial properties of the graph: its total length, diameter, number of vertices and number of edges. We investigate which combinations of parameters are necessary to obtain non-trivial upper and lower bounds and obtain a number of sharp estimates in terms of these parameters. We also show that, in contrast to the Laplacian matrix on a combinatorial graph, no bound depending only on the diameter is possible. As a special case of our results on metric graphs, we deduce estimates for the normalised Laplacian matrix on combinatorial graphs which, surprisingly, are sometimes sharper than the ones obtained by purely combinatorial methods in the graph theoretical literature.
Pedagogical Grammar. Interlanguage Studies Bulletin, Vol. 1., No. 1.
ERIC Educational Resources Information Center
Smith, Michael Sharwood
Pedagogical grammar is the presentation of grammatical information for teaching purposes. Two important distinctions are relevant here: reference books versus teaching grammars programmed into a course, and generalized versus specialized grammars, (depending on the extent to which they have been designed to meet specific teaching/learning…
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…
Web Exclusive--The Case for Not Teaching Grammar
ERIC Educational Resources Information Center
Zwagerman, Sean
2012-01-01
The value of grammar instruction in improving students' writing has been debated for at least 150 years, and is showing no signs of tiring. But would teaching grammar actually improve writing? In fact, study after study has shown that the study of grammar does not translate to improved student writing. Indeed, the basic skills of writing are not…
Playful Explicitness with Grammar: A Pedagogy for Writing
ERIC Educational Resources Information Center
Myhill, Debra; Jones, Susan; Watson, Annabel; Lines, Helen
2013-01-01
The place of grammar within the teaching of writing has long been contested and successive research studies have indicated no correlation between grammar teaching and writing attainment. However, a recent study has shown a significant positive impact on writing outcomes when the grammar input is intrinsically linked to the demands of the writing…
Errors in the Research into the Effectiveness of Grammar Teaching.
ERIC Educational Resources Information Center
Tomlinson, David
1994-01-01
Asks whether the sustained instruction in the "basics" of English, especially grammar, is being unrightfully ignored. Challenges teachers who claim that instruction in grammar is unneeded or ill-advised. Counters such assertions by examining two research studies purportedly proving the ineffectiveness of teaching grammar. (HB)
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…
Difficulties in Teaching and Learning Grammar in an EFL Context
ERIC Educational Resources Information Center
Al-Mekhlafi, Abdu Mohammed; Nagaratnam, Ramani Perur
2011-01-01
The role of grammar instruction in an ESL/EFL context has been for decades a major issue for students and teachers alike. Researchers have debated whether grammar should be taught in the classroom and students, for their part, have generally looked upon grammar instruction as a necessary evil at best, and an avoidable burden at worst. The paper…
THE "NEW" GRAMMAR, A SHORT INTRODUCTION FOR SCHOOL ADMINISTRATORS.
ERIC Educational Resources Information Center
MARSH, MARILYN
ANY GRAMMAR IS THE SYSTEM OF LANGUAGE STRUCTURES USED BY A GROUP OF PEOPLE TO CONVEY MEANING. THE "NEW" ENGLISH GRAMMAR IS AN OBJECTIVE DESCRIPTION OF THE STRUCTURES OF OUR LANGUAGE SYSTEM. THE DESCRIPTION IS OBTAINED BY THE STUDY OF THE CHARACTERISTIC SOUNDS, WORD GROUPS, AND WORD FORMS OF SPEECH. THE "NEW" GRAMMAR IS PART OF THE DISCIPLINE OF…
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 programing a…
Grammar Handbook for Home and School. Using Your Language Series.
ERIC Educational Resources Information Center
Smith, Carl B.
Intended as a home resource book for children, this grammar handbook is a quick reference source for questions on grammar and punctuation. The book provides information, as well as sentences to illustrate each definition and guideline, about the most frequently used terms in grammar and punctuation. The book's information is organized…
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 grammar is…
Spoken Grammar and Its Role in the English Language Classroom
ERIC Educational Resources Information Center
Hilliard, Amanda
2014-01-01
This article addresses key issues and considerations for teachers wanting to incorporate spoken grammar activities into their own teaching and also focuses on six common features of spoken grammar, with practical activities and suggestions for teaching them in the language classroom. The hope is that this discussion of spoken grammar and its place…
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…
ERIC Educational Resources Information Center
Beineke, Lowell W.
1989-01-01
Explored are various aspects of drawing graphs on surfaces. The Euler's formula, Kuratowski's theorem and the drawing of graphs in the plane with as few crossings as possible are discussed. Some applications including embedding of graphs and coloring of maps are included. (YP)
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…
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…
NASA Technical Reports Server (NTRS)
Kantak, Anil V.
1987-01-01
Plotter routine for IBM PC (AKPLOT) designed for engineers and scientists who use graphs as integral parts of their documentation. Allows user to generate graph and edit its appearance on cathode-ray tube. Graph may undergo many interactive alterations before finally dumped from screen to be plotted by printer. Written in BASIC.
Bipartite graph partitioning and data clustering
Zha, Hongyuan; He, Xiaofeng; Ding, Chris; Gu, Ming; Simon, Horst D.
2001-05-07
Many data types arising from data mining applications can be modeled as bipartite graphs, examples include terms and documents in a text corpus, customers and purchasing items in market basket analysis and reviewers and movies in a movie recommender system. In this paper, the authors propose a new data clustering method based on partitioning the underlying biopartite graph. The partition is constructed by minimizing a normalized sum of edge weights between unmatched pairs of vertices of the bipartite graph. They show that an approximate solution to the minimization problem can be obtained by computing a partial singular value decomposition (SVD) of the associated edge weight matrix of the bipartite graph. They point out the connection of their clustering algorithm to correspondence analysis used in multivariate analysis. They also briefly discuss the issue of assigning data objects to multiple clusters. In the experimental results, they apply their clustering algorithm to the problem of document clustering to illustrate its effectiveness and efficiency.
Hyperspectral image segmentation using spatial-spectral graphs
NASA Astrophysics Data System (ADS)
Gillis, David B.; Bowles, Jeffrey H.
2012-06-01
Spectral graph theory has proven to be a useful tool in the analysis of high-dimensional data sets. Recall that, mathematically, a graph is a collection of objects (nodes) and connections between them (edges); a weighted graph additionally assigns numerical values (weights) to the edges. Graphs are represented by their adjacency whose elements are the weights between the nodes. Spectral graph theory uses the eigendecomposition of the adjacency matrix (or, more generally, the Laplacian of the graph) to derive information about the underlying graph. In this paper, we develop a spectral method based on the 'normalized cuts' algorithm to segment hyperspectral image data (HSI). In particular, we model an image as a weighted graph whose nodes are the image pixels, and edges defined as connecting spatial neighbors; the edge weights are given by a weighted combination of the spatial and spectral distances between nodes. We then use the Laplacian of the graph to recursively segment the image. The advantages of our approach are that, first, the graph structure naturally incorporates both the spatial and spectral information present in HSI; also, by using only spatial neighbors, the adjacency matrix is highly sparse; as a result, it is possible to apply our technique to much larger images than previous techniques. In the paper, we present the details of our algorithm, and include experimental results from a variety of hyperspectral images.
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.
NASA Astrophysics Data System (ADS)
Aldecoa, Rodrigo; Orsini, Chiara; Krioukov, Dmitri
2015-11-01
Networks representing many complex systems in nature and society share some common structural properties like heterogeneous degree distributions and strong clustering. Recent research on network geometry has shown that those real networks can be adequately modeled as random geometric graphs in hyperbolic spaces. In this paper, we present a computer program to generate such graphs. Besides real-world-like networks, the program can generate random graphs from other well-known graph ensembles, such as the soft configuration model, random geometric graphs on a circle, or Erdős-Rényi random graphs. The simulations show a good match between the expected values of different network structural properties and the corresponding empirical values measured in generated graphs, confirming the accurate behavior of the program.
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…
ERIC Educational Resources Information Center
Lardiere, Donna
2014-01-01
This article offers commentary on the Multiple Grammars (MG) language acquisition theory proposed by Luiz Amaral and Tom Roeper in this issue. It argues that more precise definitions are needed for the terms "rule," "simple," and "productive." Topics discussed include Amaral and Roeper's verb second (V2) rule,…
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…
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…
Standard Albanian. A Reference Grammar for Students.
ERIC Educational Resources Information Center
Newmark, Leonard; And Others
This book is intended as a reference grammar for English-speaking students of present-day Albanian. The introductory chapter provides information on the country and its people, the Albanian language and dialects, phonology, and morphology. The other chapters contain grammatical explanations in English and examples. (AMH)
A Traditionalist Looks at Generative Grammar.
ERIC Educational Resources Information Center
Long, Ralph B.
1964-01-01
Strengths and weaknesses of generative grammar are examined by an apologist for the traditionalists. Criticism is directed toward difficulties encountered by the layman in comprehending texts on linguistic theories, linguists' use of jargon and pet formulas, and unwieldy amounts of terminology constantly being developed. Special attention is…
Mohawk. A Teaching Grammar. Preliminary Version.
ERIC Educational Resources Information Center
Deering, Nora; Harries-Delisle, Helga
This teaching grammar is designed to be used with adult students. Although primarily conceived for classroom use, it could be used by students learning on their own. A section on reading and writing Mohawk precedes the twenty lessons, each of which has basically the same format: (1) conversation, (2) introduction to the systematic variations of…
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…
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…
A Basic Reference Grammar of Slovene.
ERIC Educational Resources Information Center
Derbyshire, William W.
This reference grammar is intended for adult speakers of English who are at the elementary through the intermediate levels of acquisition of the Slovene language. It begins with a brief description of the Slovene language, its major dialects and its place among the Slavic languages. Information on the alphabet, pronunciation, and spelling rules…
Transformational-Generative Grammar and Literacy Education
ERIC Educational Resources Information Center
Kliger, S.
1971-01-01
The distinction between deep and surface levels of language; the intersection of learning theory and cognitive development; and the linguistic competence of the pre-literate child and the illiterate adult are highlighted. Author argues that T-G Grammar will be a powerful aid to recognizing and dealing with problems of mass literacy education.…
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…
BIBLIOGRAPHY AND GLOSSARY FOR CHINESE GRAMMAR.
ERIC Educational Resources Information Center
LIU, LILLIAN; WANG, W. S-Y
THIS BIBLIOGRAPHY LISTS 937 TITLES IN THE FIELD OF CHINESE GRAMMAR FROM AMERICAN AND FOREIGN BOOKS, MAGAZINES, AND JOURNALS. THE AUTHORS AND TITLES ARE LISTED IN PINYIN SYSTEM TRANSCRIPTION WITH A TRANSLATION OF THE TITLE IN ENGLISH AND WITH CHINESE LOGOGRAPHS AFTER THE SOURCE CITATION FOR THOSE ENTRIES ORGINALLY WRITTEN IN CHINESE. ENTRIES ARE…
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…
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…
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…
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 Curricula,…
Probabilistic Grammars for Natural Languages. Psychology Series.
ERIC Educational Resources Information Center
Suppes, Patrick
The purpose of this paper is to define the framework within which empirical investigations of probabilistic grammars can take place and to sketch how this attack can be made. The full presentation of empirical results will be left to other papers. In the detailed empirical work, the author has depended on the collaboration of E. Gammon and A.…
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…
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…
Caught'Ya! Grammar with a Giggle.
ERIC Educational Resources Information Center
Kiester, Jane Bell
Helping students in grades 3 through 11 to master the mechanics of language, this book describes the "Caught'ya" approach to teaching grammar, in which students correct error-filled sentences that form an ongoing humorous plot. The book notes that the sentences are presented 3 to 5 times a week at the start of class and take less than 10 minutes…
A BRIEF HINDI REFERENCE GRAMMAR. PRELIMINARY VERSION.
ERIC Educational Resources Information Center
GUMPERZ, JOHN J.; MISRA, VIDYA NIWAS
THIS BRIEF OUTLINE OF HINDI PHONOLOGY AND GRAMMAR IS INTENDED FOR FIRST AND SECOND YEAR STUDENTS OF HINDI WHO HAVE SOME PREVIOUS KNOWLEDGE OF THE ORAL AND WRITTEN LANGUAGE BUT WHO MAY HAVE HAD NO PREVIOUS TRAINING IN LINGUISTIC TERMINOLOGY. THE AUTHORS HAVE THEREFORE EMPHASIZED SIMPLICITY AND READABILITY RATHER THAN EXHAUSTIVENESS OR ORIGINALITY…
Fusion rule algebras from graph theory
NASA Astrophysics Data System (ADS)
Caselle, M.; Ponzano, G.
1989-06-01
We describe a new class of fusion algebras related to graph theory which bear intriguing connections with group algebras. The structure constants and the matrix S, which diagonalizes the fusion rules, are explicitly computed in terms of SU(2) coupling coefficients.
The Role of Grammar Teaching in Writing in Second Language Acquisition
ERIC Educational Resources Information Center
Lin, Li-Li
2008-01-01
"Grammar is the sound, structure, and meaning system of language. All languages have grammar, and each language has its own grammar" (Beverly, 2007, p.1). People who speak the same language are able to communicate with each other because they all know the grammar system and structure of that language, that is, the meaningful rules of grammar.…
Combined Grammar for the Modeling of Building Interiors
NASA Astrophysics Data System (ADS)
Becker, S.; Peter, M.; Fritsch, D.; Philipp, D.; Baier, P.; Dibak, C.
2013-11-01
As spatial grammars have proven successful and efficient to deliver LOD3 models, the next challenge is their extension to indoor applications, leading to LOD4 models. Therefore, a combined indoor grammar for the automatic generation of indoor models from erroneous and incomplete observation data is presented. In building interiors where inaccurate observation data is available, the grammar can be used to make the reconstruction process robust, and verify the reconstructed geometries. In unobserved building interiors, the grammar can generate hypotheses about possible indoor geometries matching the style of the rest of the building. The grammar combines concepts from L-systems and split grammars. It is designed in such way that it can be derived from observation data fully automatically. Thus, manual predefinitions of the grammar rules usually required to tune the grammar to a specific building style, become obsolete. The potential benefit of using our grammar as support for indoor modeling is evaluated based on an example where the grammar has been applied to automatically generate an indoor model from erroneous and incomplete traces gathered by foot-mounted MEMS/IMU positioning systems.
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.
Lothian, Josh; Powers, Sarah S; Sullivan, Blair D; Baker, Matthew B; Schrock, Jonathan; Poole, Stephen W
2013-12-01
The benchmarking effort within the Extreme Scale Systems Center at Oak Ridge National Laboratory seeks to provide High Performance Computing benchmarks and test suites of interest to the DoD sponsor. The work described in this report is a part of the effort focusing on graph generation. A previously developed benchmark, SystemBurn, allowed the emulation of dierent application behavior profiles within a single framework. To complement this effort, similar capabilities are desired for graph-centric problems. This report examines existing synthetic graph generator implementations in preparation for further study on the properties of their generated synthetic graphs.
Energy Science and Technology Software Center (ESTSC)
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. Itmore » is also useful to characterize how interconnect performance changes with different settings or how one interconnect type compares to another.« less
Mulet, R; Pagnani, A; Weigt, M; Zecchina, R
2002-12-23
We study the graph coloring problem over random graphs of finite average connectivity c. Given a number q of available colors, we find that graphs with low connectivity admit almost always a proper coloring, whereas graphs with high connectivity are uncolorable. Depending on q, we find the precise value of the critical average connectivity c(q). Moreover, we show that below c(q) there exists a clustering phase c in [c(d),c(q)] in which ground states spontaneously divide into an exponential number of clusters and where the proliferation of metastable states is responsible for the onset of complexity in local search algorithms. PMID:12484862
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.
Robust Spectral Clustering Using Statistical Sub-Graph Affinity Model
Eichel, Justin A.; Wong, Alexander; Fieguth, Paul; Clausi, David A.
2013-01-01
Spectral clustering methods have been shown to be effective for image segmentation. Unfortunately, the presence of image noise as well as textural characteristics can have a significant negative effect on the segmentation performance. To accommodate for image noise and textural characteristics, this study introduces the concept of sub-graph affinity, where each node in the primary graph is modeled as a sub-graph characterizing the neighborhood surrounding the node. The statistical sub-graph affinity matrix is then constructed based on the statistical relationships between sub-graphs of connected nodes in the primary graph, thus counteracting the uncertainty associated with the image noise and textural characteristics by utilizing more information than traditional spectral clustering methods. Experiments using both synthetic and natural images under various levels of noise contamination demonstrate that the proposed approach can achieve improved segmentation performance when compared to existing spectral clustering methods. PMID:24386111
xREI: a phylo-grammar visualization webserver.
Barquist, Lars; Holmes, Ian
2008-07-01
Phylo-grammars, probabilistic models combining Markov chain substitution models with stochastic grammars, are powerful models for annotating structured features in multiple sequence alignments and analyzing the evolution of those features. In the past, these methods have been cumbersome to implement and modify. xrate provides means for the rapid development of phylo-grammars (using a simple file format) and automated parameterization of those grammars from training data (via the Expectation Maximization algorithm). xREI (pron. 'X-ray') is an intuitive, flexible AJAX (Asynchronous Javascript And XML) web interface to xrate providing grammar visualization tools as well as access to xrate's training and annotation functionality. It is hoped that this application will serve as a valuable tool to those developing phylo-grammars, and as a means for the exploration and dissemination of such models. xREI is available at http://harmony.biowiki.org/xrei/ PMID:18522975
ERIC Educational Resources Information Center
De Jong, Marvin L.
1993-01-01
Describes the powerful graphing ability of computer algebra systems (CAS) to create three-dimensional graphs or surface graphics of electric potentials. Provides equations along with examples of the printouts. Lists the programs Mathematica, Maple, Derive, Theorist, MathCad, and MATLAB as promising CAS systems. (MVL)
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…
ERIC Educational Resources Information Center
Doto, Julianne; Golbeck, Susan
2007-01-01
Collecting data and analyzing the results of experiments is difficult for children. The authors found a surprising way to help their third graders make graphs and draw conclusions from their data: digital photographs. The pictures bridged the gap between an abstract graph and the plants it represented. With the support of the photos, students…
ERIC Educational Resources Information Center
Petrosino, Anthony
2012-01-01
This article responds to arguments by Skidmore and Thompson (this issue of "Educational Researcher") that a graph published more than 10 years ago was erroneously reproduced and "gratuitously damaged" perceptions of the quality of education research. After describing the purpose of the original graph, the author counters assertions that the graph…
ERIC Educational Resources Information Center
Lind, Joy; Narayan, Darren
2009-01-01
We present the topic of graph connectivity along with a famous theorem of Menger in the real-world setting of the national computer network infrastructure of "National LambdaRail". We include a set of exercises where students reinforce their understanding of graph connectivity by analysing the "National LambdaRail" network. Finally, we give…
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…
ERIC Educational Resources Information Center
Hirsch, Christian R.
1975-01-01
Using a set of worksheets, students will discover and apply Euler's formula regarding connected planar graphs and play and analyze the game of Sprouts. One sheet leads to the discovery of Euler's formula; another concerns traversability of a graph; another gives an example and a game involving these ideas. (Author/KM)
ERIC Educational Resources Information Center
Shaw, Jean M.
1984-01-01
Reasons for having students make graphs are noted. Then specific graphing topics and materials appropriate for young learners are presented, including life-sized, floor, clothespin, felt-face, block, and magnetic graphs, and polls of pupils. (MNS)
Astronomy at Torquay Boys' Grammar School
NASA Astrophysics Data System (ADS)
Reid, David; Lintott, Chris
1996-10-01
TBGS Observatory is owned and run by Torquay Boys' Grammar School in South Devon. The school itself encompasses a wide curriculum from sports to academic studies, ranging from the arts to humanities and science. Due to a high interest from pupils and staff the school has a special focus upon Astronomy. Resulting from this TBGS owns one of the largest, best equipped school observatories in the UK. It is now a minor centre for research and studies at GCSE and higher levels.
Evolutionary stability on graphs
Ohtsuki, Hisashi; Nowak, Martin A.
2008-01-01
Evolutionary stability is a fundamental concept in evolutionary game theory. A strategy is called an evolutionarily stable strategy (ESS), if its monomorphic population rejects the invasion of any other mutant strategy. Recent studies have revealed that population structure can considerably affect evolutionary dynamics. Here we derive the conditions of evolutionary stability for games on graphs. We obtain analytical conditions for regular graphs of degree k > 2. Those theoretical predictions are compared with computer simulations for random regular graphs and for lattices. We study three different update rules: birth-death (BD), death-birth (DB), and imitation (IM) updating. Evolutionary stability on sparse graphs does not imply evolutionary stability in a well-mixed population, nor vice versa. We provide a geometrical interpretation of the ESS condition on graphs. PMID:18295801
The Effect of Using Graphing Calculators in Complex Function Graphs
ERIC Educational Resources Information Center
Ocak, Mehmet Akif
2008-01-01
This study investigates the role of graphing calculators in multiple representations for knowledge transfer and the omission of oversimplification in complex function graphs. The main aim is to examine whether graphing calculators were used efficiently to see different cases and multiple perspectives among complex function graphs, or whether…
ERIC Educational Resources Information Center
Plaza-Pust, Carolina
2008-01-01
Research over the last decades has shown that language development in its multiple forms is characterized by a succession of stable and unstable states. However, the variation observed is neither expected nor can it be accounted for on the basis of traditional learning concepts conceived of within the Universal Grammar (UG) paradigm. In this…
Grammar Works! 15 Reproducible Skills Lessons That Teach Essential Grammar Rules.
ERIC Educational Resources Information Center
Halverson, Jim
Drawing on a program used successfully in the classroom for 20 years, this book presents 15 reproducible skills lessons that teach students in grades 4 through 8 essential grammar rules in an engaging, meaningful way. The book uses games, puzzles, mazes, and model sentences that tell amusing stories while teaching rules. Units in the book cover…
The Multiple Grammars Theory and the Nature of L2 Grammars
ERIC Educational Resources Information Center
Liceras, Juana M.
2014-01-01
This article offers the author's commentary on the Multiple Grammar (MG) language acquisition theory proposed by Luiz Amaral and Tom Roeper in the present issue and touches on other second language acquisition research. Topics discussed include the concept of second language (L2) optionality, a hypothesis regarding the acquisition of the…
ERIC Educational Resources Information Center
Fotos, Sandra S.
1994-01-01
A study of three grammar consciousness-raising tasks dealing with word order among Japanese university students showed that the tasks successfully promoted both proficiency gains and second-language negotiated interaction in participants. Negotiation quantity was determined by the combination of task features present rather than the nature of the…
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…
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…
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…
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…
The Effects of Using Online Concordancers on Teaching Grammar
ERIC Educational Resources Information Center
Türkmen, Yasemin; Aydin, Selami
2016-01-01
Studies conducted so far have mainly focused on the effects of online concordancers on teaching vocabulary, while there is a lack of research focusing on the effects of online concordancers on teaching and learning grammar. Thus, this study aims to review the studies on the effects of online concordancers on teaching and learning grammar and how…
The Role of Grammar Knowledge for Identifying Language Needs
ERIC Educational Resources Information Center
Rowley, Anne Toolan
2010-01-01
The focus of the study was an interest in discerning the relationship between grammar knowledge and its application for evaluating grammar development at different academic and professional stages. A 3-part questionnaire was completed by first and last semester Communication Sciences and Disorders (CSD) graduate students, and practicing…
Sparing the Rod: What Teachers Need to Know about Grammar.
ERIC Educational Resources Information Center
Cameron, Deborah
1997-01-01
Opines that what teachers need to know about grammar is how to teach it without resorting either literally or figuratively to the "cane and the birch rod." Finds that teachers need to look again at the "what" and the "why": what grammar is and why it is taught. Also considers answers given by others. (PA)
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…
A Self-Directed Approach to English Grammar.
ERIC Educational Resources Information Center
ALBUS--Adult Literacy and Basic Skills Unit, 1991
1991-01-01
The place of formal grammar teaching is of secondary importance to developing a personally relevant context for students to practice the language and explore their personal experience. Grammar is essential for mastery of a language. However, the few materials available are not user friendly. Therefore, British tutors developed a bank of resources…
Investigating Effects of Computer-Based Grammar Tutorials
ERIC Educational Resources Information Center
Kolesnikova, Anna
2011-01-01
This dissertation study examined a broad question of whether computer-based grammar tutorials are effective and welcome tools to review grammar for language learners by investigating effects of three different modes of such tutorials on learners' knowledge and satisfaction. For this study, I developed experimental tutorials in three different…
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…
The Effectiveness of Incidental Teaching of Grammar to Iranian Students
ERIC Educational Resources Information Center
Ghabanchi, Z.
2010-01-01
This article reports the results of a study and a pilot study. The "study" considers the effectiveness of incidental teaching of grammar in a learning class of English As A Second Language by Persian speaking students. The "pilot study" examines the students' attitudes toward the incidental learning of grammar from the perspective of field…
Concept-Based Grammar Teaching: An Academic Responds to Azar
ERIC Educational Resources Information Center
Hill, Kent
2007-01-01
This response to Azar (this volume) intends to discuss from an academic's perspective the main points raised in her paper (i.e., grammar-based instruction and its relation to focus on form and error correction) and, to encourage a more concept-based approach to grammar instruction (CBT). A CBT approach to language development argues that the…
The Grammar of Action and Reversal Errors in Children's Printing.
ERIC Educational Resources Information Center
Simner, Marvin L.
1984-01-01
Studies predictions about letter reversals made by Goodnow's "grammar of action." Two samples of right- and left-handed children in nursery school through first grade printed from memory immediately after exposure to each of 41 reversible letters and numbers. Results challenge "grammar of action" proposals about the inappropriate applications of…
Rules of the Game: Grammar through Discovery 1.
ERIC Educational Resources Information Center
Page, Mary; And Others
Designed to encourage students to discover that grammar merely represents the patterns that exist in language, this book presents lessons on 19 grammar points: nouns; pronouns; verbs; subjects; capitalization; end punctuation; commas; sentence fragments; run-on sentences; contractions; possessives; quotation marks; adjectives; adverbs;…
Current Issues in the Teaching of Grammar: An SLA Perspective
ERIC Educational Resources Information Center
Ellis, Rod
2006-01-01
The study of how learners acquire a second language (SLA) has helped to shape thinking about how to teach the grammar of a second language. There remain, however, a number of controversial issues. This paper considers eight key questions relating to grammar pedagogy in the light of findings from SLA. As such, this article complements…
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…
Yemeni Teachers' Beliefs of Grammar Teaching and Classroom Practices
ERIC Educational Resources Information Center
Ezzi, Nemah Abdullah Ayash
2012-01-01
Beliefs of in-service English teachers about grammar learning/teaching and the influence of such beliefs on their classroom practices remain relatively unexplored. More precisely, this study explores English teachers' beliefs about grammar learning and teaching. It throws light on the teachers' actual practices in the classrooms of 7th -12th…
Albanian Basic Course: Workbook for Exercises in Grammar.
ERIC Educational Resources Information Center
Defense Language Inst., Washington, DC.
This workbook in Albanian grammar requires students to fill in missing words following a particular grammatical pattern, selected from Exercises in Grammar used in the "Albanian Basic Course," prepared by the Defense Language Institute. Drills include: (1) interrogative pronouns, (2) demonstrative adjectives; (3) declension of nouns, possessive…
Towards More Context and Discourse in Grammar Instruction
ERIC Educational Resources Information Center
Celce-Murcia, Marianne
2007-01-01
This paper first discusses why the sentence-level drills still being used extensively in the teaching of grammar to second language learners have not been successful. What follows is a presentation of an innovative approach; namely, using context and discourse to present and practice grammar in more authentic and effective ways.
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…
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…
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)
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.
Rashmanlou, Hossein; Samanta, Sovan; Pal, Madhumangal; Borzooei, R A
2016-01-01
The main purpose of this paper is to introduce the notion of vague h-morphism on vague graphs and regular vague graphs. The action of vague h-morphism on vague strong regular graphs are studied. Some elegant results on weak and co weak isomorphism are derived. Also, [Formula: see text]-complement of highly irregular vague graphs are defined. PMID:27536517
A Semantic Graph Query Language
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.
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.
Ohtsuki, Hisashi; Nowak, Martin A.
2008-01-01
Direct reciprocity is a mechanism for the evolution of cooperation based on the idea of repeated encounters between the same two individuals. Here we examine direct reciprocity in structured populations, where individuals occupy the vertices of a graph. The edges denote who interacts with whom. The graph represents spatial structure or a social network. For birth-death or pairwise comparison updating, we find that evolutionary stability of direct reciprocity is more restrictive on a graph than in a well-mixed population, but the condition for reciprocators to be advantageous is less restrictive on a graph. For death-birth and imitation updating, in contrast, both conditions are easier to fulfill on a graph. Moreover, for all four update mechanisms, reciprocators can dominate defectors on a graph, which is never possible in a well-mixed population. We also study the effect of an error rate, which increases with the number of links per individual; interacting with more people simultaneously enhances the probability of making mistakes. We provide analytic derivations for all results. PMID:17466339
Commuting projections on graphs
Vassilevski, Panayot S.; Zikatanov, Ludmil T.
2013-02-19
For a given (connected) graph, we consider vector spaces of (discrete) functions defined on its vertices and its edges. These two spaces are related by a discrete gradient operator, Grad and its adjoint, ₋Div, referred to as (negative) discrete divergence. We also consider a coarse graph obtained by aggregation of vertices of the original one. Then a coarse vertex space is identified with the subspace of piecewise constant functions over the aggregates. We consider the ℓ_{2}-projection Q_{H} onto the space of these piecewise constants. In the present paper, our main result is the construction of a projection π _{H} from the original edge-space onto a properly constructed coarse edge-space associated with the edges of the coarse graph. The projections π _{H} and Q_{H} commute with the discrete divergence operator, i.e., we have div π _{H} = Q_{H} div. The respective pair of coarse edge-space and coarse vertexspace offer the potential to construct two-level, and by recursion, multilevel methods for the mixed formulation of the graph Laplacian which utilizes the discrete divergence operator. The performance of one two-level method with overlapping Schwarz smoothing and correction based on the constructed coarse spaces for solving such mixed graph Laplacian systems is illustrated on a number of graph examples.
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.
[The genetic language: grammar, semantics, evolution].
Ratner, V A
1993-05-01
The genetic language is a collection of rules and regularities of genetic information coding for genetic texts. It is defined by alphabet, grammar, collection of punctuation marks and regulatory sites, semantics. There is a review of these general attributes of genetic language, including also the problems of synonymy and evolution. The main directions of theoretical investigations of genetic language and neighbouring questions are formulated: (1) cryptographic problems, (2) analysis of genetic texts, (3) theoretical-linguistic problems, (4) evolutionary linguistic questions. The problem of genetic language becomes one of the key ones of molecular genetics, molecular biology and gene engineering. PMID:8335231
ERIC Educational Resources Information Center
Jones, Susan; Myhill, Debra; Bailey, Trevor
2013-01-01
The role of grammar instruction in the teaching of writing is contested in most Anglophone countries, with several robust meta-analyses finding no evidence of any beneficial effect. However, existing research is limited in that it only considers isolated grammar instruction and offers no theorisation of an instructional relationship between…
ERIC Educational Resources Information Center
Liu, Dilin
2011-01-01
Despite a long debate and the accompanying call for changes in the past few decades, grammar instruction in college English classes, according to some scholars, has remained largely "disempowering,""decontextualized," and "remedial" (Micciche, 2004, p. 718). To search for more effective and empowering grammar teaching, this study explores the use…
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…
Clique graphs and overlapping communities
NASA Astrophysics Data System (ADS)
Evans, T. S.
2010-12-01
It is shown how to construct a clique graph in which properties of cliques of a fixed order in a given graph are represented by vertices in a weighted graph. Various definitions and motivations for these weights are given. The detection of communities or clusters is used to illustrate how a clique graph may be exploited. In particular a benchmark network is shown where clique graphs find the overlapping communities accurately while vertex partition methods fail.