Indo-European languages tree by Levenshtein distance

Science.gov (United States)

Serva, M.; Petroni, F.

2008-03-01

The evolution of languages closely resembles the evolution of haploid organisms. This similarity has been recently exploited (Gray R. D. and Atkinson Q. D., Nature, 426 (2003) 435; Gray R. D. and Jordan F. M., Nature, 405 (2000) 1052) to construct language trees. The key point is the definition of a distance among all pairs of languages which is the analogous of a genetic distance. Many methods have been proposed to define these distances; one of these, used by glottochronology, computes the distance from the percentage of shared "cognates". Cognates are words inferred to have a common historical origin, and subjective judgment plays a relevant role in the identification process. Here we push closer the analogy with evolutionary biology and we introduce a genetic distance among language pairs by considering a renormalized Levenshtein distance among words with same meaning and averaging on all words contained in a Swadesh list (Swadesh M., Proc. Am. Philos. Soc., 96 (1952) 452). The subjectivity of process is consistently reduced and the reproducibility is highly facilitated. We test our method against the Indo-European group considering fifty different languages and the two hundred words of the Swadesh list for any of them. We find out a tree which closely resembles the one published in Gray and Atkinson (2003), with some significant differences.

Temporally Regular Musical Primes Facilitate Subsequent Syntax Processing in Children with Specific Language Impairment.

Science.gov (United States)

Bedoin, Nathalie; Brisseau, Lucie; Molinier, Pauline; Roch, Didier; Tillmann, Barbara

2016-01-01

Children with developmental language disorders have been shown to be also impaired in rhythm and meter perception. Temporal processing and its link to language processing can be understood within the dynamic attending theory. An external stimulus can stimulate internal oscillators, which orient attention over time and drive speech signal segmentation to provide benefits for syntax processing, which is impaired in various patient populations. For children with Specific Language Impairment (SLI) and dyslexia, previous research has shown the influence of an external rhythmic stimulation on subsequent language processing by comparing the influence of a temporally regular musical prime to that of a temporally irregular prime. Here we tested whether the observed rhythmic stimulation effect is indeed due to a benefit provided by the regular musical prime (rather than a cost subsequent to the temporally irregular prime). Sixteen children with SLI and 16 age-matched controls listened to either a regular musical prime sequence or an environmental sound scene (without temporal regularities in event occurrence; i.e., referred to as "baseline condition") followed by grammatically correct and incorrect sentences. They were required to perform grammaticality judgments for each auditorily presented sentence. Results revealed that performance for the grammaticality judgments was better after the regular prime sequences than after the baseline sequences. Our findings are interpreted in the theoretical framework of the dynamic attending theory (Jones, 1976) and the temporal sampling (oscillatory) framework for developmental language disorders (Goswami, 2011). Furthermore, they encourage the use of rhythmic structures (even in non-verbal materials) to boost linguistic structure processing and outline perspectives for rehabilitation.

Exploiting Lexical Regularities in Designing Natural Language Systems.

Science.gov (United States)

1988-04-01

ELEMENT. PROJECT. TASKN Artificial Inteligence Laboratory A1A4WR NTumet 0) 545 Technology Square Cambridge, MA 02139 Ln *t- CONTROLLING OFFICE NAME AND...RO-RI95 922 EXPLOITING LEXICAL REGULARITIES IN DESIGNING NATURAL 1/1 LANGUAGE SYSTENS(U) MASSACHUSETTS INST OF TECH CAMBRIDGE ARTIFICIAL INTELLIGENCE...oes.ary and ftdou.Ip hr Nl wow" L,2This paper presents the lexical component of the START Question Answering system developed at the MIT Artificial

English Teaching and Learning in Brazilian Regular Schools and Language Schools: A Study on Teachers' Beliefs

Science.gov (United States)

Fragozo, Carina Silva; Monawar, Mônica Deitos Stedile

2012-01-01

This paper aims to diagnose, through a qualitative comparative study, the main differences concerning the teaching of English in Brazilian regular schools when compared to language schools. There has been a growing tendency of students to attend language schools while still having English classes at their regular schools, and this has led to a lot…

A Boyer-Moore (or Watson-Watson) type algorithm for regular tree pattern matching

NARCIS (Netherlands)

Watson, B.W.; Aarts, E.H.L.; Eikelder, ten H.M.M.; Hemerik, C.; Rem, M.

1995-01-01

In this chapter, I outline a new algorithm for regular tree pattern matching. The existence of this algorithm was first mentioned in the statements accompanying my dissertation, [2]. In order to avoid repeating the material in my dissertation, it is assumed that the reader is familiar with Chapters

25 CFR 39.132 - Can a school integrate Language Development programs into its regular instructional program?

Science.gov (United States)

2010-04-01

... 25 Indians 1 2010-04-01 2010-04-01 false Can a school integrate Language Development programs into... Language Development Programs § 39.132 Can a school integrate Language Development programs into its regular instructional program? A school may offer Language Development programs to students as part of its...

Rule-based learning of regular past tense in children with specific language impairment.

Science.gov (United States)

Smith-Lock, Karen M

2015-01-01

The treatment of children with specific language impairment was used as a means to investigate whether a single- or dual-mechanism theory best conceptualizes the acquisition of English past tense. The dual-mechanism theory proposes that regular English past-tense forms are produced via a rule-based process whereas past-tense forms of irregular verbs are stored in the lexicon. Single-mechanism theories propose that both regular and irregular past-tense verbs are stored in the lexicon. Five 5-year-olds with specific language impairment received treatment for regular past tense. The children were tested on regular past-tense production and third-person singular "s" twice before treatment and once after treatment, at eight-week intervals. Treatment consisted of one-hour play-based sessions, once weekly, for eight weeks. Crucially, treatment focused on different lexical items from those in the test. Each child demonstrated significant improvement on the untreated past-tense test items after treatment, but no improvement on the untreated third-person singular "s". Generalization to untreated past-tense verbs could not be attributed to a frequency effect or to phonological similarity of trained and tested items. It is argued that the results are consistent with a dual-mechanism theory of past-tense inflection.

Representing and computing regular languages on massively parallel networks

Energy Technology Data Exchange (ETDEWEB)

Miller, M.I.; O' Sullivan, J.A. (Electronic Systems and Research Lab., of Electrical Engineering, Washington Univ., St. Louis, MO (US)); Boysam, B. (Dept. of Electrical, Computer and Systems Engineering, Rensselaer Polytechnic Inst., Troy, NY (US)); Smith, K.R. (Dept. of Electrical Engineering, Southern Illinois Univ., Edwardsville, IL (US))

1991-01-01

This paper proposes a general method for incorporating rule-based constraints corresponding to regular languages into stochastic inference problems, thereby allowing for a unified representation of stochastic and syntactic pattern constraints. The authors' approach first established the formal connection of rules to Chomsky grammars, and generalizes the original work of Shannon on the encoding of rule-based channel sequences to Markov chains of maximum entropy. This maximum entropy probabilistic view leads to Gibb's representations with potentials which have their number of minima growing at precisely the exponential rate that the language of deterministically constrained sequences grow. These representations are coupled to stochastic diffusion algorithms, which sample the language-constrained sequences by visiting the energy minima according to the underlying Gibbs' probability law. The coupling to stochastic search methods yields the all-important practical result that fully parallel stochastic cellular automata may be derived to generate samples from the rule-based constraint sets. The production rules and neighborhood state structure of the language of sequences directly determines the necessary connection structures of the required parallel computing surface. Representations of this type have been mapped to the DAP-510 massively-parallel processor consisting of 1024 mesh-connected bit-serial processing elements for performing automated segmentation of electron-micrograph images.

Detecting regular sound changes in linguistics as events of concerted evolution.

Science.gov (United States)

Hruschka, Daniel J; Branford, Simon; Smith, Eric D; Wilkins, Jon; Meade, Andrew; Pagel, Mark; Bhattacharya, Tanmoy

2015-01-05

Concerted evolution is normally used to describe parallel changes at different sites in a genome, but it is also observed in languages where a specific phoneme changes to the same other phoneme in many words in the lexicon—a phenomenon known as regular sound change. We develop a general statistical model that can detect concerted changes in aligned sequence data and apply it to study regular sound changes in the Turkic language family. Linguistic evolution, unlike the genetic substitutional process, is dominated by events of concerted evolutionary change. Our model identified more than 70 historical events of regular sound change that occurred throughout the evolution of the Turkic language family, while simultaneously inferring a dated phylogenetic tree. Including regular sound changes yielded an approximately 4-fold improvement in the characterization of linguistic change over a simpler model of sporadic change, improved phylogenetic inference, and returned more reliable and plausible dates for events on the phylogenies. The historical timings of the concerted changes closely follow a Poisson process model, and the sound transition networks derived from our model mirror linguistic expectations. We demonstrate that a model with no prior knowledge of complex concerted or regular changes can nevertheless infer the historical timings and genealogical placements of events of concerted change from the signals left in contemporary data. Our model can be applied wherever discrete elements—such as genes, words, cultural trends, technologies, or morphological traits—can change in parallel within an organism or other evolving group. Copyright © 2015 The Authors. Published by Elsevier Inc. All rights reserved.

Stream Processing Using Grammars and Regular Expressions

DEFF Research Database (Denmark)

Rasmussen, Ulrik Terp

disambiguation. The first algorithm operates in two passes in a semi-streaming fashion, using a constant amount of working memory and an auxiliary tape storage which is written in the first pass and consumed by the second. The second algorithm is a single-pass and optimally streaming algorithm which outputs...... as much of the parse tree as is semantically possible based on the input prefix read so far, and resorts to buffering as many symbols as is required to resolve the next choice. Optimality is obtained by performing a PSPACE-complete pre-analysis on the regular expression. In the second part we present...... Kleenex, a language for expressing high-performance streaming string processing programs as regular grammars with embedded semantic actions, and its compilation to streaming string transducers with worst-case linear-time performance. Its underlying theory is based on transducer decomposition into oracle...

Language Adaptive LVCSR Through Polyphone Decision Tree Specialization

Science.gov (United States)

2000-08-01

crossing rate. After cepstral mean subtraction a linear discriminant analysis 1Mandarin is given in character based error rate, Japanese in hiragana ...data. For this purpose we German GE 9173 71 132K 16.7 introduce a polyphone decision tree specialization method. Several Japanese JA 9096 108 212K...12.1 2. Multiple Languages German 11.8 61K 200 44.5 43 9.0 For our experiments we developed monolingual LVCSR sys- Japanese 10.0 22K 230 33.8 33 7.9

Tree Notation: an antifragile program notation

OpenAIRE

Yunits, Breck

2017-01-01

This paper presents Tree Notation, a new simple, universal syntax. Language designers can invent new programming languages, called Tree Languages, on top of Tree Notation. Tree Languages have a number of advantages over traditional programming languages. We include a Visual Abstract to succinctly display the problem and discovery. Then we describe the problem--the BNF to abstract syntax tree (AST) parse step--and introduce the novel solution we discovered: a new family of 2D programming langu...

Graded effects of regularity in language revealed by N400 indices of morphological priming.

Science.gov (United States)

Kielar, Aneta; Joanisse, Marc F

2010-07-01

Differential electrophysiological effects for regular and irregular linguistic forms have been used to support the theory that grammatical rules are encoded using a dedicated cognitive mechanism. The alternative hypothesis is that language systematicities are encoded probabilistically in a way that does not categorically distinguish rule-like and irregular forms. In the present study, this matter was investigated more closely by focusing specifically on whether the regular-irregular distinction in English past tenses is categorical or graded. We compared the ERP priming effects of regulars (baked-bake), vowel-change irregulars (sang-sing), and "suffixed" irregulars that display a partial regularity (suffixed irregular verbs, e.g., slept-sleep), as well as forms that are related strictly along formal or semantic dimensions. Participants performed a visual lexical decision task with either visual (Experiment 1) or auditory prime (Experiment 2). Stronger N400 priming effects were observed for regular than vowel-change irregular verbs, whereas suffixed irregulars tended to group with regular verbs. Subsequent analyses decomposed early versus late-going N400 priming, and suggested that differences among forms can be attributed to the orthographic similarity of prime and target. Effects of morphological relatedness were observed in the later-going time period, however, we failed to observe true regular-irregular dissociations in either experiment. The results indicate that morphological effects emerge from the interaction of orthographic, phonological, and semantic overlap between words.

Algorithms for Regular Tree Grammar Network Search and Their Application to Mining Human-viral Infection Patterns.

Science.gov (United States)

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.

Modular tree automata

DEFF Research Database (Denmark)

Bahr, Patrick

2012-01-01

Tree automata are traditionally used to study properties of tree languages and tree transformations. In this paper, we consider tree automata as the basis for modular and extensible recursion schemes. We show, using well-known techniques, how to derive from standard tree automata highly modular...

Gibbs Measures Over Locally Tree-Like Graphs and Percolative Entropy Over Infinite Regular Trees

Science.gov (United States)

Austin, Tim; Podder, Moumanti

2018-03-01

Consider a statistical physical model on the d-regular infinite tree Td described by a set of interactions Φ . Let Gn be a sequence of finite graphs with vertex sets V_n that locally converge to Td. From Φ one can construct a sequence of corresponding models on the graphs G_n. Let μ_n be the resulting Gibbs measures. Here we assume that μ n converges to some limiting Gibbs measure μ on Td in the local weak^* sense, and study the consequences of this convergence for the specific entropies |V_n|^{-1}H(μ _n). We show that the limit supremum of |V_n|^{-1}H(μ _n) is bounded above by the percolative entropy H_{it{perc}}(μ ), a function of μ itself, and that |V_n|^{-1}H(μ _n) actually converges to H_{it{perc}}(μ ) in case Φ exhibits strong spatial mixing on T_d. When it is known to exist, the limit of |V_n|^{-1}H(μ _n) is most commonly shown to be given by the Bethe ansatz. Percolative entropy gives a different formula, and we do not know how to connect it to the Bethe ansatz directly. We discuss a few examples of well-known models for which the latter result holds in the high temperature regime.

Regular and context-free nominal traces

DEFF Research Database (Denmark)

Degano, Pierpaolo; Ferrari, Gian-Luigi; Mezzetti, Gianluca

2017-01-01

Two kinds of automata are presented, for recognising new classes of regular and context-free nominal languages. We compare their expressive power with analogous proposals in the literature, showing that they express novel classes of languages. Although many properties of classical languages hold ...

Internal and External Dynamics in Language: Evidence from Verb Regularity in a Historical Corpus of English

Science.gov (United States)

Cuskley, Christine F.; Pugliese, Martina; Castellano, Claudio; Colaiori, Francesca; Loreto, Vittorio; Tria, Francesca

2014-01-01

Human languages are rule governed, but almost invariably these rules have exceptions in the form of irregularities. Since rules in language are efficient and productive, the persistence of irregularity is an anomaly. How does irregularity linger in the face of internal (endogenous) and external (exogenous) pressures to conform to a rule? Here we address this problem by taking a detailed look at simple past tense verbs in the Corpus of Historical American English. The data show that the language is open, with many new verbs entering. At the same time, existing verbs might tend to regularize or irregularize as a consequence of internal dynamics, but overall, the amount of irregularity sustained by the language stays roughly constant over time. Despite continuous vocabulary growth, and presumably, an attendant increase in expressive power, there is no corresponding growth in irregularity. We analyze the set of irregulars, showing they may adhere to a set of minority rules, allowing for increased stability of irregularity over time. These findings contribute to the debate on how language systems become rule governed, and how and why they sustain exceptions to rules, providing insight into the interplay between the emergence and maintenance of rules and exceptions in language. PMID:25084006

Keeping trees as assets

Science.gov (United States)

Kevin T. Smith

2009-01-01

Landscape trees have real value and contribute to making livable communities. Making the most of that value requires providing trees with the proper care and attention. As potentially large and long-lived organisms, trees benefit from commitment to regular care that respects the natural tree system. This system captures, transforms, and uses energy to survive, grow,...

Cladistic analysis of Bantu languages: a new tree based on combined lexical and grammatical data

Science.gov (United States)

Rexová, Kateřina; Bastin, Yvonne; Frynta, Daniel

2006-04-01

The phylogeny of the Bantu languages is reconstructed by application of the cladistic methodology to the combined lexical and grammatical data (87 languages, 144 characters). A maximum parsimony tree and Bayesian analysis supported some previously recognized clades, e.g., that of eastern and southern Bantu languages. Moreover, the results revealed that Bantu languages south and east of the equatorial forest are probably monophyletic. It suggests an unorthodox scenario of Bantu expansion including (after initial radiation in their homelands and neighboring territories) just a single passage through rainforest areas followed by a subsequent divergence into major clades. The likely localization of this divergence is in the area west of the Great Lakes. It conforms to the view that demographic expansion and dispersal throughout the dry-forests and savanna regions of subequatorial Africa was associated with the acquisition of new technologies (iron metallurgy and grain cultivation).

Type extension trees

DEFF Research Database (Denmark)

Jaeger, Manfred

2006-01-01

We introduce type extension trees as a formal representation language for complex combinatorial features of relational data. Based on a very simple syntax this language provides a unified framework for expressing features as diverse as embedded subgraphs on the one hand, and marginal counts...... of attribute values on the other. We show by various examples how many existing relational data mining techniques can be expressed as the problem of constructing a type extension tree and a discriminant function....

The copying power of one-state tree transducers

DEFF Research Database (Denmark)

Engelfriet, Joost; Skyum, Sven

1982-01-01

One-state deterministic top-down tree transducers (or, tree homomorphisms) cannot handle “prime copying,” i.e., their class of output (string) languages is not closed under the operation L → {$(w$)f(n) short parallel w ε L, f(n) greater-or-equal, slanted 1}, where f is any integer function whose...... range contains numbers with arbitrarily large prime factors (such as a polynomial). The exact amount of nonclosure under these copying operations is established for several classes of input (tree) languages. These results are relevant to the extended definable (or, restricted parallel level) languages......, to the syntax-directed translation of context-free languages, and to the tree transducer hierarchy....

Algorithms for optimal dyadic decision trees

Energy Technology Data Exchange (ETDEWEB)

Hush, Don [Los Alamos National Laboratory; Porter, Reid [Los Alamos National Laboratory

2009-01-01

A new algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data sets. This paper enhances and extends this algorithm by: introducing an adaptive grid search for the regularization parameter that guarantees optimal solutions for all relevant trees sizes, revising the core tree-building algorithm so that its run time is substantially smaller for most regularization parameter values on the grid, and incorporating new data structures and data pre-processing steps that provide significant run time enhancement in practice.

FB-Tree: A B+-Tree for Flash-Based SSDs

DEFF Research Database (Denmark)

Jørgensen, Martin V.; Rasmussen, René B.; Saltenis, Simonas

2011-01-01

Due to their many advantages, flash-based SSDs (Solid-State Drives) have become a mainstream alternative to magnetic disks for database servers. Nevertheless, database systems, designed and optimized for magnetic disks, still do not fully exploit all the benefits of the new technology. We propose....... As a consequence, the FB-tree outperforms a regular B+-tree in all scenarios tested. For instance, the throughput of a random workload of 75% updates increases by a factor of three using only two times the space of the B+-tree....

Decision-Tree Program

Science.gov (United States)

Buntine, Wray

1994-01-01

IND computer program introduces Bayesian and Markov/maximum-likelihood (MML) methods and more-sophisticated methods of searching in growing trees. Produces more-accurate class-probability estimates important in applications like diagnosis. Provides range of features and styles with convenience for casual user, fine-tuning for advanced user or for those interested in research. Consists of four basic kinds of routines: data-manipulation, tree-generation, tree-testing, and tree-display. Written in C language.

The DSD Schema Language

DEFF Research Database (Denmark)

Klarlund, Nils; Møller, Anders; Schwartzbach, Michael Ignatieff

2002-01-01

be specified as a set of trees. For example, XHTML is a user domain corresponding to a set of XML documents that make sense as hypertext. A notation for defining such a set of XML trees is called a schema language. We believe that a useful schema notation must identify most of the syntactic requirements......XML (Extensible Markup Language), a linear syntax for trees, has gathered a remarkable amount of interest in industry. The acceptance of XML opens new venues for the application of formal methods such as specification of abstract syntax tree sets and tree transformations. A user domain may...... on tree nodes depend on their context. We also support a general, declarative mechanism for inserting default elements and attributes. Also, we include a simple technique for reusing and evolving DSDs through selective redefinitions. The expressiveness of DSD is comparable to that of the schema language...

Bit-coded regular expression parsing

DEFF Research Database (Denmark)

Nielsen, Lasse; Henglein, Fritz

2011-01-01

the DFA-based parsing algorithm due to Dub ´e and Feeley to emit the bits of the bit representation without explicitly materializing the parse tree itself. We furthermore show that Frisch and Cardelli’s greedy regular expression parsing algorithm can be straightforwardly modified to produce bit codings...

Formal language theory: refining the Chomsky hierarchy

Science.gov (United States)

Jäger, Gerhard; Rogers, James

2012-01-01

The first part of this article gives a brief overview of the four levels of the Chomsky hierarchy, with a special emphasis on context-free and regular languages. It then recapitulates the arguments why neither regular nor context-free grammar is sufficiently expressive to capture all phenomena in the natural language syntax. In the second part, two refinements of the Chomsky hierarchy are reviewed, which are both relevant to the extant research in cognitive science: the mildly context-sensitive languages (which are located between context-free and context-sensitive languages), and the sub-regular hierarchy (which distinguishes several levels of complexity within the class of regular languages). PMID:22688632

Formal language theory: refining the Chomsky hierarchy.

Science.gov (United States)

Jäger, Gerhard; Rogers, James

2012-07-19

The first part of this article gives a brief overview of the four levels of the Chomsky hierarchy, with a special emphasis on context-free and regular languages. It then recapitulates the arguments why neither regular nor context-free grammar is sufficiently expressive to capture all phenomena in the natural language syntax. In the second part, two refinements of the Chomsky hierarchy are reviewed, which are both relevant to the extant research in cognitive science: the mildly context-sensitive languages (which are located between context-free and context-sensitive languages), and the sub-regular hierarchy (which distinguishes several levels of complexity within the class of regular languages).

A Python-based Interface for Wide Coverage Lexicalized Tree-adjoining Grammars

Directory of Open Access Journals (Sweden)

Wang Ziqi

2015-04-01

Full Text Available This paper describes the design and implementation of a Python-based interface for wide coverage Lexicalized Tree-adjoining Grammars. The grammars are part of the XTAG Grammar project at the University of Pennsylvania, which were hand-written and semi-automatically curated to parse real-world corpora. We provide an interface to the wide coverage English and Korean XTAG grammars. Each XTAG grammar is lexicalized, which means at least one word selects a tree fragment (called an elementary tree or etree. Derivations for sentences are built by combining etrees using substitution (replacement of a tree node with an etree at the frontier of another etree and adjunction (replacement of an internal tree node in an etree by another etree. Each etree is associated with a feature structure representing constraints on substitution and adjunction. Feature structures are combined using unification during the combination of etrees. We plan to integrate our toolkit for XTAG grammars into the Python-based Natural Language Toolkit (NLTK: nltk.org. We have provided an API capable of searching the lexicalized etrees for a given word or multiple words, searching for a etree by name or function, display the lexicalized etrees to the user using a graphical view, display the feature structure associated with each tree node in an etree, hide or highlight features based on a regular expression, and browsing the entire tree database for each XTAG grammar.

Simulation of Canopy CO2/H2O Fluxes for a Rubber (Hevea Brasiliensis) Plantation in Central Cambodia: The Effect of the Regular Spacing of Planted Trees

Energy Technology Data Exchange (ETDEWEB)

Kumagai, Tomo' omi; Mudd, Ryan; Miyazawa, Yoshiyuki; Liu, Wen; Giambelluca, Thomas; Kobayashi, N.; Lim, Tiva Khan; Jomura, Mayuko; Matsumoto, Kazuho; Huang, Maoyi; Chen, Qi; Ziegler, Alan; Yin, Song

2013-09-10

We developed a soil-vegetation-atmosphere transfer (SVAT) model applicable to simulating CO2 and H2O fluxes from the canopies of rubber plantations, which are characterized by distinct canopy clumping produced by regular spacing of plantation trees. Rubber (Hevea brasiliensis Müll. Arg.) plantations, which are rapidly expanding into both climatically optimal and sub-optimal environments throughout mainland Southeast Asia, potentially change the partitioning of water, energy, and carbon at multiple scales, compared with traditional land covers it is replacing. Describing the biosphere-atmosphere exchange in rubber plantations via SVAT modeling is therefore essential to understanding the impacts on environmental processes. The regular spacing of plantation trees creates a peculiar canopy structure that is not well represented in most SVAT models, which generally assumes a non-uniform spacing of vegetation. Herein we develop a SVAT model applicable to rubber plantation and an evaluation method for its canopy structure, and examine how the peculiar canopy structure of rubber plantations affects canopy CO2 and H2O exchanges. Model results are compared with measurements collected at a field site in central Cambodia. Our findings suggest that it is crucial to account for intensive canopy clumping in order to reproduce observed rubber plantation fluxes. These results suggest a potentially optimal spacing of rubber trees to produce high productivity and water use efficiency.

IO and OI. II

DEFF Research Database (Denmark)

Engelfriet, Joost; Schmidt, Erik Meineche

1978-01-01

In Part 1 of this paper (J. Comput. System Sci. 15, Number 3 (1977)) we presented a fixed point characterization of the (IO and OI) context-free tree languages. We showed that a context-free tree grammar can be viewed as a system of regular equations over a tree language substitution algebra. In ....... In this part we shall use these results to obtain a theory of systems of context-free equations over arbitrary continuous algebras. We refer to the Introduction of Part 1 for a description of the contents of this part.......In Part 1 of this paper (J. Comput. System Sci. 15, Number 3 (1977)) we presented a fixed point characterization of the (IO and OI) context-free tree languages. We showed that a context-free tree grammar can be viewed as a system of regular equations over a tree language substitution algebra...

Regular algebra and finite machines

CERN Document Server

Conway, John Horton

2012-01-01

World-famous mathematician John H. Conway based this classic text on a 1966 course he taught at Cambridge University. Geared toward graduate students of mathematics, it will also prove a valuable guide to researchers and professional mathematicians.His topics cover Moore's theory of experiments, Kleene's theory of regular events and expressions, Kleene algebras, the differential calculus of events, factors and the factor matrix, and the theory of operators. Additional subjects include event classes and operator classes, some regulator algebras, context-free languages, communicative regular alg

Deterministic automata for extended regular expressions

Directory of Open Access Journals (Sweden)

Syzdykov Mirzakhmet

2017-12-01

Full Text Available In this work we present the algorithms to produce deterministic finite automaton (DFA for extended operators in regular expressions like intersection, subtraction and complement. The method like “overriding” of the source NFA(NFA not defined with subset construction rules is used. The past work described only the algorithm for AND-operator (or intersection of regular languages; in this paper the construction for the MINUS-operator (and complement is shown.

The Evolution of Frequency Distributions: Relating Regularization to Inductive Biases through Iterated Learning

Science.gov (United States)

Reali, Florencia; Griffiths, Thomas L.

2009-01-01

The regularization of linguistic structures by learners has played a key role in arguments for strong innate constraints on language acquisition, and has important implications for language evolution. However, relating the inductive biases of learners to regularization behavior in laboratory tasks can be challenging without a formal model. In this…

Systolic automata for VLSI on balanced trees

Energy Technology Data Exchange (ETDEWEB)

Culik, K Ii; Gruska, J; Salomaa, A

1983-01-01

Systolic tree automata with a binary (or, more generally, balanced) underlying tree are investigated. The main emphasis is on input conditions, decidability, and characterization of acceptable languages. 4 references.

Language Contact and Bilingualism

NARCIS (Netherlands)

Appel, René; Muysken, Pieter

2006-01-01

What happens - sociologically, linguistically, educationally, politically - when more than one language is in regular use in a community? How do speakers handle these languages simultaneously, and what influence does this language contact have on the languages involved? Although most people in the

A method of language sampling

DEFF Research Database (Denmark)

Rijkhoff, Jan; Bakker, Dik; Hengeveld, Kees

1993-01-01

In recent years more attention is paid to the quality of language samples in typological work. Without an adequate sampling strategy, samples may suffer from various kinds of bias. In this article we propose a sampling method in which the genetic criterion is taken as the most important: samples...... created with this method will reflect optimally the diversity of the languages of the world. On the basis of the internal structure of each genetic language tree a measure is computed that reflects the linguistic diversity in the language families represented by these trees. This measure is used...... to determine how many languages from each phylum should be selected, given any required sample size....

Rough Finite State Automata and Rough Languages

Science.gov (United States)

Arulprakasam, R.; Perumal, R.; Radhakrishnan, M.; Dare, V. R.

2018-04-01

Sumita Basu [1, 2] recently introduced the concept of a rough finite state (semi)automaton, rough grammar and rough languages. Motivated by the work of [1, 2], in this paper, we investigate some closure properties of rough regular languages and establish the equivalence between the classes of rough languages generated by rough grammar and the classes of rough regular languages accepted by rough finite automaton.

Expressiveness modulo Bisimilarity of Regular Expressions with Parallel Composition (Extended Abstract

Directory of Open Access Journals (Sweden)

Jos C. M. Baeten

2010-11-01

Full Text Available The languages accepted by finite automata are precisely the languages denoted by regular expressions. In contrast, finite automata may exhibit behaviours that cannot be described by regular expressions up to bisimilarity. In this paper, we consider extensions of the theory of regular expressions with various forms of parallel composition and study the effect on expressiveness. First we prove that adding pure interleaving to the theory of regular expressions strictly increases its expressiveness up to bisimilarity. Then, we prove that replacing the operation for pure interleaving by ACP-style parallel composition gives a further increase in expressiveness. Finally, we prove that the theory of regular expressions with ACP-style parallel composition and encapsulation is expressive enough to express all finite automata up to bisimilarity. Our results extend the expressiveness results obtained by Bergstra, Bethke and Ponse for process algebras with (the binary variant of Kleene's star operation.

The Temporal Dynamics of Regularity Extraction in Non-Human Primates

Science.gov (United States)

Minier, Laure; Fagot, Joël; Rey, Arnaud

2016-01-01

Extracting the regularities of our environment is one of our core cognitive abilities. To study the fine-grained dynamics of the extraction of embedded regularities, a method combining the advantages of the artificial language paradigm (Saffran, Aslin, & Newport, [Saffran, J. R., 1996]) and the serial response time task (Nissen & Bullemer,…

Track treeing mechanism and its application

International Nuclear Information System (INIS)

Li Boyang

1993-01-01

Based on electrostriction and fracture mechanics, experiment observation and data-processing, two models (restriction among tree tracks and induction of tree track onto stress concentrated spots) and factors (restriction and induction) are proposed; The existence of four types of plastic zone (spot-block pz, single crack isolate pz, transition from isolate to block pz and crack-block pz) and two types of annex (plastic zone and crack zone) are pointed out. The development regularities of Gp (diameter of plastic zone), G(diameter of tree track), S(tree track density) and total areal of tree track (SG 2 ) in two basic experiments (H=H+dH, H=Hc H-field strength) are described by using four basic formulae. (author)

On the regularization of extremal three-point functions involving giant gravitons

Directory of Open Access Journals (Sweden)

Charlotte Kristjansen

2015-11-01

Full Text Available In the AdS5/CFT4 set-up, extremal three-point functions involving two giant 1/2 BPS gravitons and one point-like 1/2 BPS graviton, when calculated using semi-classical string theory methods, match the corresponding three-point functions obtained in the tree-level gauge theory. The string theory computation relies on a certain regularization procedure whose justification is based on the match between gauge and string theory. We revisit the regularization procedure and reformulate it in a way which allows a generalization to the ABJM set-up where three-point functions of 1/2 BPS operators are not protected and where a match between tree-level gauge theory and semi-classical string theory is hence not expected.

CONSTRUCTION OF REGULAR LDPC LIKE CODES BASED ON FULL RANK CODES AND THEIR ITERATIVE DECODING USING A PARITY CHECK TREE

Directory of Open Access Journals (Sweden)

H. Prashantha Kumar

2011-09-01

Full Text Available Low density parity check (LDPC codes are capacity-approaching codes, which means that practical constructions exist that allow the noise threshold to be set very close to the theoretical Shannon limit for a memory less channel. LDPC codes are finding increasing use in applications like LTE-Networks, digital television, high density data storage systems, deep space communication systems etc. Several algebraic and combinatorial methods are available for constructing LDPC codes. In this paper we discuss a novel low complexity algebraic method for constructing regular LDPC like codes derived from full rank codes. We demonstrate that by employing these codes over AWGN channels, coding gains in excess of 2dB over un-coded systems can be realized when soft iterative decoding using a parity check tree is employed.

The Effect of Integration Policies on the Time until Regular Employment of Newly Arrived Immigrants:

DEFF Research Database (Denmark)

Clausen, Jens; Heinesen, Eskil; Hummelgaard, Hans

We analyse the effect of active labour-market programmes on the hazard rate into regular employment for newly arrived immigrants using the timing-of-events duration model. We take account of language course participation and progression in destination country language skills. We use rich...... administrative data from Denmark. We find substantial lock-in effects of participation in active labour-market programmes. Post programme effects on the hazard rate to regular employment are significantly positive for wage subsidy programmes, but not for other types of programmes. For language course...... participants, improvement in language proficiency has significant and substantial positive effects on the hazard rate to employment....

Italian Sign Language (LIS) Poetry: Iconic Properties and Structural Regularities.

Science.gov (United States)

Russo, Tommaso; Giuranna, Rosaria; Pizzuto, Elena

2001-01-01

Explores and describes from a crosslinguistic perspective, some of the major structural irregularities that characterize poetry in Italian Sign Language and distinguish poetic from nonpoetic texts. Reviews findings of previous studies of signed language poetry, and points out issues that need to be clarified to provide a more accurate description…

Regular expressions compiler and some applications

International Nuclear Information System (INIS)

Saldana A, H.

1978-01-01

We deal with high level programming language of a Regular Expressions Compiler (REC). The first chapter is an introduction in which the history of the REC development and the problems related to its numerous applicatons are described. The syntactic and sematic rules as well as the language features are discussed just after the introduction. Concerning the applicatons as examples, an adaptation is given in order to solve numerical problems and another for the data manipulation. The last chapter is an exposition of ideas and techniques about the compiler construction. Examples of the adaptation to numerical problems show the applications to education, vector analysis, quantum mechanics, physics, mathematics and other sciences. The rudiments of an operating system for a minicomputer are the examples of the adaptation to symbolic data manipulaton. REC is a programming language that could be applied to solve problems in almost any human activity. Handling of computer graphics, control equipment, research on languages, microprocessors and general research are some of the fields in which this programming language can be applied and developed. (author)

Regular Expression Matching and Operational Semantics

Directory of Open Access Journals (Sweden)

Asiri Rathnayake

2011-08-01

Full Text Available Many programming languages and tools, ranging from grep to the Java String library, contain regular expression matchers. Rather than first translating a regular expression into a deterministic finite automaton, such implementations typically match the regular expression on the fly. Thus they can be seen as virtual machines interpreting the regular expression much as if it were a program with some non-deterministic constructs such as the Kleene star. We formalize this implementation technique for regular expression matching using operational semantics. Specifically, we derive a series of abstract machines, moving from the abstract definition of matching to increasingly realistic machines. First a continuation is added to the operational semantics to describe what remains to be matched after the current expression. Next, we represent the expression as a data structure using pointers, which enables redundant searches to be eliminated via testing for pointer equality. From there, we arrive both at Thompson's lockstep construction and a machine that performs some operations in parallel, suitable for implementation on a large number of cores, such as a GPU. We formalize the parallel machine using process algebra and report some preliminary experiments with an implementation on a graphics processor using CUDA.

Success tree method of resources evaluation

International Nuclear Information System (INIS)

Chen Qinglan; Sun Wenpeng

1994-01-01

By applying the reliability theory in system engineering, the success tree method is used to transfer the expert's recognition on metallogenetic regularities into the form of the success tree. The aim of resources evaluation is achieved by means of calculating the metallogenetic probability or favorability of the top event of the success tree. This article introduces in detail, the source, principle of the success tree method and three kinds of calculation methods, expounds concretely how to establish the success tree of comprehensive uranium metallogenesis as well as the procedure from which the resources evaluation is performed. Because this method has not restrictions on the number of known deposits and calculated area, it is applicable to resources evaluation for different mineral species, types and scales and possesses good prospects of development

Tokunaga and Horton self-similarity for level set trees of Markov chains

International Nuclear Information System (INIS)

Zaliapin, Ilia; Kovchegov, Yevgeniy

2012-01-01

Highlights: ► Self-similar properties of the level set trees for Markov chains are studied. ► Tokunaga and Horton self-similarity are established for symmetric Markov chains and regular Brownian motion. ► Strong, distributional self-similarity is established for symmetric Markov chains with exponential jumps. ► It is conjectured that fractional Brownian motions are Tokunaga self-similar. - Abstract: The Horton and Tokunaga branching laws provide a convenient framework for studying self-similarity in random trees. The Horton self-similarity is a weaker property that addresses the principal branching in a tree; it is a counterpart of the power-law size distribution for elements of a branching system. The stronger Tokunaga self-similarity addresses so-called side branching. The Horton and Tokunaga self-similarity have been empirically established in numerous observed and modeled systems, and proven for two paradigmatic models: the critical Galton–Watson branching process with finite progeny and the finite-tree representation of a regular Brownian excursion. This study establishes the Tokunaga and Horton self-similarity for a tree representation of a finite symmetric homogeneous Markov chain. We also extend the concept of Horton and Tokunaga self-similarity to infinite trees and establish self-similarity for an infinite-tree representation of a regular Brownian motion. We conjecture that fractional Brownian motions are also Tokunaga and Horton self-similar, with self-similarity parameters depending on the Hurst exponent.

Regularizing Unpredictable Variation: Evidence from a Natural Language Setting

Science.gov (United States)

Hendricks, Alison Eisel; Miller, Karen; Jackson, Carrie N.

2018-01-01

While previous sociolinguistic research has demonstrated that children faithfully acquire probabilistic input constrained by sociolinguistic and linguistic factors (e.g., gender and socioeconomic status), research suggests children regularize inconsistent input-probabilistic input that is not sociolinguistically constrained (e.g., Hudson Kam &…

Learning Type Extension Trees for Metal Bonding State Prediction

DEFF Research Database (Denmark)

Frasconi, Paolo; Jaeger, Manfred; Passerini, Andrea

2008-01-01

Type Extension Trees (TET) have been recently introduced as an expressive representation language allowing to encode complex combinatorial features of relational entities. They can be efficiently learned with a greedy search strategy driven by a generalized relational information gain and a discr......Type Extension Trees (TET) have been recently introduced as an expressive representation language allowing to encode complex combinatorial features of relational entities. They can be efficiently learned with a greedy search strategy driven by a generalized relational information gain...

Timing-Driven-Testable Convergent Tree Adders

Directory of Open Access Journals (Sweden)

Johnnie A. Huang

2002-01-01

Full Text Available Carry lookahead adders have been, over the years, implemented in complex arithmetic units due to their regular structure which leads to efficient VLSI implementation for fast adders. In this paper, timing-driven testability synthesis is first performed on a tree adder. It is shown that the structure of the tree adder provides for a high fanout with an imbalanced tree structure, which likely contributes to a racing effect and increases the delay of the circuit. The timing optimization is then realized by reducing the maximum fanout of the adder and by balancing the tree circuit. For a 56-b testable tree adder, the optimization produces a 6.37%increase in speed of the critical path while only contributing a 2.16% area overhead. The full testability of the circuit is achieved in the optimized adder design.

Subcortical processing of speech regularities underlies reading and music aptitude in children

Science.gov (United States)

2011-01-01

Background Neural sensitivity to acoustic regularities supports fundamental human behaviors such as hearing in noise and reading. Although the failure to encode acoustic regularities in ongoing speech has been associated with language and literacy deficits, how auditory expertise, such as the expertise that is associated with musical skill, relates to the brainstem processing of speech regularities is unknown. An association between musical skill and neural sensitivity to acoustic regularities would not be surprising given the importance of repetition and regularity in music. Here, we aimed to define relationships between the subcortical processing of speech regularities, music aptitude, and reading abilities in children with and without reading impairment. We hypothesized that, in combination with auditory cognitive abilities, neural sensitivity to regularities in ongoing speech provides a common biological mechanism underlying the development of music and reading abilities. Methods We assessed auditory working memory and attention, music aptitude, reading ability, and neural sensitivity to acoustic regularities in 42 school-aged children with a wide range of reading ability. Neural sensitivity to acoustic regularities was assessed by recording brainstem responses to the same speech sound presented in predictable and variable speech streams. Results Through correlation analyses and structural equation modeling, we reveal that music aptitude and literacy both relate to the extent of subcortical adaptation to regularities in ongoing speech as well as with auditory working memory and attention. Relationships between music and speech processing are specifically driven by performance on a musical rhythm task, underscoring the importance of rhythmic regularity for both language and music. Conclusions These data indicate common brain mechanisms underlying reading and music abilities that relate to how the nervous system responds to regularities in auditory input

Subcortical processing of speech regularities underlies reading and music aptitude in children.

Science.gov (United States)

Strait, Dana L; Hornickel, Jane; Kraus, Nina

2011-10-17

Neural sensitivity to acoustic regularities supports fundamental human behaviors such as hearing in noise and reading. Although the failure to encode acoustic regularities in ongoing speech has been associated with language and literacy deficits, how auditory expertise, such as the expertise that is associated with musical skill, relates to the brainstem processing of speech regularities is unknown. An association between musical skill and neural sensitivity to acoustic regularities would not be surprising given the importance of repetition and regularity in music. Here, we aimed to define relationships between the subcortical processing of speech regularities, music aptitude, and reading abilities in children with and without reading impairment. We hypothesized that, in combination with auditory cognitive abilities, neural sensitivity to regularities in ongoing speech provides a common biological mechanism underlying the development of music and reading abilities. We assessed auditory working memory and attention, music aptitude, reading ability, and neural sensitivity to acoustic regularities in 42 school-aged children with a wide range of reading ability. Neural sensitivity to acoustic regularities was assessed by recording brainstem responses to the same speech sound presented in predictable and variable speech streams. Through correlation analyses and structural equation modeling, we reveal that music aptitude and literacy both relate to the extent of subcortical adaptation to regularities in ongoing speech as well as with auditory working memory and attention. Relationships between music and speech processing are specifically driven by performance on a musical rhythm task, underscoring the importance of rhythmic regularity for both language and music. These data indicate common brain mechanisms underlying reading and music abilities that relate to how the nervous system responds to regularities in auditory input. Definition of common biological underpinnings

Subcortical processing of speech regularities underlies reading and music aptitude in children

Directory of Open Access Journals (Sweden)

Strait Dana L

2011-10-01

Full Text Available Abstract Background Neural sensitivity to acoustic regularities supports fundamental human behaviors such as hearing in noise and reading. Although the failure to encode acoustic regularities in ongoing speech has been associated with language and literacy deficits, how auditory expertise, such as the expertise that is associated with musical skill, relates to the brainstem processing of speech regularities is unknown. An association between musical skill and neural sensitivity to acoustic regularities would not be surprising given the importance of repetition and regularity in music. Here, we aimed to define relationships between the subcortical processing of speech regularities, music aptitude, and reading abilities in children with and without reading impairment. We hypothesized that, in combination with auditory cognitive abilities, neural sensitivity to regularities in ongoing speech provides a common biological mechanism underlying the development of music and reading abilities. Methods We assessed auditory working memory and attention, music aptitude, reading ability, and neural sensitivity to acoustic regularities in 42 school-aged children with a wide range of reading ability. Neural sensitivity to acoustic regularities was assessed by recording brainstem responses to the same speech sound presented in predictable and variable speech streams. Results Through correlation analyses and structural equation modeling, we reveal that music aptitude and literacy both relate to the extent of subcortical adaptation to regularities in ongoing speech as well as with auditory working memory and attention. Relationships between music and speech processing are specifically driven by performance on a musical rhythm task, underscoring the importance of rhythmic regularity for both language and music. Conclusions These data indicate common brain mechanisms underlying reading and music abilities that relate to how the nervous system responds to

Efficient Delaunay Tessellation through K-D Tree Decomposition

Energy Technology Data Exchange (ETDEWEB)

Morozov, Dmitriy; Peterka, Tom

2017-08-21

Delaunay tessellations are fundamental data structures in computational geometry. They are important in data analysis, where they can represent the geometry of a point set or approximate its density. The algorithms for computing these tessellations at scale perform poorly when the input data is unbalanced. We investigate the use of k-d trees to evenly distribute points among processes and compare two strategies for picking split points between domain regions. Because resulting point distributions no longer satisfy the assumptions of existing parallel Delaunay algorithms, we develop a new parallel algorithm that adapts to its input and prove its correctness. We evaluate the new algorithm using two late-stage cosmology datasets. The new running times are up to 50 times faster using k-d tree compared with regular grid decomposition. Moreover, in the unbalanced data sets, decomposing the domain into a k-d tree is up to five times faster than decomposing it into a regular grid.

Language and Recursion

Science.gov (United States)

Lowenthal, Francis

2010-11-01

This paper examines whether the recursive structure imbedded in some exercises used in the Non Verbal Communication Device (NVCD) approach is actually the factor that enables this approach to favor language acquisition and reacquisition in the case of children with cerebral lesions. For that a definition of the principle of recursion as it is used by logicians is presented. The two opposing approaches to the problem of language development are explained. For many authors such as Chomsky [1] the faculty of language is innate. This is known as the Standard Theory; the other researchers in this field, e.g. Bates and Elman [2], claim that language is entirely constructed by the young child: they thus speak of Language Acquisition. It is also shown that in both cases, a version of the principle of recursion is relevant for human language. The NVCD approach is defined and the results obtained in the domain of language while using this approach are presented: young subjects using this approach acquire a richer language structure or re-acquire such a structure in the case of cerebral lesions. Finally it is shown that exercises used in this framework imply the manipulation of recursive structures leading to regular grammars. It is thus hypothesized that language development could be favored using recursive structures with the young child. It could also be the case that the NVCD like exercises used with children lead to the elaboration of a regular language, as defined by Chomsky [3], which could be sufficient for language development but would not require full recursion. This double claim could reconcile Chomsky's approach with psychological observations made by adherents of the Language Acquisition approach, if it is confirmed by researches combining the use of NVCDs, psychometric methods and the use of Neural Networks. This paper thus suggests that a research group oriented towards this problematic should be organized.

A comparative analysis of learninig a foreign language in multimedia courses with regular EFL courses. A case study at the University of Cuenca

OpenAIRE

Cabrera Arias, Sandra Mercedes

2011-01-01

Nowadays, there are different methods that students can use to learn English as a foreign language. One of them is through using multimedia at The University of Cuenca on the newly implemented multimedia course. However, a lack of information to demonstrate whether these courses are effective or not led to the development of this study, which consists of a comparative analysis between a regular course and a multimedia course, both developed at the University of Cuenca. Twenty students on t...

Tree Resolution Proofs of the Weak Pigeon-Hole Principle

DEFF Research Database (Denmark)

Dantchev, Stefan Stajanov; Riis, Søren

2001-01-01

We prove that any optimal tree resolution proof of PHPn m is of size 2&thetas;(n log n), independently from m, even if it is infinity. So far, only a 2Ω(n) lower bound has been known in the general case. We also show that any, not necessarily optimal, regular tree resolution proof PHPn m is bound...

Steiner minimal trees in small neighbourhoods of points in Riemannian manifolds

Science.gov (United States)

Chikin, V. M.

2017-07-01

In contrast to the Euclidean case, almost no Steiner minimal trees with concrete boundaries on Riemannian manifolds are known. A result describing the types of Steiner minimal trees on a Riemannian manifold for arbitrary small boundaries is obtained. As a consequence, it is shown that for sufficiently small regular n-gons with n≥ 7 their boundaries without a longest side are Steiner minimal trees. Bibliography: 22 titles.

Algebraic Aspects of Families of Fuzzy Languages

NARCIS (Netherlands)

Asveld, P.R.J.; Heylen, Dirk K.J.; Nijholt, Antinus; Scollo, Giuseppe

2000-01-01

We study operations on fuzzy languages such as union, concatenation,Kleene $\\star$, intersection with regular fuzzy languages, and several kinds of (iterated) fuzzy substitution. Then we consider families of fuzzy languages, closed under a fixed collection of these operations, which results in the

YakYak: Parsing with Logical Side Constraints

DEFF Research Database (Denmark)

Hansen, Niels Damgaard; Klarlund, Nils; Schwartzbach, Michael Ignatieff

2000-01-01

Yak, which extends Yacc with first-order logic for specifying consteaints that are regular tree languages. Concise formulas about the parse tree replace explicit programming, and they are turned into canonical attribute grammars through tree automata calculations. YakYak is implemented as a proprocessor...

Computational Nonlinear Morphology with Emphasis on Semitic Languages. Studies in Natural Language Processing.

Science.gov (United States)

Kiraz, George Anton

This book presents a tractable computational model that can cope with complex morphological operations, especially in Semitic languages, and less complex morphological systems present in Western languages. It outlines a new generalized regular rewrite rule system that uses multiple finite-state automata to cater to root-and-pattern morphology,…

Verbal working memory is related to the acquisition of cross-linguistic phonological regularities

NARCIS (Netherlands)

Bosma, E.; Heeringa, W.; Hoekstra, E.; Versloot, A.; Blom, E.

Closely related languages share cross-linguistic phonological regularities, such as Frisian -âld [c:t] and Dutch -oud [hut], as in the cognate pairs kâld [kc:t] - koud [khut] 'cold' and wâld [wc:t] - woud [whut] 'forest'. Within Bybee's (1995, 2001, 2008, 2010) network model, these regularities are,

Entanglement in coined quantum walks on regular graphs

International Nuclear Information System (INIS)

Carneiro, Ivens; Loo, Meng; Xu, Xibai; Girerd, Mathieu; Kendon, Viv; Knight, Peter L

2005-01-01

Quantum walks, both discrete (coined) and continuous time, form the basis of several recent quantum algorithms. Here we use numerical simulations to study the properties of discrete, coined quantum walks. We investigate the variation in the entanglement between the coin and the position of the particle by calculating the entropy of the reduced density matrix of the coin. We consider both dynamical evolution and asymptotic limits for coins of dimensions from two to eight on regular graphs. For low coin dimensions, quantum walks which spread faster (as measured by the mean square deviation of their distribution from uniform) also exhibit faster convergence towards the asymptotic value of the entanglement between the coin and particle's position. For high-dimensional coins, the DFT coin operator is more efficient at spreading than the Grover coin. We study the entanglement of the coin on regular finite graphs such as cycles, and also show that on complete bipartite graphs, a quantum walk with a Grover coin is always periodic with period four. We generalize the 'glued trees' graph used by Childs et al (2003 Proc. STOC, pp 59-68) to higher branching rate (fan out) and verify that the scaling with branching rate and with tree depth is polynomial

Verbal Working Memory Is Related to the Acquisition of Cross-Linguistic Phonological Regularities.

Science.gov (United States)

Bosma, Evelyn; Heeringa, Wilbert; Hoekstra, Eric; Versloot, Arjen; Blom, Elma

2017-01-01

Closely related languages share cross-linguistic phonological regularities, such as Frisian -âld [ͻ:t] and Dutch -oud [ʱut], as in the cognate pairs kâld [kͻ:t] - koud [kʱut] 'cold' and wâld [wͻ:t] - woud [wʱut] 'forest'. Within Bybee's (1995, 2001, 2008, 2010) network model, these regularities are, just like grammatical rules within a language, generalizations that emerge from schemas of phonologically and semantically related words. Previous research has shown that verbal working memory is related to the acquisition of grammar, but not vocabulary. This suggests that verbal working memory supports the acquisition of linguistic regularities. In order to test this hypothesis we investigated whether verbal working memory is also related to the acquisition of cross-linguistic phonological regularities. For three consecutive years, 5- to 8-year-old Frisian-Dutch bilingual children ( n = 120) were tested annually on verbal working memory and a Frisian receptive vocabulary task that comprised four cognate categories: (1) identical cognates, (2) non-identical cognates that either do or (3) do not exhibit a phonological regularity between Frisian and Dutch, and (4) non-cognates. The results showed that verbal working memory had a significantly stronger effect on cognate category (2) than on the other three cognate categories. This suggests that verbal working memory is related to the acquisition of cross-linguistic phonological regularities. More generally, it confirms the hypothesis that verbal working memory plays a role in the acquisition of linguistic regularities.

The Regularity of Optimal Irrigation Patterns

Science.gov (United States)

Morel, Jean-Michel; Santambrogio, Filippo

2010-02-01

A branched structure is observable in draining and irrigation systems, in electric power supply systems, and in natural objects like blood vessels, the river basins or the trees. Recent approaches of these networks derive their branched structure from an energy functional whose essential feature is to favor wide routes. Given a flow s in a river, a road, a tube or a wire, the transportation cost per unit length is supposed in these models to be proportional to s α with 0 measure is the Lebesgue density on a smooth open set and the irrigating measure is a single source. In that case we prove that all branches of optimal irrigation trees satisfy an elliptic equation and that their curvature is a bounded measure. In consequence all branching points in the network have a tangent cone made of a finite number of segments, and all other points have a tangent. An explicit counterexample disproves these regularity properties for non-Lebesgue irrigated measures.

A new coding algorithm for trees

NARCIS (Netherlands)

Balakirsky, V.B.

2002-01-01

We construct a one-to-one mapping between binary vectors of length $n$ and preorder codewords of regular, ordered, oriented, rooted, binary trees having $N \\approx n + 2$ log $n$ nodes. The mappings in both directions can be organized in such a way that complexities of all transformations are

A statistical analysis of individual success after successful completion of Defense Language Institute Foreign Language Center Training

OpenAIRE

Hinson, William B.

2005-01-01

"The Defense Language Institute Foreign Language Center (DLIFLC) trains students in various foreign languages and dialects for the Department of Defense (DOD). The majority of students are firstterm enlistees in the basic program. This study uses classification trees and logistic regression to understand the military, academic and personal characteristics that influence first-term success after successfully completing DLIFLC training. Success was defined as completing a firstterm enlistme...

A scheme for training effective English Second Language medium of ...

African Journals Online (AJOL)

Effective second language medium of instruction refers to an instructional approach that differs from that of regular, first language content instruction or a language across the curriculum approach. This approach uses language teaching strategies in subjects other than the formal language classes, to promote both ...

Tree diversity patterns along the latitudinal gradient in the northwestern Russia

Directory of Open Access Journals (Sweden)

Elena Tikhonova

2017-12-01

Full Text Available Background One of the key forest characteristics is the biodiversity, particularly the diversity of trees which are forest ecosystem engineers. Nowadays the most worldwide common approach for assessment of forest conditions and dynamics is based on the systematic monitoring, performed at a set of regularly structured plots. To fulfill the existing gap in this sort of knowledge on the Russian forests, an extensive study of tree species diversity on a regular network was conducted in north-west of Russia. Methods The study used the ICP Forests monitoring network that spans over 1700 km along the western Russian border from forest-tundra in the north to broadleaved-coniferous forests in the south. Tree data were collected at 710 sites that were assigned along a regular grid. We performed series of statistical analyses of the tree species distribution and diversity in relation to environmental and anthropogenic factors. Results According to the Maxent species distribution modelling results only Pinus sylvestris, Betula sp. and Picea abies have the potential to grow throughout the study area. The locally maximum tree species diversity varies along the latitudinal gradient from 1 to 3 species in the north to 5–7 species in the south. Monocultural stands are relatively abundant across the study area, being especially common in the south taiga. The prevailing part of the monocultural stands is represented by Scots pine (72%. The age distribution of dominant trees has a clear connection with the intensity of forest use. We found that recent wildfire events had only little effect on tree diversity in the study area. Conclusions We demonstrated that ICP Forests monitoring network enables to successfully establish the main qualitative and quantitative relations of the spatial variation of tree species diversity to climatic, landscape, soil and anthropogenic factors. Analysis of the influence of these factors on tree species distribution allowed us to

UNFOLDED REGULAR AND SEMI-REGULAR POLYHEDRA

Directory of Open Access Journals (Sweden)

IONIŢĂ Elena

2015-06-01

Full Text Available This paper proposes a presentation unfolding regular and semi-regular polyhedra. Regular polyhedra are convex polyhedra whose faces are regular and equal polygons, with the same number of sides, and whose polyhedral angles are also regular and equal. Semi-regular polyhedra are convex polyhedra with regular polygon faces, several types and equal solid angles of the same type. A net of a polyhedron is a collection of edges in the plane which are the unfolded edges of the solid. Modeling and unfolding Platonic and Arhimediene polyhedra will be using 3dsMAX program. This paper is intended as an example of descriptive geometry applications.

Designing Syntax Embeddings and Assimilations for Language Libraries

NARCIS (Netherlands)

Bravenboer, M.; Visser, E.

2009-01-01

Preprint of paper published in: Models in Software Engineering, Lecture Notes in Computer Science 5002, 2008; doi:10.1007/978-3-540-69073-3_5 Language libraries extend regular libraries with domain-specific notation. More precisely, a language library is a combination of a domain-specific language

Verbal Working Memory Is Related to the Acquisition of Cross-Linguistic Phonological Regularities

Directory of Open Access Journals (Sweden)

Evelyn Bosma

2017-09-01

Full Text Available Closely related languages share cross-linguistic phonological regularities, such as Frisian -âld [ͻ:t] and Dutch -oud [ʱut], as in the cognate pairs kâld [kͻ:t] – koud [kʱut] ‘cold’ and wâld [wͻ:t] – woud [wʱut] ‘forest’. Within Bybee’s (1995, 2001, 2008, 2010 network model, these regularities are, just like grammatical rules within a language, generalizations that emerge from schemas of phonologically and semantically related words. Previous research has shown that verbal working memory is related to the acquisition of grammar, but not vocabulary. This suggests that verbal working memory supports the acquisition of linguistic regularities. In order to test this hypothesis we investigated whether verbal working memory is also related to the acquisition of cross-linguistic phonological regularities. For three consecutive years, 5- to 8-year-old Frisian-Dutch bilingual children (n = 120 were tested annually on verbal working memory and a Frisian receptive vocabulary task that comprised four cognate categories: (1 identical cognates, (2 non-identical cognates that either do or (3 do not exhibit a phonological regularity between Frisian and Dutch, and (4 non-cognates. The results showed that verbal working memory had a significantly stronger effect on cognate category (2 than on the other three cognate categories. This suggests that verbal working memory is related to the acquisition of cross-linguistic phonological regularities. More generally, it confirms the hypothesis that verbal working memory plays a role in the acquisition of linguistic regularities.

TRAINING TREE ADJOINING GRAMMARS WITH HUGE TEXT CORPUS USING SPARK MAP REDUCE

Directory of Open Access Journals (Sweden)

Vijay Krishna Menon

2015-07-01

Full Text Available Tree adjoining grammars (TAGs are mildly context sensitive formalisms used mainly in modelling natural languages. Usage and research on these psycho linguistic formalisms have been erratic in the past decade, due to its demanding construction and difficulty to parse. However, they represent promising future for formalism based NLP in multilingual scenarios. In this paper we demonstrate basic synchronous Tree adjoining grammar for English-Tamil language pair that can be used readily for machine translation. We have also developed a multithreaded chart parser that gives ambiguous deep structures and a par dependency structure known as TAG derivation. Furthermore we then focus on a model for training this TAG for each language using a large corpus of text through a map reduce frequency count model in spark and estimation of various probabilistic parameters for the grammar trees thereafter; these parameters can be used to perform statistical parsing on the trained grammar.

Multiple hypothesis tracking based extraction of airway trees from CT data

DEFF Research Database (Denmark)

Raghavendra, Selvan; Petersen, Jens; de Bruijne, Marleen

Segmentation of airway trees from CT scans of lungs has important clinical applications, in relation to the diagnosis of chronic obstructive pulmonary disease (COPD). Here we present a method based on multiple hypothesis tracking (MHT) and template matching, originally devised for vessel...... segmentation, to extract airway trees. Idealized tubular templates are constructed and ranked using scores assigned based on the image data. Several such regularly spaced hypotheses are used in constructing a hypothesis tree, which is then traversed to obtain improved segmentation results....

Verbal Working Memory Is Related to the Acquisition of Cross-Linguistic Phonological Regularities

NARCIS (Netherlands)

Bosma, E.; Heeringa, Wilbert; Hoekstra, E.; Versloot, A.P.; Blom, W.B.T.

2017-01-01

Closely related languages share cross-linguistic phonological regularities, such as Frisian -âld [ͻ:t] and Dutch -oud [ʱut], as in the cognate pairs kâld [kͻ:t] – koud [kʱut] ‘cold’ and wâld [wͻ:t] – woud [wʱut] ‘forest’. Within Bybee’s (1995, 2001, 2008, 2010) network model, these regularities are,

Analytical and numerical studies of creation probabilities of hierarchical trees

Directory of Open Access Journals (Sweden)

S.S. Borysov

2011-03-01

Full Text Available We consider the creation conditions of diverse hierarchical trees both analytically and numerically. A connection between the probabilities to create hierarchical levels and the probability to associate these levels into a united structure is studied. We argue that a consistent probabilistic picture requires the use of deformed algebra. Our consideration is based on the study of the main types of hierarchical trees, among which both regular and degenerate ones are studied analytically, while the creation probabilities of Fibonacci, scale-free and arbitrary trees are determined numerically.

Gauge invariant sub-structures of tree-level double-emission exact QCD spin amplitudes

CERN Document Server

Van Hameren, A

2009-01-01

In this note we discuss possible separations of exact, massive, tree-level spin amplitudes into gauge invariant parts. We concentrate our attention on processes involving two quarks entering a color- neutral current and, thanks to the QCD interactions, two extra external gluons. We will search for forms compatible with parton shower languages, without applying approximations or restrictions on phase space regions. Special emphasis will be put on the isolation of parts necessary for the construction of evolution kernels for individual splittings and to some degree for the running coupling constant as well. Our aim is to better understand the environment necessary to optimally match hard matrix elements with partons shower algorithms. To avoid complications and ambiguities related to regularization schemes, we ignore, at this point, virtual corrections. Our representation is quite universal: any color-neutral current can be used, in particular our approach is not restricted to vector currents only.

From exemplar to grammar: a probabilistic analogy-based model of language learning.

Science.gov (United States)

Bod, Rens

2009-07-01

While rules and exemplars are usually viewed as opposites, this paper argues that they form end points of the same distribution. By representing both rules and exemplars as (partial) trees, we can take into account the fluid middle ground between the two extremes. This insight is the starting point for a new theory of language learning that is based on the following idea: If a language learner does not know which phrase-structure trees should be assigned to initial sentences, s/he allows (implicitly) for all possible trees and lets linguistic experience decide which is the "best" tree for each sentence. The best tree is obtained by maximizing "structural analogy" between a sentence and previous sentences, which is formalized by the most probable shortest combination of subtrees from all trees of previous sentences. Corpus-based experiments with this model on the Penn Treebank and the Childes database indicate that it can learn both exemplar-based and rule-based aspects of language, ranging from phrasal verbs to auxiliary fronting. By having learned the syntactic structures of sentences, we have also learned the grammar implicit in these structures, which can in turn be used to produce new sentences. We show that our model mimicks children's language development from item-based constructions to abstract constructions, and that the model can simulate some of the errors made by children in producing complex questions. Copyright © 2009 Cognitive Science Society, Inc.

The k-Language Classification, a Proposed New Theory for Image Classification and Clustering at Pixel Level

Directory of Open Access Journals (Sweden)

Alwi Aslan

2014-03-01

Full Text Available This theory attempted to explore the possibility of using regular language further in image analysis, departing from the use of string to represent the region in the image. But we are not trying to show an alternative idea about how to generate a string region, where there are many different ways how the image or region produces strings representing, in this paper we propose a way how to generate regular language or group of languages which performs both classify the set of strings generated by a group of a number of image regions. Researchers began by showing a proof that there is always a regular language that accepts a set of strings that produced the image, and then use the language to perform the classification. Research then expanded to the pixel level, on whether the regular language can be used for clustering pixels in the image, the researchers propose a systematic solution of this question. As a tool used to explore regular language is deterministic finite automata. On the end part before conclusion of this paper, we add revision version of this theory. There is another point of view to revision version, added for make this method more precision and more powerfull from before.

Formal language constrained path problems

Energy Technology Data Exchange (ETDEWEB)

Barrett, C.; Jacob, R.; Marathe, M.

1997-07-08

In many path finding problems arising in practice, certain patterns of edge/vertex labels in the labeled graph being traversed are allowed/preferred, while others are disallowed. Motivated by such applications as intermodal transportation planning, the authors investigate the complexity of finding feasible paths in a labeled network, where the mode choice for each traveler is specified by a formal language. The main contributions of this paper include the following: (1) the authors show that the problem of finding a shortest path between a source and destination for a traveler whose mode choice is specified as a context free language is solvable efficiently in polynomial time, when the mode choice is specified as a regular language they provide algorithms with improved space and time bounds; (2) in contrast, they show that the problem of finding simple paths between a source and a given destination is NP-hard, even when restricted to very simple regular expressions and/or very simple graphs; (3) for the class of treewidth bounded graphs, they show that (i) the problem of finding a regular language constrained simple path between source and a destination is solvable in polynomial time and (ii) the extension to finding context free language constrained simple paths is NP-complete. Several extensions of these results are presented in the context of finding shortest paths with additional constraints. These results significantly extend the results in [MW95]. As a corollary of the results, they obtain a polynomial time algorithm for the BEST k-SIMILAR PATH problem studied in [SJB97]. The previous best algorithm was given by [SJB97] and takes exponential time in the worst case.

The LPM effect in sequential bremsstrahlung: dimensional regularization

Energy Technology Data Exchange (ETDEWEB)

Arnold, Peter; Chang, Han-Chih [Department of Physics, University of Virginia,382 McCormick Road, Charlottesville, VA 22894-4714 (United States); Iqbal, Shahin [National Centre for Physics,Quaid-i-Azam University Campus, Islamabad, 45320 (Pakistan)

2016-10-19

The splitting processes of bremsstrahlung and pair production in a medium are coherent over large distances in the very high energy limit, which leads to a suppression known as the Landau-Pomeranchuk-Migdal (LPM) effect. Of recent interest is the case when the coherence lengths of two consecutive splitting processes overlap (which is important for understanding corrections to standard treatments of the LPM effect in QCD). In previous papers, we have developed methods for computing such corrections without making soft-gluon approximations. However, our methods require consistent treatment of canceling ultraviolet (UV) divergences associated with coincident emission times, even for processes with tree-level amplitudes. In this paper, we show how to use dimensional regularization to properly handle the UV contributions. We also present a simple diagnostic test that any consistent UV regularization method for this problem needs to pass.

Regular-, irregular-, and pseudo-character processing in Chinese: The regularity effect in normal adult readers

Directory of Open Access Journals (Sweden)

Dustin Kai Yan Lau

2014-03-01

Full Text Available Background Unlike alphabetic languages, Chinese uses a logographic script. However, the pronunciation of many character’s phonetic radical has the same pronunciation as the character as a whole. These are considered regular characters and can be read through a lexical non-semantic route (Weekes & Chen, 1999. Pseudocharacters are another way to study this non-semantic route. A pseudocharacter is the combination of existing semantic and phonetic radicals in their legal positions resulting in a non-existing character (Ho, Chan, Chung, Lee, & Tsang, 2007. Pseudocharacters can be pronounced by direct derivation from the sound of its phonetic radical. Conversely, if the pronunciation of a character does not follow that of the phonetic radical, it is considered as irregular and can only be correctly read through the lexical-semantic route. The aim of the current investigation was to examine reading aloud in normal adults. We hypothesized that the regularity effect, previously described for alphabetical scripts and acquired dyslexic patients of Chinese (Weekes & Chen, 1999; Wu, Liu, Sun, Chromik, & Zhang, 2014, would also be present in normal adult Chinese readers. Method Participants. Thirty (50% female native Hong Kong Cantonese speakers with a mean age of 19.6 years and a mean education of 12.9 years. Stimuli. Sixty regular-, 60 irregular-, and 60 pseudo-characters (with at least 75% of name agreement in Chinese were matched by initial phoneme, number of strokes and family size. Additionally, regular- and irregular-characters were matched by frequency (low and consistency. Procedure. Each participant was asked to read aloud the stimuli presented on a laptop using the DMDX software. The order of stimuli presentation was randomized. Data analysis. ANOVAs were carried out by participants and items with RTs and errors as dependent variables and type of stimuli (regular-, irregular- and pseudo-character as repeated measures (F1 or between subject�

SLE as a Mating of Trees in Euclidean Geometry

Science.gov (United States)

Holden, Nina; Sun, Xin

2018-05-01

The mating of trees approach to Schramm-Loewner evolution (SLE) in the random geometry of Liouville quantum gravity (LQG) has been recently developed by Duplantier et al. (Liouville quantum gravity as a mating of trees, 2014. arXiv:1409.7055). In this paper we consider the mating of trees approach to SLE in Euclidean geometry. Let {η} be a whole-plane space-filling SLE with parameter {κ > 4} , parameterized by Lebesgue measure. The main observable in the mating of trees approach is the contour function, a two-dimensional continuous process describing the evolution of the Minkowski content of the left and right frontier of {η} . We prove regularity properties of the contour function and show that (as in the LQG case) it encodes all the information about the curve {η} . We also prove that the uniform spanning tree on {Z^2} converges to SLE8 in the natural topology associated with the mating of trees approach.

How language production shapes language form and comprehension

Directory of Open Access Journals (Sweden)

Maryellen C MacDonald

2013-04-01

Full Text Available Language production processes can provide insight into how language comprehension works and language typology—why languages tend to have certain characteristics more often than others. Drawing on work in memory retrieval, motor planning, and serial order in action planning, the Production-Distribution-Comprehension (PDC account links work in the fields of language production, typology, and comprehension: 1 faced with substantial computational burdens of planning and producing utterances, language producers implicitly follow three biases in utterance planning that promote word order choices that reduce these burdens, thereby improving production fluency. 2 These choices, repeated over many utterances and individuals, shape the distributions of utterance forms in language. The claim that language form stems in large degree from producers’ attempts to mitigate utterance planning difficulty is contrasted with alternative accounts in which form is driven by language use more broadly, language acquisition processes, or producers’ attempts to create language forms that are easily understood by comprehenders. 3 Language perceivers implicitly learn the statistical regularities in their linguistic input, and they use this prior experience to guide comprehension of subsequent language. In particular, they learn to predict the sequential structure of linguistic signals, based on the statistics of previously-encountered input. Thus key aspects of comprehension behavior are tied to lexico-syntactic statistics in the language, which in turn derive from utterance planning biases promoting production of comparatively easy utterance forms over more difficult ones. This approach contrasts with classic theories in which comprehension behaviors are attributed to innate design features of the language comprehension system and associated working memory. The PDC instead links basic features of comprehension to a different source: production processes that shape

Imitative Production of Regular Past Tense -Ed by English-Speaking Children with Specific Language Impairment

Science.gov (United States)

Dalal, Rinky Harish; Loeb, Diane Frome

2005-01-01

Background: Language intervention procedures often involve the speech-language pathologist highlighting or making more salient forms that are problematic for the child with a language impairment. According to limited processing accounts of specific language impairment (SLI), one way to increase the saliency of a form is to manipulate its sentence…

Investigating Tree Thinking & Ancestry with Cladograms

Science.gov (United States)

Davenport, K. D.; Milks, Kirstin Jane; Van Tassell, Rebecca

2015-01-01

Interpreting cladograms is a key skill for biological literacy. In this lesson, students interpret cladograms based on familial relationships and language relationships to build their understanding of tree thinking and to construct a definition of "common ancestor." These skills can then be applied to a true biological cladogram.

On Tree Pattern Matching by Pushdown Automata

Directory of Open Access Journals (Sweden)

T. Flouri

2009-01-01

Full Text Available Tree pattern matching is an important operation in Computer Science on which a number of tasks such as mechanical theorem proving, term-rewriting, symbolic computation and non-procedural programming languages are based on. Work has begun on a systematic approach to the construction of tree pattern matchers by deterministic pushdown automata which read subject trees in prefix notation. The method is analogous to the construction of string pattern matchers: for given patterns, a non-deterministic pushdown automaton is created and then it is determinised. In this first paper, we present the proposed non-deterministic pushdown automaton which will serve as a basis for the determinisation process, and prove its correctness. 

Workflow Fault Tree Generation Through Model Checking

DEFF Research Database (Denmark)

Herbert, Luke Thomas; Sharp, Robin

2014-01-01

We present a framework for the automated generation of fault trees from models of realworld process workflows, expressed in a formalised subset of the popular Business Process Modelling and Notation (BPMN) language. To capture uncertainty and unreliability in workflows, we extend this formalism...

Applying 4-regular grid structures in large-scale access networks

DEFF Research Database (Denmark)

Pedersen, Jens Myrup; Knudsen, Thomas P.; Patel, Ahmed

2006-01-01

4-Regular grid structures have been used in multiprocessor systems for decades due to a number of nice properties with regard to routing, protection, and restoration, together with a straightforward planar layout. These qualities are to an increasing extent demanded also in largescale access...... networks, but concerning protection and restoration these demands have been met only to a limited extent by the commonly used ring and tree structures. To deal with the fact that classical 4-regular grid structures are not directly applicable in such networks, this paper proposes a number of extensions...... concerning restoration, protection, scalability, embeddability, flexibility, and cost. The extensions are presented as a tool case, which can be used for implementing semi-automatic and in the longer term full automatic network planning tools....

Image reconstruction of fluorescent molecular tomography based on the tree structured Schur complement decomposition

Directory of Open Access Journals (Sweden)

Wang Jiajun

2010-05-01

Full Text Available Abstract Background The inverse problem of fluorescent molecular tomography (FMT often involves complex large-scale matrix operations, which may lead to unacceptable computational errors and complexity. In this research, a tree structured Schur complement decomposition strategy is proposed to accelerate the reconstruction process and reduce the computational complexity. Additionally, an adaptive regularization scheme is developed to improve the ill-posedness of the inverse problem. Methods The global system is decomposed level by level with the Schur complement system along two paths in the tree structure. The resultant subsystems are solved in combination with the biconjugate gradient method. The mesh for the inverse problem is generated incorporating the prior information. During the reconstruction, the regularization parameters are adaptive not only to the spatial variations but also to the variations of the objective function to tackle the ill-posed nature of the inverse problem. Results Simulation results demonstrate that the strategy of the tree structured Schur complement decomposition obviously outperforms the previous methods, such as the conventional Conjugate-Gradient (CG and the Schur CG methods, in both reconstruction accuracy and speed. As compared with the Tikhonov regularization method, the adaptive regularization scheme can significantly improve ill-posedness of the inverse problem. Conclusions The methods proposed in this paper can significantly improve the reconstructed image quality of FMT and accelerate the reconstruction process.

Static Typing for Object-Oriented Programming

DEFF Research Database (Denmark)

Schwartzbach, Michael Ignatieff; Palsberg, Jens

1994-01-01

We develop a theory of statically typed object-oriented languages. It represents classes as labeled, regular trees, types as finit sets of classes , and sub-classing as a partial order on trees. We show that our sub-classing order strictly generalizes inheritance, and that a novel genericity mech...

The Varieties of Programming Language Semantics (and Their Uses)

DEFF Research Database (Denmark)

Mosses, Peter David

2001-01-01

; and regular expressions are extensively used for searching and transforming text. In contrast, formal semantic descriptions are widely regarded as being of interest only to theoreticians. This paper surveys the main frameworks available for describing the dynamic semantics of programming languages......Formal descriptions of syntax are quite popular: regular and context-free grammars have become accepted as useful for documenting the syntax of programming languages, as well as for generating efficient parsers; attribute grammars allow parsing to be linked with typechecking and code generation...

Remedial early numeracy education: can children identified as having a language deficiency benefit?

Science.gov (United States)

Van Luit, Johannes E H; Toll, Sylke W M

2015-01-01

Growing attention has been paid to the possibility of supporting early numeracy in at-risk kindergartners. Furthermore, it is assumed that language proficiency is an important prerequisite in early maths skills. To examine whether remedial early numeracy education in kindergarten, which has been proven to be effective in general, is also beneficial for children with a language deficiency. Based on intensive selection, four different conditions were included: two groups received remedial education, one consisting of children being language proficient (N = 86) and one of children with a language deficiency (N = 26), and two groups followed the regular curriculum, one consisting of children being language proficient (N = 51) and one of children with a language deficiency (N = 24). Remedial education was for 1.5 school years (90 sessions, 30 min per session, twice per week), following the programme 'The Road to Mathematics'. During this period, the children receiving remedial education did not attend the regular maths lessons in the classroom, which were offered for at least 1 h per week. Effects were assessed for early numeracy and mathematical skills (operationalized as basic calculation fluency) in kindergarten and first grade. Three analyses of covariance (ANCOVAs) revealed that, when accounting for achievement at pre-test, children with a language deficiency who received remedial numeracy education performed better on early numeracy skills in kindergarten and first grade than kindergartners with a language deficiency that followed the regular curriculum. Furthermore, they were able to catch up with their language proficient peers in early numeracy. However, children with a language deficiency who received remedial numeracy education did not differ from children who followed the regular curriculum on mathematical skills, suggesting that benefits for numeracy did not generalize to more advanced skills of addition and subtraction. Since, in general, it can be

The Linguistic Interpretation for Language Union – Language Family

Directory of Open Access Journals (Sweden)

E.A. Balalykina

2016-10-01

Full Text Available The paper is dedicated to the problem of determination of the essence of language union and language family in modern linguistics, which is considered important, because these terms are often used as absolute synonyms. The research is relevant due to the need to distinguish the features of languages that are inherited during their functioning within either language union or language family when these languages are compared. The research has been carried out in order to present the historical background of the problem and to justify the need for differentiation of language facts that allow relating languages to particular language union or language family. In order to fulfill the goal of this work, descriptive, comparative, and historical methods have been used. A range of examples has been provided to prove that some languages, mainly Slavonic and Baltic languages, form a language family rather than a language union, because a whole number of features in their systems are the heritage of their common Indo-European past. Firstly, it is necessary to take into account changes having either common or different nature in the system of particular languages; secondly, one must have a precise idea of what features in the phonetic and morphological systems of compared languages allow to relate them to language union or language family; thirdly, it must be determined whether the changes in compared languages are regular or of any other type. On the basis of the obtained results, the following conclusions have been drawn: language union and language family are two different types of relations between modern languages; they allow identifying both degree of similarity of these languages and causes of differences between them. It is most important that one should distinguish and describe the specific features of two basic groups of languages forming language family or language union. The results obtained during the analysis are very important for linguistics

Geometry of convex polygons and locally minimal binary trees spanning these polygons

International Nuclear Information System (INIS)

Ivanov, A O; Tuzhilin, A A

1999-01-01

In previous works the authors have obtained an effective classification of planar locally minimal binary trees with convex boundaries. The main aim of the present paper is to find more subtle restrictions on the possible structure of such trees in terms of the geometry of the given boundary set. Special attention is given to the case of quasiregular boundaries (that is, boundaries that are sufficiently close to regular ones in a certain sense). In particular, a series of quasiregular boundaries that cannot be spanned by a locally minimal binary tree is constructed

Detecting Structural Metadata with Decision Trees and Transformation-Based Learning

National Research Council Canada - National Science Library

Kim, Joungbum; Schwarm, Sarah E; Ostendorf, Mari

2004-01-01

.... Specifically, combinations of decision trees and language models are used to predict sentence ends and interruption points and given these events transformation based learning is used to detect edit...

Right-Linear Languages Generated in Systems of Knowledge Representation based on LSG

Directory of Open Access Journals (Sweden)

Daniela Danciulescu

2017-04-01

Full Text Available In Tudor (Preda (2010 a method for formal languages generation based on labeled stratified graph representations is sketched. The author proves that the considered method can generate regular languages and context-sensitive languages by considering an exemplification of the proposed method for a particular regular language and another one for a particular contextsensitive language. At the end of the study, the author highlights some open problems for future research among which we remind: (1 The study of the language families that can be generated by means of these structures; (2 The study of the infiniteness of the languages that can be represented in stratified graphs. In this paper, we extend the method presented in Tudor (Preda(2010, by considering the stratified graph formalism in a system of knowledge representation and reasoning. More precisely, we propose a method that can be applied for generating any Right Linear Language construction. Our method is proved and exemplified in several cases.

Categories for Observing Language Arts Instruction (COLAI).

Science.gov (United States)

Benterud, Julianna G.

Designed to study individual use of time spent in reading during regularly scheduled language arts instruction in a natural classroom setting, this coding sheet consists of nine categories: (1) engagement, (2) area of language arts, (3) instructional setting, (4) partner (teacher or pupil(s)), (5) source of content, (6) type of unit, (7) assigned…

Universal artifacts affect the branching of phylogenetic trees, not universal scaling laws.

Science.gov (United States)

Altaba, Cristian R

2009-01-01

The superficial resemblance of phylogenetic trees to other branching structures allows searching for macroevolutionary patterns. However, such trees are just statistical inferences of particular historical events. Recent meta-analyses report finding regularities in the branching pattern of phylogenetic trees. But is this supported by evidence, or are such regularities just methodological artifacts? If so, is there any signal in a phylogeny? In order to evaluate the impact of polytomies and imbalance on tree shape, the distribution of all binary and polytomic trees of up to 7 taxa was assessed in tree-shape space. The relationship between the proportion of outgroups and the amount of imbalance introduced with them was assessed applying four different tree-building methods to 100 combinations from a set of 10 ingroup and 9 outgroup species, and performing covariance analyses. The relevance of this analysis was explored taking 61 published phylogenies, based on nucleic acid sequences and involving various taxa, taxonomic levels, and tree-building methods. All methods of phylogenetic inference are quite sensitive to the artifacts introduced by outgroups. However, published phylogenies appear to be subject to a rather effective, albeit rather intuitive control against such artifacts. The data and methods used to build phylogenetic trees are varied, so any meta-analysis is subject to pitfalls due to their uneven intrinsic merits, which translate into artifacts in tree shape. The binary branching pattern is an imposition of methods, and seldom reflects true relationships in intraspecific analyses, yielding artifactual polytomies in short trees. Above the species level, the departure of real trees from simplistic random models is caused at least by two natural factors--uneven speciation and extinction rates; and artifacts such as choice of taxa included in the analysis, and imbalance introduced by outgroups and basal paraphyletic taxa. This artifactual imbalance accounts

A computer code for fault tree calculations: PATREC

International Nuclear Information System (INIS)

Blin, A.; Carnino, A.; Koen, B.V.; Duchemin, B.; Lanore, J.M.; Kalli, H.

1978-01-01

A computer code for evaluating the reliability of complex system by fault tree is described in this paper. It uses pattern recognition approach and programming techniques from IBM PL1 language. It can take account of many of the present day problems: multi-dependencies treatment, dispersion in the reliability data parameters, influence of common mode failures. The code is running currently since two years now in Commissariat a l'Energie Atomique Saclay center and shall be used in a future extension for automatic fault trees construction

The Trees that surround us

Science.gov (United States)

Costa, M. E. G.; Rodrigues, M. A. S.

2012-04-01

In our school the activities linked with sciences are developed in a partnership with other school subjects. Interdisciplinary projects are always valued from beginning to end of a project. It is common for teachers of different areas to work together in a Science project. Research of English written articles is very important not only for the development of our students' scientific literacy but also as a way of widening knowledge and a view on different perspectives of life instead of being limited to research of any articles in Portuguese language. In this study we are going to collect data about the predominant tree species in the region, especially the invasive trees from the acacia species, the native tree species and the commercial species. We are going to study the reasons for the appearance of each species and draw a chart of soil occupation in the council. This chart will also allow the study of the distribution and use of land for each tree species. This research work is the first stage for a contribution to warn the town council of the dangers of the invasive species to the future economy of the council.

Detecting violations of temporal regularities in waking and sleeping two-month-old infants

NARCIS (Netherlands)

Otte, R.A.; Winkler, I.; Braeken, M.A.K.A.; Stekelenburg, J.J.; van der Stelt, O.; Van den Bergh, B.R.H.

2013-01-01

Correctly processing rapid sequences of sounds is essential for developmental milestones, such as language acquisition. We investigated the sensitivity of two-month-old infants to violations of a temporal regularity, by recording event-related brain potentials (ERPs) in an auditory oddball paradigm

Modular representation and analysis of fault trees

Energy Technology Data Exchange (ETDEWEB)

Olmos, J; Wolf, L [Massachusetts Inst. of Tech., Cambridge (USA). Dept. of Nuclear Engineering

1978-08-01

An analytical method to describe fault tree diagrams in terms of their modular compositions is developed. Fault tree structures are characterized by recursively relating the top tree event to all its basic component inputs through a set of equations defining each of the modulus for the fault tree. It is shown that such a modular description is an extremely valuable tool for making a quantitative analysis of fault trees. The modularization methodology has been implemented into the PL-MOD computer code, written in PL/1 language, which is capable of modularizing fault trees containing replicated components and replicated modular gates. PL-MOD in addition can handle mutually exclusive inputs and explicit higher order symmetric (k-out-of-n) gates. The step-by-step modularization of fault trees performed by PL-MOD is demonstrated and it is shown how this procedure is only made possible through an extensive use of the list processing tools available in PL/1. A number of nuclear reactor safety system fault trees were analyzed. PL-MOD performed the modularization and evaluation of the modular occurrence probabilities and Vesely-Fussell importance measures for these systems very efficiently. In particular its execution time for the modularization of a PWR High Pressure Injection System reduced fault tree was 25 times faster than that necessary to generate its equivalent minimal cut-set description using MOCUS, a code considered to be fast by present standards.

Diverse Regular Employees and Non-regular Employment (Japanese)

OpenAIRE

MORISHIMA Motohiro

2011-01-01

Currently there are high expectations for the introduction of policies related to diverse regular employees. These policies are a response to the problem of disparities between regular and non-regular employees (part-time, temporary, contract and other non-regular employees) and will make it more likely that workers can balance work and their private lives while companies benefit from the advantages of regular employment. In this paper, I look at two issues that underlie this discussion. The ...

Strategies for regular segmented reductions on GPU

DEFF Research Database (Denmark)

Larsen, Rasmus Wriedt; Henriksen, Troels

2017-01-01

We present and evaluate an implementation technique for regular segmented reductions on GPUs. Existing techniques tend to be either consistent in performance but relatively inefficient in absolute terms, or optimised for specific workloads and thereby exhibiting bad performance for certain input...... is in the context of the Futhark compiler, the implementation technique is applicable to any library or language that has a need for segmented reductions. We evaluate the technique on four microbenchmarks, two of which we also compare to implementations in the CUB library for GPU programming, as well as on two...

Infant Statistical-Learning Ability Is Related to Real-Time Language Processing

Science.gov (United States)

Lany, Jill; Shoaib, Amber; Thompson, Abbie; Estes, Katharine Graf

2018-01-01

Infants are adept at learning statistical regularities in artificial language materials, suggesting that the ability to learn statistical structure may support language development. Indeed, infants who perform better on statistical learning tasks tend to be more advanced in parental reports of infants' language skills. Work with adults suggests…

Regular paths in SparQL: querying the NCI Thesaurus.

Science.gov (United States)

Detwiler, Landon T; Suciu, Dan; Brinkley, James F

2008-11-06

OWL, the Web Ontology Language, provides syntax and semantics for representing knowledge for the semantic web. Many of the constructs of OWL have a basis in the field of description logics. While the formal underpinnings of description logics have lead to a highly computable language, it has come at a cognitive cost. OWL ontologies are often unintuitive to readers lacking a strong logic background. In this work we describe GLEEN, a regular path expression library, which extends the RDF query language SparQL to support complex path expressions over OWL and other RDF-based ontologies. We illustrate the utility of GLEEN by showing how it can be used in a query-based approach to defining simpler, more intuitive views of OWL ontologies. In particular we show how relatively simple GLEEN-enhanced SparQL queries can create views of the OWL version of the NCI Thesaurus that match the views generated by the web-based NCI browser.

Sequence Algebra, Sequence Decision Diagrams and Dynamic Fault Trees

International Nuclear Information System (INIS)

Rauzy, Antoine B.

2011-01-01

A large attention has been focused on the Dynamic Fault Trees in the past few years. By adding new gates to static (regular) Fault Trees, Dynamic Fault Trees aim to take into account dependencies among events. Merle et al. proposed recently an algebraic framework to give a formal interpretation to these gates. In this article, we extend Merle et al.'s work by adopting a slightly different perspective. We introduce Sequence Algebras that can be seen as Algebras of Basic Events, representing failures of non-repairable components. We show how to interpret Dynamic Fault Trees within this framework. Finally, we propose a new data structure to encode sets of sequences of Basic Events: Sequence Decision Diagrams. Sequence Decision Diagrams are very much inspired from Minato's Zero-Suppressed Binary Decision Diagrams. We show that all operations of Sequence Algebras can be performed on this data structure.

Inducing Head-Driven PCFGs with Latent Heads: Refining a Tree-bank Grammar for Parsing

NARCIS (Netherlands)

Prescher, D.; Gama, J.; Camacho, R.; Brazdil, P.; Jorge, A.; Torgo, L.

2005-01-01

Although state-of-the-art parsers for natural language are lexicalized, it was recently shown that an accurate unlexicalized parser for the Penn tree-bank can be simply read off a manually refined tree-bank. While lexicalized parsers often suffer from sparse data, manual mark-up is costly and

Modular Domain-Specific Language Components in Scala

DEFF Research Database (Denmark)

Hofer, Christian; Ostermann, Klaus

2010-01-01

Programs in domain-­specific embedded languages (DSELs) can be represented in the host language in different ways, for instance implicitly as libraries, or explicitly in the form of abstract syntax trees. Each of these representations has its own strengths and weaknesses. The implicit approach ha...... or transformation. We propose a new design for implementing DSELs in Scala which makes it easy to use different program representations at the same time. It enables the DSL implementor to define modular language components and to compose transformations and interpretations for them....

Agroforestry and Management of Trees in Bunya County, Mayuge District, Uganda

Directory of Open Access Journals (Sweden)

Monica Kyarikunda

2017-01-01

Full Text Available Woody plant resources continue to disappear in anthropogenic landscapes in Uganda. To slow down further loss of these resources requires the collaboration of farmers in tree planting in agroforestry systems. Tree planting interventions with the collaboration of farmers require a good understanding of tree management practices as well as trees that best satisfy farmers’ needs. We carried out this research to determine (1 the most preferred tree species and reasons why they are preferred, (2 the species conservation statuses, and (3 existing tree management practices and challenges to tree planting. Fourteen priority species valued because they yield edible fruits and timber have been prioritised in this study. Farmers are interested in managing trees but are constrained by many factors, key among which is scarcity of land and financial capital to manage tree planting. Trees are managed in crop fields and around the homestead. From farmers’ reports, the highly valued species are increasing in the landscape. In conclusion, the potential to manage trees in agroforestry systems exists but is hampered by many challenges. Secondly, the liking of trees that supply edible fruits seems to support the welfare maximisation theory which ideally states that rural people manage trees with the aim of having regular access to products that satisfy their household needs and not for income generation.

Multiview vector-valued manifold regularization for multilabel image classification.

Science.gov (United States)

Luo, Yong; Tao, Dacheng; Xu, Chang; Xu, Chao; Liu, Hong; Wen, Yonggang

2013-05-01

In computer vision, image datasets used for classification are naturally associated with multiple labels and comprised of multiple views, because each image may contain several objects (e.g., pedestrian, bicycle, and tree) and is properly characterized by multiple visual features (e.g., color, texture, and shape). Currently, available tools ignore either the label relationship or the view complementarily. Motivated by the success of the vector-valued function that constructs matrix-valued kernels to explore the multilabel structure in the output space, we introduce multiview vector-valued manifold regularization (MV(3)MR) to integrate multiple features. MV(3)MR exploits the complementary property of different features and discovers the intrinsic local geometry of the compact support shared by different features under the theme of manifold regularization. We conduct extensive experiments on two challenging, but popular, datasets, PASCAL VOC' 07 and MIR Flickr, and validate the effectiveness of the proposed MV(3)MR for image classification.

Maintenance and conservation of historical pomegranate tree in the garden of Thessaloniki Ataturk’s House

Directory of Open Access Journals (Sweden)

Süleyman Çoban

2016-01-01

Full Text Available Historical pomegranate tree in the garden of Atatürk’s House in Thessaloniki storied that planted by the father of Ataturk, Ali Rıza Efendi, has been one of the most attractive points at the museum. However, in addition to the problems of natural ageing period, constructional works in the garden during restoration of the museum and unappropriate prunings caused serious health problems on the tree. For this reason, in order to cease or delay tree collapsing period and prolong survival of the tree, regular maintenance treatments have to be conducted. In this study, technical information has been given regarding the precautions of specific tree maintenance and conservation works, which are normally applied to long lived monumental trees in the literature, on the pomegranate tree. However, these precautions have not been previously applied on such a tree, particularly on the pomegranate tree.

Programming-Languages as a Conceptual Framework for Teaching Mathematics

Science.gov (United States)

Feurzeig, Wallace; Papert, Seymour A.

2011-01-01

Formal mathematical methods remain, for most high school students, mysterious, artificial and not a part of their regular intuitive thinking. The authors develop some themes that could lead to a radically new approach. According to this thesis, the teaching of programming languages as a regular part of academic progress can contribute effectively…

PHONOLOGICAL AND LEXICAL VARIETIES OF LIO LANGUAGE IN FLORES, EAST NUSA TENGGARA: A STUDY OF GEOGRAPHICAL DIALECT

Directory of Open Access Journals (Sweden)

Ni Made Suryati

2013-02-01

Full Text Available This study aims at describing and analyzing phonological and lexical varieties of Leo language in the regions where it is spoken, classifying its dialects and subdialects, and identifying the identity of its relation to Ende language. The theories used in this study are the theory of traditional dialectology and the theory of generative. The data used were obtained from the primary and secondary sources. The observation method and the participative method were applied to collect the data needed. The data were analyzed using descriptive-comparative method which was continued with dialectometric and mapping method. The segments vowels, consonants and syllables grouped under regular and sporadic varieties. The regular vowel variety and the regular syllable variety were found just one and on the other hand 20 regular consonant varieties.   The vowel sporadic varieties found 37, the consonant sporadic varieties found 176, and the syllable sporadic varieties found 17. Lexically, Lio Language highly varied, indicated by the description of each gloss having more than 10 lexical varieties. Based on the isogloss bundles composed and based on the calculation obtained from both the lexical dialectometry and lexical dialectometry for the TPs which were close to each other, and on the permutation, DBL could be grouped into seven. (1 East Lio Language Dialect; (2 Central Lio Language Dialect; (3 Western Lio Language Dialect; (4 Ende Leo Language Dialect; (5 Welamosa Dialect; (6 Wololele A Dialect; and (7 Konara Dialect. From such groupings of dialects and sub dialects, it could be identified that Lio Language  and Ende Language were different dialects.

Language and Cognition

DEFF Research Database (Denmark)

Fusaroli, Riccardo

The Ph.D dissertation “Language and Cognition” addresses the way social uses of language – e.g. on the media, or in conversation – shape the way we think and act. Cognitive sciences have started focusing on embodiment and joint cognition – the way in which cognitive processes are deeply shaped...... interacting, without making place for and relying upon the external world, for its structures, its resistances and its dynamics. Cognition is thus a relational process aimed at - perceiving the regularities and affordances (possibilities for further action, perception and, more generally, cognition...... to linguistic use, but also the effects of these processes on the coordination of other cognitive processes. It involved conceptual and experimental methodologies. Chapter 2 The cognitive study of metaphors largely focuses on showing how abstract thought and language uses are strongly shaped by embodied...

Three-dimensional segmentation and skeletonization to build an airway tree data structure for small animals

International Nuclear Information System (INIS)

Chaturvedi, Ashutosh; Lee, Zhenghong

2005-01-01

Quantitative analysis of intrathoracic airway tree geometry is important for objective evaluation of bronchial tree structure and function. Currently, there is more human data than small animal data on airway morphometry. In this study, we implemented a semi-automatic approach to quantitatively describe airway tree geometry by using high-resolution computed tomography (CT) images to build a tree data structure for small animals such as rats and mice. Silicon lung casts of the excised lungs from a canine and a mouse were used for micro-CT imaging of the airway trees. The programming language IDL was used to implement a 3D region-growing threshold algorithm for segmenting out the airway lung volume from the CT data. Subsequently, a fully-parallel 3D thinning algorithm was implemented in order to complete the skeletonization of the segmented airways. A tree data structure was then created and saved by parsing through the skeletonized volume using the Python programming language. Pertinent information such as the length of all airway segments was stored in the data structure. This approach was shown to be accurate and efficient for up to six generations for the canine lung cast and ten generations for the mouse lung cast

Language contact phenomena in the language use of speakers of German descent and the significance of their language attitudes

Directory of Open Access Journals (Sweden)

Ries, Veronika

2014-03-01

Full Text Available Within the scope of my investigation on language use and language attitudes of People of German Descent from the USSR, I find almost regular different language contact phenomena, such as viel bliny habn=wir gbackt (engl.: 'we cooked lots of pancakes' (cf. Ries 2011. The aim of analysis is to examine both language use with regard to different forms of language contact and the language attitudes of the observed speakers. To be able to analyse both of these aspects and synthesize them, different types of data are required. The research is based on the following two data types: everyday conversations and interviews. In addition, the individual speakers' biography is a key part of the analysis, because it allows one to draw conclusions about language attitudes and use. This qualitative research is based on morpho-syntactic and interactional linguistic analysis of authentic spoken data. The data arise from a corpus compiled and edited by myself. My being a member of the examined group allowed me to build up an authentic corpus. The natural language use is analysed from the perspective of different language contact phenomena and potential functions of language alternations. One central issue is: How do speakers use the languages available to them, German and Russian? Structural characteristics such as code switching and discursive motives for these phenomena are discussed as results, together with the socio-cultural background of the individual speaker. Within the scope of this article I present exemplarily the data and results of one speaker.

Algorithms and programs for consequence diagram and fault tree construction

International Nuclear Information System (INIS)

Hollo, E.; Taylor, J.R.

1976-12-01

A presentation of algorithms and programs for consequence diagram and sequential fault tree construction that are intended for reliability and disturbance analysis of large systems. The system to be analyzed must be given as a block diagram formed by mini fault trees of individual system components. The programs were written in LISP programming language and run on a PDP8 computer with 8k words of storage. A description is given of the methods used and of the program construction and working. (author)

Second Language Experience Facilitates Statistical Learning of Novel Linguistic Materials.

Science.gov (United States)

Potter, Christine E; Wang, Tianlin; Saffran, Jenny R

2017-04-01

Recent research has begun to explore individual differences in statistical learning, and how those differences may be related to other cognitive abilities, particularly their effects on language learning. In this research, we explored a different type of relationship between language learning and statistical learning: the possibility that learning a new language may also influence statistical learning by changing the regularities to which learners are sensitive. We tested two groups of participants, Mandarin Learners and Naïve Controls, at two time points, 6 months apart. At each time point, participants performed two different statistical learning tasks: an artificial tonal language statistical learning task and a visual statistical learning task. Only the Mandarin-learning group showed significant improvement on the linguistic task, whereas both groups improved equally on the visual task. These results support the view that there are multiple influences on statistical learning. Domain-relevant experiences may affect the regularities that learners can discover when presented with novel stimuli. Copyright © 2016 Cognitive Science Society, Inc.

Coordinate-invariant regularization

International Nuclear Information System (INIS)

Halpern, M.B.

1987-01-01

A general phase-space framework for coordinate-invariant regularization is given. The development is geometric, with all regularization contained in regularized DeWitt Superstructures on field deformations. Parallel development of invariant coordinate-space regularization is obtained by regularized functional integration of the momenta. As representative examples of the general formulation, the regularized general non-linear sigma model and regularized quantum gravity are discussed. copyright 1987 Academic Press, Inc

Processing SPARQL queries with regular expressions in RDF databases

Science.gov (United States)

2011-01-01

Background As the Resource Description Framework (RDF) data model is widely used for modeling and sharing a lot of online bioinformatics resources such as Uniprot (dev.isb-sib.ch/projects/uniprot-rdf) or Bio2RDF (bio2rdf.org), SPARQL - a W3C recommendation query for RDF databases - has become an important query language for querying the bioinformatics knowledge bases. Moreover, due to the diversity of users’ requests for extracting information from the RDF data as well as the lack of users’ knowledge about the exact value of each fact in the RDF databases, it is desirable to use the SPARQL query with regular expression patterns for querying the RDF data. To the best of our knowledge, there is currently no work that efficiently supports regular expression processing in SPARQL over RDF databases. Most of the existing techniques for processing regular expressions are designed for querying a text corpus, or only for supporting the matching over the paths in an RDF graph. Results In this paper, we propose a novel framework for supporting regular expression processing in SPARQL query. Our contributions can be summarized as follows. 1) We propose an efficient framework for processing SPARQL queries with regular expression patterns in RDF databases. 2) We propose a cost model in order to adapt the proposed framework in the existing query optimizers. 3) We build a prototype for the proposed framework in C++ and conduct extensive experiments demonstrating the efficiency and effectiveness of our technique. Conclusions Experiments with a full-blown RDF engine show that our framework outperforms the existing ones by up to two orders of magnitude in processing SPARQL queries with regular expression patterns. PMID:21489225

Processing SPARQL queries with regular expressions in RDF databases.

Science.gov (United States)

Lee, Jinsoo; Pham, Minh-Duc; Lee, Jihwan; Han, Wook-Shin; Cho, Hune; Yu, Hwanjo; Lee, Jeong-Hoon

2011-03-29

As the Resource Description Framework (RDF) data model is widely used for modeling and sharing a lot of online bioinformatics resources such as Uniprot (dev.isb-sib.ch/projects/uniprot-rdf) or Bio2RDF (bio2rdf.org), SPARQL - a W3C recommendation query for RDF databases - has become an important query language for querying the bioinformatics knowledge bases. Moreover, due to the diversity of users' requests for extracting information from the RDF data as well as the lack of users' knowledge about the exact value of each fact in the RDF databases, it is desirable to use the SPARQL query with regular expression patterns for querying the RDF data. To the best of our knowledge, there is currently no work that efficiently supports regular expression processing in SPARQL over RDF databases. Most of the existing techniques for processing regular expressions are designed for querying a text corpus, or only for supporting the matching over the paths in an RDF graph. In this paper, we propose a novel framework for supporting regular expression processing in SPARQL query. Our contributions can be summarized as follows. 1) We propose an efficient framework for processing SPARQL queries with regular expression patterns in RDF databases. 2) We propose a cost model in order to adapt the proposed framework in the existing query optimizers. 3) We build a prototype for the proposed framework in C++ and conduct extensive experiments demonstrating the efficiency and effectiveness of our technique. Experiments with a full-blown RDF engine show that our framework outperforms the existing ones by up to two orders of magnitude in processing SPARQL queries with regular expression patterns.

Formal models, languages and applications

CERN Document Server

Rangarajan, K; Mukund, M

2006-01-01

A collection of articles by leading experts in theoretical computer science, this volume commemorates the 75th birthday of Professor Rani Siromoney, one of the pioneers in the field in India. The articles span the vast range of areas that Professor Siromoney has worked in or influenced, including grammar systems, picture languages and new models of computation. Sample Chapter(s). Chapter 1: Finite Array Automata and Regular Array Grammars (150 KB). Contents: Finite Array Automata and Regular Array Grammars (A Atanasiu et al.); Hexagonal Contextual Array P Systems (K S Dersanambika et al.); Con

PHONOLOGICAL AND LEXICAL VARIETIES OF LIO LANGUAGE IN FLORES, EAST NUSA TENGGARA: A STUDY OF GEOGRAPHICAL DIALECT By

Directory of Open Access Journals (Sweden)

suryati -

2013-02-01

Full Text Available This study aims at describing and analyzing phonological and lexical varieties of Leo language in the regions where it is spoken, classifying its dialects and subdialects, and identifying the identity of its relation to Ende language. The theories used in this study are the theory of traditional dialectology and the theory of generative. The data used were obtained from the primary and secondary sources. The observation method and the participative method were applied to collect the data needed. The data were analyzed using descriptive-comparative method which was continued with dialectometric and mapping method. The segments vowels, consonants and syllables grouped under regular and sporadic varieties. The regular vowel variety and the regular syllable variety were found just one and on the other hand 20 regular consonant varieties.   The vowel sporadic varieties found 37, the consonant sporadic varieties found 176, and the syllable sporadic varieties found 17. Lexically, Lio Language highly varied, indicated by the description of each gloss having more than 10 lexical varieties. Based on the isogloss bundles composed and based on the calculation obtained from both the lexical dialectometry and lexical dialectometry for the TPs which were close to each other, and on the permutation, DBL could be grouped into seven. (1 East Lio Language Dialect; (2 Central Lio Language Dialect; (3 Western Lio Language Dialect; (4 Ende Leo Language Dialect; (5 Welamosa Dialect; (6 Wololele A Dialect; and (7 Konara Dialect. From such groupings of dialects and sub dialects, it could be identified that Lio Language  and Ende Language were different dialects.

Variation of Zipf's exponent in one hundred live languages: A study of the Holy Bible translations

Science.gov (United States)

Mehri, Ali; Jamaati, Maryam

2017-08-01

Zipf's law, as a power-law regularity, confirms long-range correlations between the elements in natural and artificial systems. In this article, this law is evaluated for one hundred live languages. We calculate Zipf's exponent for translations of the holy Bible to several languages, for this purpose. The results show that, the average of Zipf's exponent in studied texts is slightly above unity. All studied languages in some families have Zipf's exponent lower/higher than unity. It seems that geographical distribution impresses the communication between speakers of different languages in a language family, and affect similarity between their Zipf's exponent. The Bible has unique concept regardless of its language, but the discrepancy in grammatical rules and syntactic regularities in applying stop words to make sentences and imply a certain concept, lead to difference in Zipf's exponent for various languages.

Human language reveals a universal positivity bias.

Science.gov (United States)

Dodds, Peter Sheridan; Clark, Eric M; Desu, Suma; Frank, Morgan R; Reagan, Andrew J; Williams, Jake Ryland; Mitchell, Lewis; Harris, Kameron Decker; Kloumann, Isabel M; Bagrow, James P; Megerdoomian, Karine; McMahon, Matthew T; Tivnan, Brian F; Danforth, Christopher M

2015-02-24

Using human evaluation of 100,000 words spread across 24 corpora in 10 languages diverse in origin and culture, we present evidence of a deep imprint of human sociality in language, observing that (i) the words of natural human language possess a universal positivity bias, (ii) the estimated emotional content of words is consistent between languages under translation, and (iii) this positivity bias is strongly independent of frequency of word use. Alongside these general regularities, we describe interlanguage variations in the emotional spectrum of languages that allow us to rank corpora. We also show how our word evaluations can be used to construct physical-like instruments for both real-time and offline measurement of the emotional content of large-scale texts.

Evaluation of weeds as possible hosts of the potyviruses associated with tree tomato (Solanum betaceum Cav. viroses

Directory of Open Access Journals (Sweden)

Sierra S. Adela

2012-04-01

Full Text Available

language: EN-US; mso-fareast-font-family: Calibri; mso-fareast-theme-font: minor-latin; mso-fareast-language: EN-US; mso-bidi-language: AR-SA;" lang="EN-US">To determine possible weed hosts of potyviruses associated with the disease known as “tree tomato virus disease” in Antioquia department (Colombia, a sampling was conducted to identify weed species commonly found in commercial crops of S. betaceum affected by the virus and the possible presence of the virus in these plants. The encountered weed species were grouped into seven different taxonomic families, within which we evaluated the ten most common species. The selected weeds, three indicator species of the virus and tree tomato plants were grown in a greenhouse and mechanically inoculated with an extract of infected tree tomato tissue. One month after inoculation, the tree tomato plants and Nicotiana tabacum showed symptoms of the disease and were serologically positive, whereas none of the weeds showed symptoms or were positive for potyviruses serology. In order to confirm that the detection of the virus was not caused by low viral titers that did not reach the minimum detection level of the test used, the tomato tree plants were reinoculated with an extract of sap from the studied weeds and potyviruses was not detected in any of the tested weeds and therefore cannot be considered, with the utilized methodology, as hosts for the potyviruses affecting tree tomato plants.

Transitivizing-detransitivizing typology and language family history

Directory of Open Access Journals (Sweden)

Grünthal Riho

2016-12-01

Full Text Available The transitivizing/detransitivizing typology of Nichols et al. 2004 also proves useful to historical linguistics. We focus on language families of northern Eurasia, chiefly the three oldest families (Indo-European, Uralic, Nakh-Daghestanian, some of their daughter branches aged about 2000-3000 years, and one younger family for which we have data on enough daughters to support a family phylogeny (Tungusic. We use the 18-pair wordlist of Nichols et al. 2004, which typologizes each pair of verbs depending on which of the two is derived. We make some improvements in the coding of grammatical properties and the typologization of pairs. NeighborNet trees based on this information reveal family-wide linguistic geography and areal trends. Adding minimal information about the cognacy or non-cognacy of the roots of the wordlist items produces Neighbor- Net trees which approximate well the known phylogeny of the family. Thus very small closed data sets, collected originally for typology, yield rich information about language family history - strikingly, a mere 18 verbs (9 pairs, coded for morphological type and cognacy, yield a very good genealogical tree - while historical methods have also improved the typology.

An interactive programme for weighted Steiner trees

International Nuclear Information System (INIS)

Do Nascimento, Marcelo Zanchetta; Batista, Valério Ramos; Coimbra, Wendhel Raffa

2015-01-01

We introduce a fully written programmed code with a supervised method for generating weighted Steiner trees. Our choice of the programming language, and the use of well- known theorems from Geometry and Complex Analysis, allowed this method to be implemented with only 764 lines of effective source code. This eases the understanding and the handling of this beta version for future developments

An interactive programme for weighted Steiner trees

Science.gov (United States)

Zanchetta do Nascimento, Marcelo; Ramos Batista, Valério; Raffa Coimbra, Wendhel

2015-01-01

We introduce a fully written programmed code with a supervised method for generating weighted Steiner trees. Our choice of the programming language, and the use of well- known theorems from Geometry and Complex Analysis, allowed this method to be implemented with only 764 lines of effective source code. This eases the understanding and the handling of this beta version for future developments.

Hierarchical data structures for graphics program languages

International Nuclear Information System (INIS)

Gonauser, M.; Schinner, P.; Weiss, J.

1978-01-01

Graphic data processing with a computer makes exacting demands on the interactive capability of the program language and the management of the graphic data. A description of the structure of a graphics program language which has been shown by initial practical experiments to possess a particularly favorable interactive capability is followed by the evaluation of various data structures (list, tree, ring) with respect to their interactive capability in processing graphics. A practical structure is proposed. (orig.) [de

Shade tree spatial structure and pod production explain frosty pod rot intensity in cacao agroforests, Costa Rica.

Science.gov (United States)

Gidoin, Cynthia; Avelino, Jacques; Deheuvels, Olivier; Cilas, Christian; Bieng, Marie Ange Ngo

2014-03-01

Vegetation composition and plant spatial structure affect disease intensity through resource and microclimatic variation effects. The aim of this study was to evaluate the independent effect and relative importance of host composition and plant spatial structure variables in explaining disease intensity at the plot scale. For that purpose, frosty pod rot intensity, a disease caused by Moniliophthora roreri on cacao pods, was monitored in 36 cacao agroforests in Costa Rica in order to assess the vegetation composition and spatial structure variables conducive to the disease. Hierarchical partitioning was used to identify the most causal factors. Firstly, pod production, cacao tree density and shade tree spatial structure had significant independent effects on disease intensity. In our case study, the amount of susceptible tissue was the most relevant host composition variable for explaining disease intensity by resource dilution. Indeed, cacao tree density probably affected disease intensity more by the creation of self-shading rather than by host dilution. Lastly, only regularly distributed forest trees, and not aggregated or randomly distributed forest trees, reduced disease intensity in comparison to plots with a low forest tree density. A regular spatial structure is probably crucial to the creation of moderate and uniform shade as recommended for frosty pod rot management. As pod production is an important service expected from these agroforests, shade tree spatial structure may be a lever for integrated management of frosty pod rot in cacao agroforests.

AFTC Code for Automatic Fault Tree Construction: Users Manual

International Nuclear Information System (INIS)

Gopika Vinod; Saraf, R.K.; Babar, A.K.

1999-04-01

Fault Trees perform a predominant role in reliability and safety analysis of system. Manual construction of fault tree is a very time consuming task and moreover, it won't give a formalized result, since it relies highly on analysts experience and heuristics. This necessitates a computerised fault tree construction, which is still attracting interest of reliability analysts. AFTC software is a user friendly software model for constructing fault trees based on decision tables. Software is equipped with libraries of decision tables for components commonly used in various Nuclear Power Plant (NPP) systems. User is expected to make a nodal diagram of the system, for which fault tree is to be constructed, from the flow sheets available. The text nodal diagram goes as the sole input defining the system flow chart. AFTC software is a rule based expert system which draws the fault tree from the system flow chart and component decision tables. AFTC software gives fault tree in both text and graphic format. Help is provided as how to enter system flow chart and component decision tables. The software is developed in 'C' language. Software is verified with simplified version of the fire water system of an Indian PHWR. Code conversion will be undertaken to create a window based version. (author)

Selection of regularization parameter for l1-regularized damage detection

Science.gov (United States)

Hou, Rongrong; Xia, Yong; Bao, Yuequan; Zhou, Xiaoqing

2018-06-01

The l1 regularization technique has been developed for structural health monitoring and damage detection through employing the sparsity condition of structural damage. The regularization parameter, which controls the trade-off between data fidelity and solution size of the regularization problem, exerts a crucial effect on the solution. However, the l1 regularization problem has no closed-form solution, and the regularization parameter is usually selected by experience. This study proposes two strategies of selecting the regularization parameter for the l1-regularized damage detection problem. The first method utilizes the residual and solution norms of the optimization problem and ensures that they are both small. The other method is based on the discrepancy principle, which requires that the variance of the discrepancy between the calculated and measured responses is close to the variance of the measurement noise. The two methods are applied to a cantilever beam and a three-story frame. A range of the regularization parameter, rather than one single value, can be determined. When the regularization parameter in this range is selected, the damage can be accurately identified even for multiple damage scenarios. This range also indicates the sensitivity degree of the damage identification problem to the regularization parameter.

Two-pass greedy regular expression parsing

DEFF Research Database (Denmark)

Grathwohl, Niels Bjørn Bugge; Henglein, Fritz; Nielsen, Lasse

2013-01-01

We present new algorithms for producing greedy parses for regular expressions (REs) in a semi-streaming fashion. Our lean-log algorithm executes in time O(mn) for REs of size m and input strings of size n and outputs a compact bit-coded parse tree representation. It improves on previous algorithms...... by: operating in only 2 passes; using only O(m) words of random-access memory (independent of n); requiring only kn bits of sequentially written and read log storage, where k ... and not requiring it to be stored at all. Previous RE parsing algorithms do not scale linearly with input size, or require substantially more log storage and employ 3 passes where the first consists of reversing the input, or do not or are not known to produce a greedy parse. The performance of our unoptimized C...

Processing SPARQL queries with regular expressions in RDF databases

Directory of Open Access Journals (Sweden)

Cho Hune

2011-03-01

Full Text Available Abstract Background As the Resource Description Framework (RDF data model is widely used for modeling and sharing a lot of online bioinformatics resources such as Uniprot (dev.isb-sib.ch/projects/uniprot-rdf or Bio2RDF (bio2rdf.org, SPARQL - a W3C recommendation query for RDF databases - has become an important query language for querying the bioinformatics knowledge bases. Moreover, due to the diversity of users’ requests for extracting information from the RDF data as well as the lack of users’ knowledge about the exact value of each fact in the RDF databases, it is desirable to use the SPARQL query with regular expression patterns for querying the RDF data. To the best of our knowledge, there is currently no work that efficiently supports regular expression processing in SPARQL over RDF databases. Most of the existing techniques for processing regular expressions are designed for querying a text corpus, or only for supporting the matching over the paths in an RDF graph. Results In this paper, we propose a novel framework for supporting regular expression processing in SPARQL query. Our contributions can be summarized as follows. 1 We propose an efficient framework for processing SPARQL queries with regular expression patterns in RDF databases. 2 We propose a cost model in order to adapt the proposed framework in the existing query optimizers. 3 We build a prototype for the proposed framework in C++ and conduct extensive experiments demonstrating the efficiency and effectiveness of our technique. Conclusions Experiments with a full-blown RDF engine show that our framework outperforms the existing ones by up to two orders of magnitude in processing SPARQL queries with regular expression patterns.

The DCCD: a digital data infrastructure for tree-ring research

NARCIS (Netherlands)

Jansma, E.; Lanen, R.J. van; Brewer, P.; Kramer, R. de

2012-01-01

Existing on-line databases for dendrochronology are not flexible in terms of user permissions, tree-ring data formats, metadata administration and language. This is why we developed the Digital Collaboratory for Cultural Dendrochronology (DCCD). This TRiDaS-based multi-lingual database allows users

College students with dyslexia: persistent linguistic deficits and foreign language learning.

Science.gov (United States)

Downey, D M; Snyder, L E; Hill, B

2000-01-01

The first of these two studies compared college students with dyslexia enrolled in modified Latin and Spanish classes and non-dyslexic students enrolled in regular foreign language classes on measures of foreign language aptitude, word decoding, spelling, phonological awareness and word repetition. The groups did not differ on age or grade point average. Analyses indicated that students with dyslexia performed significantly poorer on the foreign language aptitude measures as well as on both phonological tasks, reading and spelling. In the second study, students with learning disabilities who were enrolled in a modified Latin class were not significantly different from their peers in a regular Latin class on grade point average or on performance on a proficiency examination at the end of the second semester. The data suggest that while phonological processing deficits persist into adulthood, students with dyslexia are able to acquire appropriate skills and information to successfully complete the University's foreign language requirement in classes modified to meet their needs.

LANGUAGE THERAPY FOR SCHOLASTIC UNDERACHIEVERS.

Science.gov (United States)

ZEDLER, EMPRESS Y.

NEUROLOGICALLY HANDICAPPED CHILDREN OF NORMAL INTELLIGENCE CAN BE HELPED TO IMPROVE THEIR ACADEMIC ACHIEVEMENT THROUGH LANGUAGE THERAPY. A 2-YEAR STUDY SUGGESTED NOT ONLY THAT THIS STATEMENT IS TRUE BUT ALSO THAT SIGNIFICANTLY GREATER IMPROVEMENT COMES IN SITUATIONS WHERE THESE STUDENTS ARE PERMITTED TO REMAIN IN REGULAR CLASSROOMS AND TO RECEIVE…

The role of basal ganglia in language production: evidence from Parkinson's disease.

Science.gov (United States)

Macoir, Joël; Fossard, Marion; Mérette, Chantal; Langlois, Mélanie; Chantal, Sophie; Auclair-Ouellet, Noémie

2013-01-01

According to the dominant view in the literature, basal ganglia do not play a direct role in language but are involved in cognitive control required by linguistic and non-linguistic processing. In Parkinson's disease, basal ganglia impairment leads to motor symptoms and language deficits; those affecting the production of verbs have been frequently explored. According to a controversial theory, basal ganglia play a specific role in the conjugation of regular verbs as compared to irregular verbs. We report the results of 15 patients with Parkinson's disease in experimental conjugation tasks. They performed below healthy controls but their performance did not differ for regular and irregular verbs. These results confirm that basal ganglia are involved in language processing but do not play a specific role in verb production.

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

Science.gov (United States)

Pernici, Mario

2017-08-01

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

Reversing a tree regeneration crisis in an endangered ecoregion.

Science.gov (United States)

Fischer, Joern; Stott, Jenny; Zerger, Andre; Warren, Garth; Sherren, Kate; Forrester, Robert I

2009-06-23

Global food demand is growing rapidly. Livestock grazing can provide a valuable source of protein, but conventional grazing is often unsustainable. We studied an 800,000-ha section of a threatened ecoregion in southeastern Australia. Conventional management in the region involves continuous livestock grazing with few rest periods and regular fertilizer application. By using remotely sensed data on tree cover and extensive field data on livestock grazing regimes, soil chemistry, tree diameters, and tree regeneration, we show that the region is facing a tree regeneration crisis. Under conventional management, across the region, millions of hectares of land currently supporting tens of millions of trees will be treeless within decades from now. This would have severe negative ramifications for biodiversity and key ecosystem services, including water infiltration and shade provision for livestock. However, we identified an unexpected win-win solution for tree regeneration and commercial grazing. A relatively new practice in the region is fast-rotational grazing, characterized by prolonged rest periods in between short, intensive grazing events. The probability of regeneration under fast-rotational grazing was up to 4-fold higher than under conventional grazing, and it did not differ significantly from the probability of regeneration in ungrazed areas. In addition, trees were more likely to regenerate where soil nutrient levels were low. These findings suggest that the tree regeneration crisis can be reversed by applying low-input, fast-rotational grazing. New policy settings supporting these practices could signal a turning point for the region, from ecological decline to ecological recovery.

PhyloExplorer: a web server to validate, explore and query phylogenetic trees

Directory of Open Access Journals (Sweden)

Auberval Nicolas

2009-05-01

Full Text Available Abstract Background Many important problems in evolutionary biology require molecular phylogenies to be reconstructed. Phylogenetic trees must then be manipulated for subsequent inclusion in publications or analyses such as supertree inference and tree comparisons. However, no tool is currently available to facilitate the management of tree collections providing, for instance: standardisation of taxon names among trees with respect to a reference taxonomy; selection of relevant subsets of trees or sub-trees according to a taxonomic query; or simply computation of descriptive statistics on the collection. Moreover, although several databases of phylogenetic trees exist, there is currently no easy way to find trees that are both relevant and complementary to a given collection of trees. Results We propose a tool to facilitate assessment and management of phylogenetic tree collections. Given an input collection of rooted trees, PhyloExplorer provides facilities for obtaining statistics describing the collection, correcting invalid taxon names, extracting taxonomically relevant parts of the collection using a dedicated query language, and identifying related trees in the TreeBASE database. Conclusion PhyloExplorer is a simple and interactive website implemented through underlying Python libraries and MySQL databases. It is available at: http://www.ncbi.orthomam.univ-montp2.fr/phyloexplorer/ and the source code can be downloaded from: http://code.google.com/p/taxomanie/.

"We communicated that way for a reason": language practices and language ideologies among hearing adults whose parents are deaf.

Science.gov (United States)

Pizer, Ginger; Walters, Keith; Meier, Richard P

2013-01-01

Families with deaf parents and hearing children are often bilingual and bimodal, with both a spoken language and a signed one in regular use among family members. When interviewed, 13 American hearing adults with deaf parents reported widely varying language practices, sign language abilities, and social affiliations with Deaf and Hearing communities. Despite this variation, the interviewees' moral judgments of their own and others' communicative behavior suggest that these adults share a language ideology concerning the obligation of all family members to expend effort to overcome potential communication barriers. To our knowledge, such a language ideology is not similarly pervasive among spoken-language bilingual families, raising the question of whether there is something unique about family bimodal bilingualism that imposes different rights and responsibilities on family members than spoken-language family bilingualism does. This ideology unites an otherwise diverse group of interviewees, where each one preemptively denied being a "typical CODA [children of deaf adult]."

Classification and closure properties of languages for describing concurrent system behaviours

Energy Technology Data Exchange (ETDEWEB)

Szijarto, M.

1981-01-01

The correspondence between sequential program schemes and formal languages is well known. The situation is more complicated in the case of parallel program schemes, and trace languages have been introduced to describe them. The author introduces the concept of the closure of a language on a so called independence relation on the alphabet of the language, and formulate several theorems about them and the trace languages. He investigates the closedness properties of Chomsky classes under closure on independence relations, and as a special case we derive a new necessary and sufficient condition for the regularity of the commutative closure of a language. 12 references.

Tone language fluency impairs pitch discrimination

Directory of Open Access Journals (Sweden)

Isabelle ePeretz

2011-07-01

Full Text Available Here we present evidence that native speakers of a tone language, in which pitch contributes to word meaning, are impaired in the discrimination of falling pitches in tone sequences, as compared to speakers of a non-tone language. Both groups were presented with monotonic and isochronous sequences of five tones (i.e., constant pitch and intertone interval. They were required to detect when the fourth tone was displaced in pitch or time. While speakers of a tone language performed more poorly in the detection of downward pitch changes, they did not differ from non-tone language speakers in their perception of upward pitch changes or in their perception of subtle time changes. Moreover, this impairment cannot be attributed to low musical aptitude since the impairment remains unchanged when individual differences in musical pitch-based processing is taken into account. Thus, the impairment appears highly specific and may reflect the influence of statistical regularities of tone languages.

Several types of types in programming languages

OpenAIRE

Martini, Simone

2015-01-01

Part 2: Regular Submissions; International audience; Types are an important part of any modern programming language, but we often forget that the concept of type we understand nowadays is not the same it was perceived in the sixties. Moreover, we conflate the concept of " type " in programming languages with the concept of the same name in mathematical logic, an identification that is only the result of the convergence of two different paths, which started apart with different aims. The paper...

Between-language repetition priming in antonym generation: evidence that translation-equivalent adjectives have shared conceptual representations across languages.

Science.gov (United States)

Taylor, Randolph S; Francis, Wendy S

2017-03-01

Previous literature has demonstrated conceptual repetition priming across languages in bilinguals. This between-language priming effect is taken as evidence that translation equivalents have shared conceptual representations across languages. However, the vast majority of this research has been conducted using only concrete nouns as stimuli. The present experiment examined conceptual repetition priming within and between languages in adjectives, a part of speech not previously investigated in studies of bilingual conceptual representation. The participants were 100 Spanish-English bilinguals who had regular exposure to both languages. At encoding, participants performed a shallow processing task and a deep-processing task on English and Spanish adjectives. At test, they performed an antonym-generation task in English, in which the target responses were either adjectives presented at encoding or control adjectives not previously presented. The measure of priming was the response time advantage for producing repeated adjectives relative to control adjectives. Significant repetition priming was observed both within and between languages under deep, but not shallow, encoding conditions. The results indicate that the conceptual representations of adjective translation equivalents are shared across languages.

3D Visualization of Trees Based on a Sphere-Board Model

Directory of Open Access Journals (Sweden)

Jiangfeng She

2018-01-01

Full Text Available Because of the smooth interaction of tree systems, the billboard and crossed-plane techniques of image-based rendering (IBR have been used for tree visualization for many years. However, both the billboard-based tree model (BBTM and the crossed-plane tree model (CPTM have several notable limitations; for example, they give an impression of slicing when viewed from the top side, and they produce an unimpressive stereoscopic effect and insufficient lighted effects. In this study, a sphere-board-based tree model (SBTM is proposed to eliminate these defects and to improve the final visual effects. Compared with the BBTM or CPTM, the proposed SBTM uses one or more sphere-like 3D geometric surfaces covered with a virtual texture, which can present more details about the foliage than can 2D planes, to represent the 3D outline of a tree crown. However, the profile edge presented by a continuous surface is overly smooth and regular, and when used to delineate the outline of a tree crown, it makes the tree appear very unrealistic. To overcome this shortcoming and achieve a more natural final visual effect of the tree model, an additional process is applied to the edge of the surface profile. In addition, the SBTM can better support lighted effects because of its cubic geometrical features. Interactive visualization effects for a single tree and a grove are presented in a case study of Sabina chinensis. The results show that the SBTM can achieve a better compromise between realism and performance than can the BBTM or CPTM.

ARBUS: A FORTRAN tool for generating tree structure diagrams

International Nuclear Information System (INIS)

Ferrero, C.; Zanger, M.

1992-02-01

The FORTRAN77 stand-alone code ARBUS has been designed to aid the user by providing a tree structure diagram generating utility for computer programs written in FORTRAN language. This report is intended to describe the main purpose and features of ARBUS and to highlight some additional applications of the code by means of practical test cases. (orig.) [de

Design prototype detection tools of Porous Tree using microcontroller Arduino Uno R3 and piezoelectric sensor

Science.gov (United States)

Sujadi, H.; Bastian, A.; Tira

2018-05-01

In the city, many trees are found uprooted and cause accidents and many losses. No exception in the area of Majalengka Regency of West Java Province which can also anytime an accident or disaster caused by fallen trees, where in Majalengka district is logging trees on the street and public places are not done regularly. Based on the above problems, the need for tools that can detect a porous tree, to assist in the sorting of trees which should be felled and not felled by the party who has the authority of the general management of BMCK. Previously created tools to detect porous trees imported from Hungary and Germany, namely Arbosonic3D and Sonic Tomography. This design uses piezoelectric sensors to detect how much pressure is received by fragile and fragile trees, of course the fragile and fragile strength of trees will be different when exposed to the same pressure given the fragile density of fragile and fragile trees, then the data sent to Arduino Uno R3 to be processed into an information. This research produces a means of detecting the loss of a tree for early detection and no falling trees.

Reading Logs and Literature Teaching Models in English Language Teacher Education

Science.gov (United States)

Ochoa Delarriva, Ornella; Basabe, Enrique Alejandro

2016-01-01

Reading logs are regularly used in foreign language education since they are not only critical in the development of reading comprehension but may also be instrumental in taking readers beyond the referential into the representational realms of language. In this paper we offer the results of a qualitative analysis of a series of reading logs…

Regularities in the 14C assimilates supply of fruit in old peach trees

International Nuclear Information System (INIS)

Petrov, A.; Manolov, P.

1977-01-01

Autoradiography and 14 C assimilates were used in trials with five-year vase pruned trees of the Dixired peach variety. The labelled assimilates as entries from 14 CO 2 dressed shoots in the skeletal parts were transposted by a narrow phloem strip and directed either towards the fruits or down to the trunk and root system. The cumulation of labelled assimilates in fruits is determined by a series of factors. The main of them was the coincidence of the fruitbearing branchlet base with the radioactive phloem strip of the carrying it skeletal part. The leaves/fruits ratio in regard to the fruitbearing branchlet was a more slightly acting factor and in all probability contributing to the going of photoassimilates in fruits only in the case of coincidence of the basal part of fruitbearing branchlet with the radioactive steam. The transport to the fruits was both basipetal and acropetal. The 14 C assimilates stream towards the root system could get fully exhausted and stopped by branchlets covered with numerous fruits and insufficient leafage disposed on the radioactive strip. On the other hand, the basipetal 14 C assimilates stream at the base of the erected skeletal parts, caused by a strong acceptable organ the root system, hampers the labelled assimilates supply even of those fruitbearing branchlets with a low leaves/fruits ratio whose basal parts coincided with the radioactive strip. To this contributed also the great difference in the thicknesses between the skeletal part and the side fruitbearing branchlets. The examined transport type explained to some extent the slighter growth of fruits in the lower part of compact peach tree crowns reg ardless of the great leafage presence in this top parts. (author)

Invariance Detection within an Interactive System: A Perceptual Gateway to Language Development

Science.gov (United States)

Gogate, Lakshmi J.; Hollich, George

2010-01-01

In this article, we hypothesize that "invariance detection," a general perceptual phenomenon whereby organisms attend to relatively stable patterns or regularities, is an important means by which infants tune in to various aspects of spoken language. In so doing, we synthesize a substantial body of research on detection of regularities across the…

NuFTA: A CASE Tool for Automatic Software Fault Tree Analysis

International Nuclear Information System (INIS)

Yun, Sang Hyun; Lee, Dong Ah; Yoo, Jun Beom

2010-01-01

Software fault tree analysis (SFTA) is widely used for analyzing software requiring high-reliability. In SFTA, experts predict failures of system through HA-ZOP (Hazard and Operability study) or FMEA (Failure Mode and Effects Analysis) and draw software fault trees about the failures. Quality and cost of the software fault tree, therefore, depend on knowledge and experience of the experts. This paper proposes a CASE tool NuFTA in order to assist experts of safety analysis. The NuFTA automatically generate software fault trees from NuSCR formal requirements specification. NuSCR is a formal specification language used for specifying software requirements of KNICS RPS (Reactor Protection System) in Korea. We used the SFTA templates proposed by in order to generate SFTA automatically. The NuFTA also generates logical formulae summarizing the failure's cause, and we have a plan to use the formulae usefully through formal verification techniques

Ensino de ciências para deficientes auditivos: um estudo sobre a produção de narrativas em classes regulares inclusivas

Directory of Open Access Journals (Sweden)

Walquíria D. de Oliveira

2012-07-01

Full Text Available The education of deaf people in regular schools is a challenge because for a long time not given due importance to their way of communication, sign language. With the inclusion of the deaf students have been put into the regular school and there is a need for a new agent on vital for their integration, the interpreter of Brazilian sign language (libras. The aim ofthis study is to analyze the narratives production by libras interpreters and science teachers in the inclusive classroom. The investigation of this issue brings the discussion questions as: what is the role of the educational interpreter? What is prescribed and what is real in the process of inclusion? The methodological approach adopted is based on Zabalza that uses the class diaries as research instruments, where the subject is searched without being noticed. The results point to a lack of knowledge of language constituted the main dilemma in the education of the deaf. Keywords: inclusive education, science education, deafness

The Canopy Graph and Level Statistics for Random Operators on Trees

International Nuclear Information System (INIS)

Aizenman, Michael; Warzel, Simone

2006-01-01

For operators with homogeneous disorder, it is generally expected that there is a relation between the spectral characteristics of a random operator in the infinite setup and the distribution of the energy gaps in its finite volume versions, in corresponding energy ranges. Whereas pure point spectrum of the infinite operator goes along with Poisson level statistics, it is expected that purely absolutely continuous spectrum would be associated with gap distributions resembling the corresponding random matrix ensemble. We prove that on regular rooted trees, which exhibit both spectral types, the eigenstate point process has always Poissonian limit. However, we also find that this does not contradict the picture described above if that is carefully interpreted, as the relevant limit of finite trees is not the infinite homogenous tree graph but rather a single-ended 'canopy graph.' For this tree graph, the random Schroedinger operator is proven here to have only pure-point spectrum at any strength of the disorder. For more general single-ended trees it is shown that the spectrum is always singular - pure point possibly with singular continuous component which is proven to occur in some cases

Fourier transform inequalities for phylogenetic trees.

Science.gov (United States)

Matsen, Frederick A

2009-01-01

Phylogenetic invariants are not the only constraints on site-pattern frequency vectors for phylogenetic trees. A mutation matrix, by its definition, is the exponential of a matrix with non-negative off-diagonal entries; this positivity requirement implies non-trivial constraints on the site-pattern frequency vectors. We call these additional constraints "edge-parameter inequalities". In this paper, we first motivate the edge-parameter inequalities by considering a pathological site-pattern frequency vector corresponding to a quartet tree with a negative internal edge. This site-pattern frequency vector nevertheless satisfies all of the constraints described up to now in the literature. We next describe two complete sets of edge-parameter inequalities for the group-based models; these constraints are square-free monomial inequalities in the Fourier transformed coordinates. These inequalities, along with the phylogenetic invariants, form a complete description of the set of site-pattern frequency vectors corresponding to bona fide trees. Said in mathematical language, this paper explicitly presents two finite lists of inequalities in Fourier coordinates of the form "monomial < or = 1", each list characterizing the phylogenetically relevant semialgebraic subsets of the phylogenetic varieties.

Categorizing ideas about trees: a tree of trees.

Science.gov (United States)

Fisler, Marie; Lecointre, Guillaume

2013-01-01

The aim of this study is to explore whether matrices and MP trees used to produce systematic categories of organisms could be useful to produce categories of ideas in history of science. We study the history of the use of trees in systematics to represent the diversity of life from 1766 to 1991. We apply to those ideas a method inspired from coding homologous parts of organisms. We discretize conceptual parts of ideas, writings and drawings about trees contained in 41 main writings; we detect shared parts among authors and code them into a 91-characters matrix and use a tree representation to show who shares what with whom. In other words, we propose a hierarchical representation of the shared ideas about trees among authors: this produces a "tree of trees." Then, we categorize schools of tree-representations. Classical schools like "cladists" and "pheneticists" are recovered but others are not: "gradists" are separated into two blocks, one of them being called here "grade theoreticians." We propose new interesting categories like the "buffonian school," the "metaphoricians," and those using "strictly genealogical classifications." We consider that networks are not useful to represent shared ideas at the present step of the study. A cladogram is made for showing who is sharing what with whom, but also heterobathmy and homoplasy of characters. The present cladogram is not modelling processes of transmission of ideas about trees, and here it is mostly used to test for proximity of ideas of the same age and for categorization.

IND - THE IND DECISION TREE PACKAGE

Science.gov (United States)

Buntine, W.

1994-01-01

A common approach to supervised classification and prediction in artificial intelligence and statistical pattern recognition is the use of decision trees. A tree is "grown" from data using a recursive partitioning algorithm to create a tree which has good prediction of classes on new data. Standard algorithms are CART (by Breiman Friedman, Olshen and Stone) and ID3 and its successor C4 (by Quinlan). As well as reimplementing parts of these algorithms and offering experimental control suites, IND also introduces Bayesian and MML methods and more sophisticated search in growing trees. These produce more accurate class probability estimates that are important in applications like diagnosis. IND is applicable to most data sets consisting of independent instances, each described by a fixed length vector of attribute values. An attribute value may be a number, one of a set of attribute specific symbols, or it may be omitted. One of the attributes is delegated the "target" and IND grows trees to predict the target. Prediction can then be done on new data or the decision tree printed out for inspection. IND provides a range of features and styles with convenience for the casual user as well as fine-tuning for the advanced user or those interested in research. IND can be operated in a CART-like mode (but without regression trees, surrogate splits or multivariate splits), and in a mode like the early version of C4. Advanced features allow more extensive search, interactive control and display of tree growing, and Bayesian and MML algorithms for tree pruning and smoothing. These often produce more accurate class probability estimates at the leaves. IND also comes with a comprehensive experimental control suite. IND consists of four basic kinds of routines: data manipulation routines, tree generation routines, tree testing routines, and tree display routines. The data manipulation routines are used to partition a single large data set into smaller training and test sets. The

Cultural views, language ability, and mammography use in Chinese American women.

Science.gov (United States)

Liang, Wenchi; Wang, Judy; Chen, Mei-Yuh; Feng, Shibao; Yi, Bin; Mandelblatt, Jeanne S

2009-12-01

Mammography screening rates among Chinese American women have been reported to be low. This study examines whether and how culture views and language ability influence mammography adherence in this mostly immigrant population. Asymptomatic Chinese American women (n = 466) aged 50 and older, recruited from the Washington, D.C. area, completed a telephone interview. Regular mammography was defined as having two mammograms at age-appropriate recommended intervals. Cultural views were assessed by 30 items, and language ability measured women's ability in reading, writing, speaking, and listening to English. After controlling for risk perception, worry, physician recommendation, family encouragement, and access barriers, women holding a more Chinese/Eastern cultural view were significantly less likely to have had regular mammograms than those having a Western cultural view. English ability was positively associated with mammography adherence. The authors' results imply that culturally sensitive and language-appropriate educational interventions are likely to improve mammography adherence in this population.

The Realization of Language Communication in Linguo-Didactic Theory and Practice

Directory of Open Access Journals (Sweden)

Vida Asanavičienė

2011-04-01

Full Text Available The article deals with one of language communication forms – a colloquial language. The author considers a colloquial language as one of types of language activities which is integrated into other types language activities during the teaching process. As the language is the teaching subject, it is important to pay attention to the nature and essence of the language, to its constituent parts. Preparing the methods of teaching a colloquial language one should bear in mind the linguistics, psychological, psycho-linguistic and pedagogical regularities of language teaching and learning. The author refers to the methods scientific research and her own work experience and recommends to start teaching a colloquial language from the reception, i.e. from listening and comprehension. In the article the exercises are divided into aspective (preparatory and communicative. These exercise have to be based on a scientifically researched system.

Evaluation of weeds as possible hosts of the potyviruses associated with tree tomato (solanum betaceum cav.) viroses

OpenAIRE

Sierra S., Adela; Gil R., José Fernando; Patiño H., Luis Fernando; González J., Elena Paola

2012-01-01

language: EN-US; mso-fareast-font-family: Calibri; mso-fareast-theme-font: minor-latin; mso-fareast-language: EN-US; mso-bidi-language: AR-SA;" lang="EN-US">To determine possible weed hosts of potyviruses associated with the disease known as “tree tomato virus disease” in Antioquia department (Colombia), a sampling was conducted to identify weed species commonly found ...

Distance-regular graphs

NARCIS (Netherlands)

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

2016-01-01

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

Wood for the trees

Directory of Open Access Journals (Sweden)

Rob Garbutt

2013-10-01

Full Text Available Our paper focuses on the materiality, cultural history and cultural relations of selected artworks in the exhibition Wood for the trees (Lismore Regional Gallery, New South Wales, Australia, 10 June – 17 July 2011. The title of the exhibition, intentionally misreading the aphorism “Can’t see the wood for the trees”, by reading the wood for the resource rather than the collective wood[s], implies conservation, preservation, and the need for sustaining the originating resource. These ideas have particular resonance on the NSW far north coast, a region once rich in rainforest. While the Indigenous population had sustainable practices of forest and land management, the colonists deployed felling and harvesting in order to convert the value of the local, abundant rainforest trees into high-value timber. By the late twentieth century, however, a new wave of settlers launched a protest movements against the proposed logging of remnant rainforest at Terania Creek and elsewhere in the region. Wood for the trees, curated by Gallery Director Brett Adlington, plays on this dynamic relationship between wood, trees and people. We discuss the way selected artworks give expression to the themes or concepts of productive labour, nature and culture, conservation and sustainability, and memory. The artworks include Watjinbuy Marrawilil’s (1980 Carved ancestral figure ceremonial pole, Elizabeth Stops’ (2009/10 Explorations into colonisation, Hossein Valamanesh’s (2008 Memory stick, and AñA Wojak’s (2008 Unread book (in a forgotten language. Our art writing on the works, a practice informed by Bal (2002, Muecke (2008 and Papastergiadis (2004, becomes a conversation between the works and the themes or concepts. As a form of material excess of the most productive kind (Grosz, 2008, p. 7, art seeds a response to that which is in the air waiting to be said of the past, present and future.

Regular expressions cookbook

CERN Document Server

Goyvaerts, Jan

2009-01-01

This cookbook provides more than 100 recipes to help you crunch data and manipulate text with regular expressions. Every programmer can find uses for regular expressions, but their power doesn't come worry-free. Even seasoned users often suffer from poor performance, false positives, false negatives, or perplexing bugs. Regular Expressions Cookbook offers step-by-step instructions for some of the most common tasks involving this tool, with recipes for C#, Java, JavaScript, Perl, PHP, Python, Ruby, and VB.NET. With this book, you will: Understand the basics of regular expressions through a

Odor-baited trap trees: a novel management tool for plum curculio (Coleoptera: Curculionidae).

Science.gov (United States)

Leskey, Tracy C; Piñero, Jaime C; Prokopy, Ronald J

2008-08-01

The plum curculio, Conotrachelus nenuphar (Herbst) (Coleoptera: Curculionidae), one of the most important pests of apple (Malus spp.) in eastern and central North America, historically has been managed in New England apple orchards by three full block insecticide applications. Efforts to reduce insecticide inputs against plum curculio include perimeter row sprays, particularly after petal fall, to control immigrating adults. The odor-baited trap tree approach represents a new reduced input strategy for managing plum curculio based on the application of insecticides to a few perimeter-row trap trees rather than the entire perimeter row or full orchard block. Here, we compared the efficacy of a trap tree approach with perimeter row treatments to manage populations after petal fall in commercial apple orchards in 2005 and 2006. Injury was significantly greater in trap trees compared with unbaited perimeter row treated trees in both years of the study. In 2005, heavy rains prevented growers from applying insecticide applications at regular intervals resulting in high injury in nearly all blocks regardless of type of management strategy. In 2006, both the trap-tree and perimeter-row treatments prevented penetration by immigrating populations and resulted in economically acceptable levels of injury. The trap tree management strategy resulted in a reduction of approximately 70% total trees being treated with insecticide compared with perimeter row sprays and 93% compared with standard full block sprays.

A roadmap for global synthesis of the plant tree of life.

Science.gov (United States)

Eiserhardt, Wolf L; Antonelli, Alexandre; Bennett, Dominic J; Botigué, Laura R; Burleigh, J Gordon; Dodsworth, Steven; Enquist, Brian J; Forest, Félix; Kim, Jan T; Kozlov, Alexey M; Leitch, Ilia J; Maitner, Brian S; Mirarab, Siavash; Piel, William H; Pérez-Escobar, Oscar A; Pokorny, Lisa; Rahbek, Carsten; Sandel, Brody; Smith, Stephen A; Stamatakis, Alexandros; Vos, Rutger A; Warnow, Tandy; Baker, William J

2018-03-01

Providing science and society with an integrated, up-to-date, high quality, open, reproducible and sustainable plant tree of life would be a huge service that is now coming within reach. However, synthesizing the growing body of DNA sequence data in the public domain and disseminating the trees to a diverse audience are often not straightforward due to numerous informatics barriers. While big synthetic plant phylogenies are being built, they remain static and become quickly outdated as new data are published and tree-building methods improve. Moreover, the body of existing phylogenetic evidence is hard to navigate and access for non-experts. We propose that our community of botanists, tree builders, and informaticians should converge on a modular framework for data integration and phylogenetic analysis, allowing easy collaboration, updating, data sourcing and flexible analyses. With support from major institutions, this pipeline should be re-run at regular intervals, storing trees and their metadata long-term. Providing the trees to a diverse global audience through user-friendly front ends and application development interfaces should also be a priority. Interactive interfaces could be used to solicit user feedback and thus improve data quality and to coordinate the generation of new data. We conclude by outlining a number of steps that we suggest the scientific community should take to achieve global phylogenetic synthesis. © 2018 Botanical Society of America.

The generative power of weighted one-sided and regular sticker systems

Science.gov (United States)

Siang, Gan Yee; Heng, Fong Wan; Sarmin, Nor Haniza; Turaev, Sherzod

2014-06-01

Sticker systems were introduced in 1998 as one of the DNA computing models by using the recombination behavior of DNA molecules. The Watson-Crick complementary principle of DNA molecules is abstractly used in the sticker systems to perform the computation of sticker systems. In this paper, the generative power of weighted one-sided sticker systems and weighted regular sticker systems are investigated. Moreover, the relationship of the families of languages generated by these two variants of sticker systems to the Chomsky hierarchy is also presented.

LL-regular grammars

NARCIS (Netherlands)

Nijholt, Antinus

1980-01-01

Culik II and Cogen introduced the class of LR-regular grammars, an extension of the LR(k) grammars. In this paper we consider an analogous extension of the LL(k) grammars called the LL-regular grammars. The relation of this class of grammars to other classes of grammars will be shown. Any LL-regular

A MongoDB-Based Management of Planar Spatial Data with a Flattened R-Tree

Directory of Open Access Journals (Sweden)

Longgang Xiang

2016-07-01

Full Text Available This paper addresses how to manage planar spatial data using MongoDB, a popular NoSQL database characterized as a document-oriented, rich query language and high availability. The core idea is to flatten a hierarchical R-tree structure into a tabular MongoDB collection, during which R-tree nodes are represented as collection documents and R-tree pointers are expressed as document identifiers. By following this strategy, a storage schema to support R-tree-based create, read, update, and delete (CRUD operations is designed and a module to manage planar spatial data by consuming and maintaining flattened R-tree structure is developed. The R-tree module is then seamlessly integrated into MongoDB, so that users could manipulate planar spatial data with existing command interfaces oriented to geodetic spatial data. The experimental evaluation, using real-world datasets with diverse coverage, types, and sizes, shows that planar spatial data can be effectively managed by MongoDB with our flattened R-tree and, therefore, the application extent of MongoDB will be greatly enlarged. Our work resulted in a MongoDB branch with R-tree support, which has been released on GitHub for open access.

treeman: an R package for efficient and intuitive manipulation of phylogenetic trees.

Science.gov (United States)

Bennett, Dominic J; Sutton, Mark D; Turvey, Samuel T

2017-01-07

Phylogenetic trees are hierarchical structures used for representing the inter-relationships between biological entities. They are the most common tool for representing evolution and are essential to a range of fields across the life sciences. The manipulation of phylogenetic trees-in terms of adding or removing tips-is often performed by researchers not just for reasons of management but also for performing simulations in order to understand the processes of evolution. Despite this, the most common programming language among biologists, R, has few class structures well suited to these tasks. We present an R package that contains a new class, called TreeMan, for representing the phylogenetic tree. This class has a list structure allowing phylogenetic trees to be manipulated more efficiently. Computational running times are reduced because of the ready ability to vectorise and parallelise methods. Development is also improved due to fewer lines of code being required for performing manipulation processes. We present three use cases-pinning missing taxa to a supertree, simulating evolution with a tree-growth model and detecting significant phylogenetic turnover-that demonstrate the new package's speed and simplicity.

Language, Identity, and Citizenship in a U.S. University: Immigrant English Learners' Identity (Re)positioning

Science.gov (United States)

Fuentes, Ronald

2016-01-01

In response to growing linguistic diversity, many U.S. universities have implemented language policies that include procedures for English learner (EL) identification. Institutional labels such as "English learner" and "limited English proficiency" are regularly used to identify students who may need English language support;…

Next-generation phenomics for the Tree of Life.

Science.gov (United States)

Burleigh, J Gordon; Alphonse, Kenzley; Alverson, Andrew J; Bik, Holly M; Blank, Carrine; Cirranello, Andrea L; Cui, Hong; Daly, Marymegan; Dietterich, Thomas G; Gasparich, Gail; Irvine, Jed; Julius, Matthew; Kaufman, Seth; Law, Edith; Liu, Jing; Moore, Lisa; O'Leary, Maureen A; Passarotti, Maria; Ranade, Sonali; Simmons, Nancy B; Stevenson, Dennis W; Thacker, Robert W; Theriot, Edward C; Todorovic, Sinisa; Velazco, Paúl M; Walls, Ramona L; Wolfe, Joanna M; Yu, Mengjie

2013-06-26

The phenotype represents a critical interface between the genome and the environment in which organisms live and evolve. Phenotypic characters also are a rich source of biodiversity data for tree building, and they enable scientists to reconstruct the evolutionary history of organisms, including most fossil taxa, for which genetic data are unavailable. Therefore, phenotypic data are necessary for building a comprehensive Tree of Life. In contrast to recent advances in molecular sequencing, which has become faster and cheaper through recent technological advances, phenotypic data collection remains often prohibitively slow and expensive. The next-generation phenomics project is a collaborative, multidisciplinary effort to leverage advances in image analysis, crowdsourcing, and natural language processing to develop and implement novel approaches for discovering and scoring the phenome, the collection of phentotypic characters for a species. This research represents a new approach to data collection that has the potential to transform phylogenetics research and to enable rapid advances in constructing the Tree of Life. Our goal is to assemble large phenomic datasets built using new methods and to provide the public and scientific community with tools for phenomic data assembly that will enable rapid and automated study of phenotypes across the Tree of Life.

An improved Bayesian tensor regularization and sampling algorithm to track neuronal fiber pathways in the language circuit.

Science.gov (United States)

Mishra, Arabinda; Anderson, Adam W; Wu, Xi; Gore, John C; Ding, Zhaohua

2010-08-01

The purpose of this work is to design a neuronal fiber tracking algorithm, which will be more suitable for reconstruction of fibers associated with functionally important regions in the human brain. The functional activations in the brain normally occur in the gray matter regions. Hence the fibers bordering these regions are weakly myelinated, resulting in poor performance of conventional tractography methods to trace the fiber links between them. A lower fractional anisotropy in this region makes it even difficult to track the fibers in the presence of noise. In this work, the authors focused on a stochastic approach to reconstruct these fiber pathways based on a Bayesian regularization framework. To estimate the true fiber direction (propagation vector), the a priori and conditional probability density functions are calculated in advance and are modeled as multivariate normal. The variance of the estimated tensor element vector is associated with the uncertainty due to noise and partial volume averaging (PVA). An adaptive and multiple sampling of the estimated tensor element vector, which is a function of the pre-estimated variance, overcomes the effect of noise and PVA in this work. The algorithm has been rigorously tested using a variety of synthetic data sets. The quantitative comparison of the results to standard algorithms motivated the authors to implement it for in vivo DTI data analysis. The algorithm has been implemented to delineate fibers in two major language pathways (Broca's to SMA and Broca's to Wernicke's) across 12 healthy subjects. Though the mean of standard deviation was marginally bigger than conventional (Euler's) approach [P. J. Basser et al., "In vivo fiber tractography using DT-MRI data," Magn. Reson. Med. 44(4), 625-632 (2000)], the number of extracted fibers in this approach was significantly higher. The authors also compared the performance of the proposed method to Lu's method [Y. Lu et al., "Improved fiber tractography with Bayesian

The relation of the number of languages spoken to performance in different cognitive abilities in old age.

Science.gov (United States)

Ihle, Andreas; Oris, Michel; Fagot, Delphine; Kliegel, Matthias

2016-12-01

Findings on the association of speaking different languages with cognitive functioning in old age are inconsistent and inconclusive so far. Therefore, the present study set out to investigate the relation of the number of languages spoken to cognitive performance and its interplay with several other markers of cognitive reserve in a large sample of older adults. Two thousand eight hundred and twelve older adults served as sample for the present study. Psychometric tests on verbal abilities, basic processing speed, and cognitive flexibility were administered. In addition, individuals were interviewed on their different languages spoken on a regular basis, educational attainment, occupation, and engaging in different activities throughout adulthood. Higher number of languages regularly spoken was significantly associated with better performance in verbal abilities and processing speed, but unrelated to cognitive flexibility. Regression analyses showed that the number of languages spoken predicted cognitive performance over and above leisure activities/physical demand of job/gainful activity as respective additional predictor, but not over and above educational attainment/cognitive level of job as respective additional predictor. There was no significant moderation of the association of the number of languages spoken with cognitive performance in any model. Present data suggest that speaking different languages on a regular basis may additionally contribute to the build-up of cognitive reserve in old age. Yet, this may not be universal, but linked to verbal abilities and basic cognitive processing speed. Moreover, it may be dependent on other types of cognitive stimulation that individuals also engaged in during their life course.

Effects of mixture and thinning in a tree farming valuable broadleaves plantation more than 20 years after the establishment.

Directory of Open Access Journals (Sweden)

Alessio Corazzesi

2010-12-01

Full Text Available The results of peduncolate Oak plantation trials where the Oak is mixed to wild Cherry and narrow-leaf Ash per line and per close mixture with different proportions (25% and 50% of N-fixing species (Black Locust and Italian Alder are described in the paper. The plantation, carried out in winter 1988-89, was framed into a reafforestation plan for spoil banks restoration. On a share of the plantation area, free thinnings foreseeing the release of about 70 target trees per hectare, were undertaken in 2001 and 2003; 21% and 27% of basal area were removed, respectively. In the latter trial, the crowns of target trees were completely isolated by felling all the surrounding trees. The performances of valuable timber broadleaves, the effects of intercropping and thinning on the growth of Oak target trees were analysed. Three inventories (2001, 2004 and 2008 and the annual monitoring of target trees growth were performed at the purpose. The two peduncolate Oak and narrow-leaf Ash trees showed the best performances among the set of valuable broadleaves, whilst wild cherry resulted not suited to local site conditions. A higher tree mortality occurred in the mixture with Black Locust. The mixture with both Nfixing species provided a stimulus to the Oak growth both in terms of dbh and tree height. Italian Alder resulted anyway less competitive and easy to manage, considering its progressive self-thinning, while Black Locust was aggressive enough to necessitate the control of its development by pollarding 7 years after the plantation. In the thinned plots, target trees showed significant diameter increments in comparison with control plots; maintaining year by year constant dbh increments of about 1 cm and crown’s diameter increment of about 50 cm. Intercropping with Italian Alder showed to be more effective than thinning on growth of the target trees. st1\\:*{behavior:url(#ieooui } /* Style Definitions */ table.MsoNormalTable {mso

Acquiring variation in an artificial language: Children and adults are sensitive to socially conditioned linguistic variation.

Science.gov (United States)

Samara, Anna; Smith, Kenny; Brown, Helen; Wonnacott, Elizabeth

2017-05-01

Languages exhibit sociolinguistic variation, such that adult native speakers condition the usage of linguistic variants on social context, gender, and ethnicity, among other cues. While the existence of this kind of socially conditioned variation is well-established, less is known about how it is acquired. Studies of naturalistic language use by children provide various examples where children's production of sociolinguistic variants appears to be conditioned on similar factors to adults' production, but it is difficult to determine whether this reflects knowledge of sociolinguistic conditioning or systematic differences in the input to children from different social groups. Furthermore, artificial language learning experiments have shown that children have a tendency to eliminate variation, a process which could potentially work against their acquisition of sociolinguistic variation. The current study used a semi-artificial language learning paradigm to investigate learning of the sociolinguistic cue of speaker identity in 6-year-olds and adults. Participants were trained and tested on an artificial language where nouns were obligatorily followed by one of two meaningless particles and were produced by one of two speakers (one male, one female). Particle usage was conditioned deterministically on speaker identity (Experiment 1), probabilistically (Experiment 2), or not at all (Experiment 3). Participants were given tests of production and comprehension. In Experiments 1 and 2, both children and adults successfully acquired the speaker identity cue, although the effect was stronger for adults and in Experiment 1. In addition, in all three experiments, there was evidence of regularization in participants' productions, although the type of regularization differed with age: children showed regularization by boosting the frequency of one particle at the expense of the other, while adults regularized by conditioning particle usage on lexical items. Overall, results

Duenna-An experimental language teaching application

Science.gov (United States)

Horváth, Balázs Zsigmond; Blaske, Bence; Szabó, Anita

The presented TTS (text-to-speech) application is an auxiliary tool for language teaching. It utilizes computer-generated voices to simulate dialogs representing different grammatical problems or speech contexts. The software is capable of producing as many examples of dialogs as required to enhance the language learning experience and thus serve curriculum representation, grammar contextualization and pronunciation at the same time. It is designed to be used on a regular basis in the language classroom and students gladly write materials for listening comprehension tasks with it. A pilot study involving 26 students (divided into control and trial groups) practicing for their school-leaving exam, indicates that computer-generated voices are adequate to recreate audio course book materials as well. The voices used were able to involve the students as effectively as if they were listening to recorded human speech.

Duenna—An experimental language teaching application

Directory of Open Access Journals (Sweden)

Balázs Zsigmond Horváth

2016-01-01

Full Text Available The presented TTS (text-to-speech application is an auxiliary tool for language teaching. It utilizes computer-generated voices to simulate dialogs representing different grammatical problems or speech contexts. The software is capable of producing as many examples of dialogs as required to enhance the language learning experience and thus serve curriculum representation, grammar contextualization and pronunciation at the same time. It is designed to be used on a regular basis in the language classroom and students gladly write materials for listening comprehension tasks with it. A pilot study involving 26 students (divided into control and trial groups practicing for their school-leaving exam, indicates that computer-generated voices are adequate to recreate audio course book materials as well. The voices used were able to involve the students as effectively as if they were listening to recorded human speech.

A conceptual data model and modelling language for fields and agents

Science.gov (United States)

de Bakker, Merijn; de Jong, Kor; Schmitz, Oliver; Karssenberg, Derek

2016-04-01

Modelling is essential in order to understand environmental systems. Environmental systems are heterogeneous because they consist of fields and agents. Fields have a value defined everywhere at all times, for example surface elevation and temperature. Agents are bounded in space and time and have a value only within their bounds, for example biomass of a tree crown or the speed of a car. Many phenomena have properties of both fields and agents. Although many systems contain both fields and agents and integration of these concepts would be required for modelling, existing modelling frameworks concentrate on either agent-based or field-based modelling and are often low-level programming frameworks. A concept is lacking that integrates fields and agents in a way that is easy to use for modelers who are not software engineers. To address this issue, we develop a conceptual data model that represents fields and agents uniformly. We then show how the data model can be used in a high-level modelling language. The data model represents fields and agents in space-time. Also relations and networks can be represented using the same concepts. Using the conceptual data model we can represent static and mobile agents that may have spatial and temporal variation within their extent. The concepts we use are phenomenon, property set, item, property, domain and value. The phenomenon is the thing that is modelled, which can be any real world thing, for example trees. A phenomenon usually consists of several items, e.g. single trees. The domain is the spatiotemporal location and/or extent for which the items in the phenomenon are defined. Multiple different domains can coexist for a given phenomenon. For example a domain describing the extent of the trees and a domain describing the stem locations. The same goes for the property, which is an attribute of the thing that is being modeled. A property has a value, which is possibly discretized, for example the biomass over the tree crown

Ultraconserved words point to deep language ancestry across Eurasia.

Science.gov (United States)

Pagel, Mark; Atkinson, Quentin D; S Calude, Andreea; Meade, Andrew

2013-05-21

The search for ever deeper relationships among the World's languages is bedeviled by the fact that most words evolve too rapidly to preserve evidence of their ancestry beyond 5,000 to 9,000 y. On the other hand, quantitative modeling indicates that some "ultraconserved" words exist that might be used to find evidence for deep linguistic relationships beyond that time barrier. Here we use a statistical model, which takes into account the frequency with which words are used in common everyday speech, to predict the existence of a set of such highly conserved words among seven language families of Eurasia postulated to form a linguistic superfamily that evolved from a common ancestor around 15,000 y ago. We derive a dated phylogenetic tree of this proposed superfamily with a time-depth of ~14,450 y, implying that some frequently used words have been retained in related forms since the end of the last ice age. Words used more than once per 1,000 in everyday speech were 7- to 10-times more likely to show deep ancestry on this tree. Our results suggest a remarkable fidelity in the transmission of some words and give theoretical justification to the search for features of language that might be preserved across wide spans of time and geography.

An iterative method for Tikhonov regularization with a general linear regularization operator

NARCIS (Netherlands)

Hochstenbach, M.E.; Reichel, L.

2010-01-01

Tikhonov regularization is one of the most popular approaches to solve discrete ill-posed problems with error-contaminated data. A regularization operator and a suitable value of a regularization parameter have to be chosen. This paper describes an iterative method, based on Golub-Kahan

R package MVR for Joint Adaptive Mean-Variance Regularization and Variance Stabilization.

Science.gov (United States)

Dazard, Jean-Eudes; Xu, Hua; Rao, J Sunil

2011-01-01

We present an implementation in the R language for statistical computing of our recent non-parametric joint adaptive mean-variance regularization and variance stabilization procedure. The method is specifically suited for handling difficult problems posed by high-dimensional multivariate datasets ( p ≫ n paradigm), such as in 'omics'-type data, among which are that the variance is often a function of the mean, variable-specific estimators of variances are not reliable, and tests statistics have low powers due to a lack of degrees of freedom. The implementation offers a complete set of features including: (i) normalization and/or variance stabilization function, (ii) computation of mean-variance-regularized t and F statistics, (iii) generation of diverse diagnostic plots, (iv) synthetic and real 'omics' test datasets, (v) computationally efficient implementation, using C interfacing, and an option for parallel computing, (vi) manual and documentation on how to setup a cluster. To make each feature as user-friendly as possible, only one subroutine per functionality is to be handled by the end-user. It is available as an R package, called MVR ('Mean-Variance Regularization'), downloadable from the CRAN.

Conversation principles and second language utterances

Directory of Open Access Journals (Sweden)

Kaburise, Phyllis

2007-12-01

Full Text Available Conversation principles, such as those of Grice (1957, 1968, 1975, Austin (1962, Searle (1962, 1969 are formulated to enable interlocutors to interact meaningfully, in a linguistic project. Non-observance and flouting of these principles occur regularly in the verbal behaviours of users of a language, indeed, sophisticated users of a language, sometimes deliberately go against these norms, as stylistic devices in their output. When such non-conformities occur, hearers and readers resort to implicatures, maxims, inferences and their general world knowledge to interpret an utterance. Although the decision to observe some, and not all of the principles during a linguistic encounter, may seem to be taken casually, it is the contention of this paper that such decisions are made deliberately, particularly, by users of a second language. This paper attempts to identify the selection processes involved in the creation of some utterances produced by Ghanaian and Tshivenda second language users of English, using Grice’s verbal interaction maxims. The discussion will focus on the tension between semantic and pragmatic meaning, the factors involved in the creation of linguistic meaning and the role that interaction requirements such as Grice’s conversational maxims and the concept of a New Englishes approach to language play in the creation of some second language utterances.

Tree compression with top trees

DEFF Research Database (Denmark)

Bille, Philip; Gørtz, Inge Li; Landau, Gad M.

2013-01-01

We introduce a new compression scheme for labeled trees based on top trees [3]. Our compression scheme is the first to simultaneously take advantage of internal repeats in the tree (as opposed to the classical DAG compression that only exploits rooted subtree repeats) while also supporting fast...

Tree compression with top trees

DEFF Research Database (Denmark)

Bille, Philip; Gørtz, Inge Li; Landau, Gad M.

2015-01-01

We introduce a new compression scheme for labeled trees based on top trees. Our compression scheme is the first to simultaneously take advantage of internal repeats in the tree (as opposed to the classical DAG compression that only exploits rooted subtree repeats) while also supporting fast...

Regular Expression Pocket Reference

CERN Document Server

Stubblebine, Tony

2007-01-01

This handy little book offers programmers a complete overview of the syntax and semantics of regular expressions that are at the heart of every text-processing application. Ideal as a quick reference, Regular Expression Pocket Reference covers the regular expression APIs for Perl 5.8, Ruby (including some upcoming 1.9 features), Java, PHP, .NET and C#, Python, vi, JavaScript, and the PCRE regular expression libraries. This concise and easy-to-use reference puts a very powerful tool for manipulating text and data right at your fingertips. Composed of a mixture of symbols and text, regular exp

Teaching the Interlanguage: Some Experiments. Lektos: Interdisciplinary Working Papers in Language Sciences, Special Issue.

Science.gov (United States)

Wood, Richard E.

Second language instruction in the U.S. and Europe is in difficulties. The choice of a second language is artibrary and the motivation dubious. In Europe and now also in the U.S., attention has turned to the planned interlanguage Esperanto, which offers a maximally regularized structure, is considered "easy" by learners, and has the…

Mode automata and their compilation into fault trees

International Nuclear Information System (INIS)

Rauzy, Antoine

2002-01-01

In this article, we advocate the use of mode automata as a high level representation language for reliability studies. Mode automata are states/transitions based representations with the additional notion of flow. They can be seen as a generalization of both finite capacity Petri nets and block diagrams. They can be assembled into hierarchies by means of composition operations. The contribution of this article is twofold. First, we introduce mode automata and we discuss their relationship with other formalisms. Second, we propose an algorithm to compile mode automata into Boolean equations (fault trees). Such a compilation is of interest for two reasons. First, assessment tools for Boolean models are much more efficient than those for states/transitions models. Second, the automated generation of fault trees from higher level representations makes easier their maintenance through the life cycle of systems under study

Tree cover and species composition effects on academic performance of primary school students.

Science.gov (United States)

Sivarajah, Sivajanani; Smith, Sandy M; Thomas, Sean C

2018-01-01

Human exposure to green space and vegetation is widely recognized to result in physical and mental health benefits; however, to date, the specific effects of tree cover, diversity, and species composition on student academic performance have not been investigated. We compiled standardized performance scores in Grades 3 and 6 for the collective student body in 387 schools across the Toronto District School Board (TDSB), and examined variation in relation to tree cover, tree diversity, and tree species composition based on comprehensive inventories of trees on school properties combined with aerial-photo-based assessments of tree cover. Analyses accounted for variation due to socioeconomic factors using the learning opportunity index (LOI), a regional composite index of external challenges to learning that incorporates income and other factors, such as students with English as a second language. As expected, LOI had the greatest influence on student academic performance; however, the proportion of tree cover, as distinct from other types of "green space" such as grass, was found to be a significant positive predictor of student performance, accounting for 13% of the variance explained in a statistical model predicting mean student performance assessments. The effects of tree cover and species composition were most pronounced in schools that showed the highest level of external challenges, suggesting the importance of urban forestry investments in these schools.

Generalising tree traversals and tree transformations to DAGs

DEFF Research Database (Denmark)

Bahr, Patrick; Axelsson, Emil

2017-01-01

We present a recursion scheme based on attribute grammars that can be transparently applied to trees and acyclic graphs. Our recursion scheme allows the programmer to implement a tree traversal or a tree transformation and then apply it to compact graph representations of trees instead. The resul......We present a recursion scheme based on attribute grammars that can be transparently applied to trees and acyclic graphs. Our recursion scheme allows the programmer to implement a tree traversal or a tree transformation and then apply it to compact graph representations of trees instead...... as the complementing theory with a number of examples....

Language dominance shapes non-linguistic rhythmic grouping in bilinguals.

Science.gov (United States)

Molnar, Monika; Carreiras, Manuel; Gervain, Judit

2016-07-01

To what degree non-linguistic auditory rhythm perception is governed by universal biases (e.g., Iambic-Trochaic Law; Hayes, 1995) or shaped by native language experience is debated. It has been proposed that rhythmic regularities in spoken language, such as phrasal prosody affect the grouping abilities of monolinguals (e.g., Iversen, Patel, & Ohgushi, 2008). Here, we assessed the non-linguistic tone grouping biases of Spanish monolinguals, and three groups of Basque-Spanish bilinguals with different levels of Basque experience. It is usually assumed in the literature that Basque and Spanish have different phrasal prosodies and even linguistic rhythms. To confirm this, first, we quantified Basque and Spanish phrasal prosody (Experiment 1a) and duration patterns used in the classification of languages into rhythm classes (Experiment 1b). The acoustic measurements revealed that regularities in phrasal prosody systematically differ across Basque and Spanish; by contrast, the rhythms of the two languages are only minimally dissimilar. In Experiment 2, participants' non-linguistic rhythm preferences were assessed in response to non-linguistic tones alternating in either intensity (Intensity condition) or in duration (Duration condition). In the Intensity condition, all groups showed a trochaic grouping bias, as predicted by the Iambic-Trochaic Law. In the Duration Condition the Spanish monolingual and the most Basque-dominant bilingual group exhibited opposite grouping preferences in line with the phrasal prosodies of their native/dominant languages, trochaic in Basque, iambic in Spanish. The two other bilingual groups showed no significant biases, however. Overall, results indicate that duration-based grouping mechanisms are biased toward the phrasal prosody of the native and dominant language; also, the presence of an L2 in the environment interacts with the auditory biases. Copyright © 2016 Elsevier B.V. All rights reserved.

A tool for rapid post-hurricane urban tree debris estimates using high resolution aerial imagery

Science.gov (United States)

Zoltan Szantoi; Sparkle L Malone; Francisco Escobedo; Orlando Misas; Scot Smith; Bon Dewitt

2012-01-01

Coastal communities in the southeast United States have regularly experienced severe hurricane impacts. To better facilitate recovery efforts in these communities following natural disasters, state and federal agencies must respond quickly with information regarding the extent and severity of hurricane damage and the amount of tree debris volume. A tool was developed...

A comparison of common programming languages used in bioinformatics.

Science.gov (United States)

Fourment, Mathieu; Gillings, Michael R

2008-02-05

The performance of different programming languages has previously been benchmarked using abstract mathematical algorithms, but not using standard bioinformatics algorithms. We compared the memory usage and speed of execution for three standard bioinformatics methods, implemented in programs using one of six different programming languages. Programs for the Sellers algorithm, the Neighbor-Joining tree construction algorithm and an algorithm for parsing BLAST file outputs were implemented in C, C++, C#, Java, Perl and Python. Implementations in C and C++ were fastest and used the least memory. Programs in these languages generally contained more lines of code. Java and C# appeared to be a compromise between the flexibility of Perl and Python and the fast performance of C and C++. The relative performance of the tested languages did not change from Windows to Linux and no clear evidence of a faster operating system was found. Source code and additional information are available from http://www.bioinformatics.org/benchmark/. This benchmark provides a comparison of six commonly used programming languages under two different operating systems. The overall comparison shows that a developer should choose an appropriate language carefully, taking into account the performance expected and the library availability for each language.

La langue aymara: Des cimes andines a l'intelligence des ordinateurs (The Aymara Language: Andean Peaks for the Intelligence of Computers).

Science.gov (United States)

Barbin, Christina

1987-01-01

Research suggests that Aymara, an ancient language still spoken in parts of South America, may be well suited for use as a "bridge" language in translation because of its extremely regular and coherent grammar. A machine translation program using the language has already been developed. (MSE)

TreePics: visualizing trees with pictures

Directory of Open Access Journals (Sweden)

Nicolas Puillandre

2017-09-01

Full Text Available While many programs are available to edit phylogenetic trees, associating pictures with branch tips in an efficient and automatic way is not an available option. Here, we present TreePics, a standalone software that uses a web browser to visualize phylogenetic trees in Newick format and that associates pictures (typically, pictures of the voucher specimens to the tip of each branch. Pictures are visualized as thumbnails and can be enlarged by a mouse rollover. Further, several pictures can be selected and displayed in a separate window for visual comparison. TreePics works either online or in a full standalone version, where it can display trees with several thousands of pictures (depending on the memory available. We argue that TreePics can be particularly useful in a preliminary stage of research, such as to quickly detect conflicts between a DNA-based phylogenetic tree and morphological variation, that may be due to contamination that needs to be removed prior to final analyses, or the presence of species complexes.

The geometry of continuum regularization

International Nuclear Information System (INIS)

Halpern, M.B.

1987-03-01

This lecture is primarily an introduction to coordinate-invariant regularization, a recent advance in the continuum regularization program. In this context, the program is seen as fundamentally geometric, with all regularization contained in regularized DeWitt superstructures on field deformations

Equality marker in the language of bali

Science.gov (United States)

Wajdi, Majid; Subiyanto, Paulus

2018-01-01

The language of Bali could be grouped into one of the most elaborate languages of the world since the existence of its speech levels, low and high speech levels, as the language of Java has. Low and high speech levels of the language of Bali are language codes that could be used to show and express social relationship between or among its speakers. This paper focuses on describing, analyzing, and interpreting the use of the low code of the language of Bali in daily communication in the speech community of Pegayaman, Bali. Observational and documentation methods were applied to provide the data for the research. Recoding and field note techniques were executed to provide the data. Recorded in spoken language and the study of novel of Balinese were transcribed into written form to ease the process of analysis. Symmetric use of low code expresses social equality between or among the participants involves in the communication. It also implies social intimacy between or among the speakers of the language of Bali. Regular and patterned use of the low code of the language of Bali is not merely communication strategy, but it is a kind of communication agreement or communication contract between the participants. By using low code during their social and communication activities, the participants shared and express their social equality and intimacy between or among the participants involve in social and communication activities.

Supersymmetric dimensional regularization

International Nuclear Information System (INIS)

Siegel, W.; Townsend, P.K.; van Nieuwenhuizen, P.

1980-01-01

There is a simple modification of dimension regularization which preserves supersymmetry: dimensional reduction to real D < 4, followed by analytic continuation to complex D. In terms of component fields, this means fixing the ranges of all indices on the fields (and therefore the numbers of Fermi and Bose components). For superfields, it means continuing in the dimensionality of x-space while fixing the dimensionality of theta-space. This regularization procedure allows the simple manipulation of spinor derivatives in supergraph calculations. The resulting rules are: (1) First do all algebra exactly as in D = 4; (2) Then do the momentum integrals as in ordinary dimensional regularization. This regularization procedure needs extra rules before one can say that it is consistent. Such extra rules needed for superconformal anomalies are discussed. Problems associated with renormalizability and higher order loops are also discussed

BAIK– PROGRAMMING LANGUAGE BASED ON INDONESIAN LEXICAL PARSING FOR MULTITIER WEB DEVELOPMENT

Directory of Open Access Journals (Sweden)

Haris Hasanudin

2012-05-01

Full Text Available Business software development with global team is increasing rapidly and the programming language as development tool takes the important role in the global web development. The real user friendly programming language should be written in local language for programmer who has native language is not in English. This paper presents our design of BAIK (Bahasa Anak Indonesia untuk Komputerscripting language which syntax is modeled with Bahasa Indonesian for multitier web development. Researcher propose the implementation of Indonesian Parsing Engine and Binary Search Tree structure for memory allocation of variable and compose the language features that support basic Object Oriented Programming, Common Gateway Interface, HTML style manipulation and database connection. Our goal is to build real programming language from simple structure design for web development using Indonesian lexical words. Pengembangan bisnis perangkat lunak dalam tim berskala global meningkat dengan cepat dan bahasa pemrograman berperan penting dalam pengembangan web secara global. Bahasa pemrograman yang benar-benar ramah terhadap pengguna harus ditulis dalam bahasa lokal programmer yang bahasa ibunya bukan Bahasa Inggris. Paper ini menyajikan desain dari bahasa penulisan BAIK (Bahasa Anak Indonesia untuk Komputer, yang sintaksisnya dimodelkan dengan Bahasa Indonesia untuk pengembangan web multitier. Peneliti mengusulkan implementasi dari parsing engine Bahasa Indonesia dan struktur binary search tree untuk alokasi memori terhadap variabel, serta membuat fitur bahasa yang mendukung dasar pemrograman berbasis objek, common gateway interface, manipulasi gaya HTML, dan koneksi basis data. Tujuan penelitian ini adalah untuk menciptakan bahasa pemrograman yang sesungguhnya dan menggunakan desain struktur sederhana untuk pengembangan web dengan menggunakan kata-kata dari Bahasa Indonesia.

Harmonic R-matrices for scattering amplitudes and spectral regularization

Energy Technology Data Exchange (ETDEWEB)

Ferro, Livia; Plefka, Jan [Humboldt-Universitaet, Berlin (Germany). Inst. fuer Physik; Lukowski, Tomasz [Humboldt-Universitaet, Berlin (Germany). Inst. fuer Physik; Humboldt-Universitaet, Berlin (Germany). Inst. fuer Mathematik; Humboldt-Univ. Berlin (Germany). IRIS Adlershof; Meneghelli, Carlo [Hamburg Univ. (Germany). Fachbereich 11 - Mathematik; Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany). Theory Group; Staudacher, Matthias [Humboldt-Universitaet, Berlin (Germany). Inst. fuer Mathematik; Humboldt-Universitaet, Berlin (Germany). Inst. fuer Physik; Max-Planck-Institut fuer Gravitationsphysik (Albert-Einstein-Institut), Potsdam (Germany)

2012-12-15

Planar N=4 super Yang-Mills appears to be integrable. While this allows to find this theory's exact spectrum, integrability has hitherto been of no direct use for scattering amplitudes. To remedy this, we deform all scattering amplitudes by a spectral parameter. The deformed tree-level four-point function turns out to be essentially the one-loop R-matrix of the integrable N=4 spin chain satisfying the Yang-Baxter equation. Deformed on-shell three-point functions yield novel three-leg R-matrices satisfying bootstrap equations. Finally, we supply initial evidence that the spectral parameter might find its use as a novel symmetry-respecting regulator replacing dimensional regularization. Its physical meaning is a local deformation of particle helicity, a fact which might be useful for a much larger class of non-integrable four-dimensional field theories.

Building a Tree Structure: The Development of Hierarchical Complexity and Interrupted Strategies in Children's Construction Activity

Science.gov (United States)

Greenfield, Patricia Marks; Schneider, Leslie

1977-01-01

This study examined the construction of a mobile with plastic construction straws in order to study the development of tree representations in a domain other than language. Subjects were 70 children between the ages of 3 and 11. (Author/JMB)

The Storage and Composition of Inflected Forms in Adult-Learned Second Language: A Study of the Influence of Length of Residence, Age of Arrival, Sex, and Other Factors

Science.gov (United States)

Babcock, Laura; Stowe, John C.; Maloof, Christopher J.; Brovetto, Claudia; Ullman, Michael T.

2012-01-01

It remains unclear whether adult-learned second language (L2) depends on similar or different neurocognitive mechanisms as those involved in first language (L1). We examined whether English past tense forms are computed similarly or differently by L1 and L2 English speakers, and what factors might affect this: regularity (regular vs. irregular…

Regularization by External Variables

DEFF Research Database (Denmark)

Bossolini, Elena; Edwards, R.; Glendinning, P. A.

2016-01-01

Regularization was a big topic at the 2016 CRM Intensive Research Program on Advances in Nonsmooth Dynamics. There are many open questions concerning well known kinds of regularization (e.g., by smoothing or hysteresis). Here, we propose a framework for an alternative and important kind of regula......Regularization was a big topic at the 2016 CRM Intensive Research Program on Advances in Nonsmooth Dynamics. There are many open questions concerning well known kinds of regularization (e.g., by smoothing or hysteresis). Here, we propose a framework for an alternative and important kind...

Regular Single Valued Neutrosophic Hypergraphs

Directory of Open Access Journals (Sweden)

Muhammad Aslam Malik

2016-12-01

Full Text Available In this paper, we define the regular and totally regular single valued neutrosophic hypergraphs, and discuss the order and size along with properties of regular and totally regular single valued neutrosophic hypergraphs. We also extend work on completeness of single valued neutrosophic hypergraphs.

ColorTree: a batch customization tool for phylogenic trees.

Science.gov (United States)

Chen, Wei-Hua; Lercher, Martin J

2009-07-31

Genome sequencing projects and comparative genomics studies typically aim to trace the evolutionary history of large gene sets, often requiring human inspection of hundreds of phylogenetic trees. If trees are checked for compatibility with an explicit null hypothesis (e.g., the monophyly of certain groups), this daunting task is greatly facilitated by an appropriate coloring scheme. In this note, we introduce ColorTree, a simple yet powerful batch customization tool for phylogenic trees. Based on pattern matching rules, ColorTree applies a set of customizations to an input tree file, e.g., coloring labels or branches. The customized trees are saved to an output file, which can then be viewed and further edited by Dendroscope (a freely available tree viewer). ColorTree runs on any Perl installation as a stand-alone command line tool, and its application can thus be easily automated. This way, hundreds of phylogenic trees can be customized for easy visual inspection in a matter of minutes. ColorTree allows efficient and flexible visual customization of large tree sets through the application of a user-supplied configuration file to multiple tree files.

The Language of Teaching Mathematics: Implications for Training ITAs.

Science.gov (United States)

Byrd, Patricia; Constantinides, Janet C.

1992-01-01

Because of national concern about the effect of having basic college mathematics courses taught by so many international teaching assistants whose English skills may be limited, this paper reports on the use of language in teaching by regular college faculty, rather than teaching assistants, at Georgia State University. (eight references)…

Detecting evolutionary forces in language change.

Science.gov (United States)

Newberry, Mitchell G; Ahern, Christopher A; Clark, Robin; Plotkin, Joshua B

2017-11-09

Both language and genes evolve by transmission over generations with opportunity for differential replication of forms. The understanding that gene frequencies change at random by genetic drift, even in the absence of natural selection, was a seminal advance in evolutionary biology. Stochastic drift must also occur in language as a result of randomness in how linguistic forms are copied between speakers. Here we quantify the strength of selection relative to stochastic drift in language evolution. We use time series derived from large corpora of annotated texts dating from the 12th to 21st centuries to analyse three well-known grammatical changes in English: the regularization of past-tense verbs, the introduction of the periphrastic 'do', and variation in verbal negation. We reject stochastic drift in favour of selection in some cases but not in others. In particular, we infer selection towards the irregular forms of some past-tense verbs, which is likely driven by changing frequencies of rhyming patterns over time. We show that stochastic drift is stronger for rare words, which may explain why rare forms are more prone to replacement than common ones. This work provides a method for testing selective theories of language change against a null model and reveals an underappreciated role for stochasticity in language evolution.

Hierarchical levels of representation in language prediction: The influence of first language acquisition in highly proficient bilinguals.

Science.gov (United States)

Molinaro, Nicola; Giannelli, Francesco; Caffarra, Sendy; Martin, Clara

2017-07-01

Language comprehension is largely supported by predictive mechanisms that account for the ease and speed with which communication unfolds. Both native and proficient non-native speakers can efficiently handle contextual cues to generate reliable linguistic expectations. However, the link between the variability of the linguistic background of the speaker and the hierarchical format of the representations predicted is still not clear. We here investigate whether native language exposure to typologically highly diverse languages (Spanish and Basque) affects the way early balanced bilingual speakers carry out language predictions. During Spanish sentence comprehension, participants developed predictions of words the form of which (noun ending) could be either diagnostic of grammatical gender values (transparent) or totally ambiguous (opaque). We measured electrophysiological prediction effects time-locked both to the target word and to its determiner, with the former being expected or unexpected. Event-related (N200-N400) and oscillatory activity in the low beta-band (15-17Hz) frequency channel showed that both Spanish and Basque natives optimally carry out lexical predictions independently of word transparency. Crucially, in contrast to Spanish natives, Basque natives displayed visual word form predictions for transparent words, in consistency with the relevance that noun endings (post-nominal suffixes) play in their native language. We conclude that early language exposure largely shapes prediction mechanisms, so that bilinguals reading in their second language rely on the distributional regularities that are highly relevant in their first language. More importantly, we show that individual linguistic experience hierarchically modulates the format of the predicted representation. Copyright © 2017 Elsevier B.V. All rights reserved.

A method for investigating relative timing information on phylogenetic trees.

Science.gov (United States)

Ford, Daniel; Matsen, Frederick A; Stadler, Tanja

2009-04-01

In this paper, we present a new way to describe the timing of branching events in phylogenetic trees. Our description is in terms of the relative timing of diversification events between sister clades; as such it is complementary to existing methods using lineages-through-time plots which consider diversification in aggregate. The method can be applied to look for evidence of diversification happening in lineage-specific "bursts", or the opposite, where diversification between 2 clades happens in an unusually regular fashion. In order to be able to distinguish interesting events from stochasticity, we discuss 2 classes of neutral models on trees with relative timing information and develop a statistical framework for testing these models. These model classes include both the coalescent with ancestral population size variation and global rate speciation-extinction models. We end the paper with 2 example applications: first, we show that the evolution of the hepatitis C virus deviates from the coalescent with arbitrary population size. Second, we analyze a large tree of ants, demonstrating that a period of elevated diversification rates does not appear to have occurred in a bursting manner.

Tree Colors: Color Schemes for Tree-Structured Data.

Science.gov (United States)

Tennekes, Martijn; de Jonge, Edwin

2014-12-01

We present a method to map tree structures to colors from the Hue-Chroma-Luminance color model, which is known for its well balanced perceptual properties. The Tree Colors method can be tuned with several parameters, whose effect on the resulting color schemes is discussed in detail. We provide a free and open source implementation with sensible parameter defaults. Categorical data are very common in statistical graphics, and often these categories form a classification tree. We evaluate applying Tree Colors to tree structured data with a survey on a large group of users from a national statistical institute. Our user study suggests that Tree Colors are useful, not only for improving node-link diagrams, but also for unveiling tree structure in non-hierarchical visualizations.

On a correspondence between regular and non-regular operator monotone functions

DEFF Research Database (Denmark)

Gibilisco, P.; Hansen, Frank; Isola, T.

2009-01-01

We prove the existence of a bijection between the regular and the non-regular operator monotone functions satisfying a certain functional equation. As an application we give a new proof of the operator monotonicity of certain functions related to the Wigner-Yanase-Dyson skew information....

Semantic and stylistic pecularities of Slavicisms in language of modern newspapers

Directory of Open Access Journals (Sweden)

Жанар Кабдыляшымовна Киынова

2012-12-01

Full Text Available In article functioning of slavonicims in language of modern Kazakhstan and Russian newspapers is considered. On the basis of examples, ekstserpirovanny from modern newspapers, the informative picture about tendencies and regularities of modern word usage in mass media is given.

Some Benefits of Corpora as a Language Learning Tool

Science.gov (United States)

Marjanovic, Tatjana

2012-01-01

What this paper is meant to do is share illustrations and insights into how English learners and teachers alike can benefit from using corpora in their work. Arguments are made for their multifaceted possibilities as grammatical, lexical and discourse pools suitable for discovering ways of the language, be they regularities or idiosyncrasies. The…

TreePOD: Sensitivity-Aware Selection of Pareto-Optimal Decision Trees.

Science.gov (United States)

Muhlbacher, Thomas; Linhardt, Lorenz; Moller, Torsten; Piringer, Harald

2018-01-01

Balancing accuracy gains with other objectives such as interpretability is a key challenge when building decision trees. However, this process is difficult to automate because it involves know-how about the domain as well as the purpose of the model. This paper presents TreePOD, a new approach for sensitivity-aware model selection along trade-offs. TreePOD is based on exploring a large set of candidate trees generated by sampling the parameters of tree construction algorithms. Based on this set, visualizations of quantitative and qualitative tree aspects provide a comprehensive overview of possible tree characteristics. Along trade-offs between two objectives, TreePOD provides efficient selection guidance by focusing on Pareto-optimal tree candidates. TreePOD also conveys the sensitivities of tree characteristics on variations of selected parameters by extending the tree generation process with a full-factorial sampling. We demonstrate how TreePOD supports a variety of tasks involved in decision tree selection and describe its integration in a holistic workflow for building and selecting decision trees. For evaluation, we illustrate a case study for predicting critical power grid states, and we report qualitative feedback from domain experts in the energy sector. This feedback suggests that TreePOD enables users with and without statistical background a confident and efficient identification of suitable decision trees.

Photoperiod- and temperature-mediated control of growth cessation and dormancy in trees: a molecular perspective.

Science.gov (United States)

Maurya, Jay P; Bhalerao, Rishikesh P

2017-09-01

How plants adapt their developmental patterns to regular seasonal changes is an important question in biology. The annual growth cycle in perennial long-lived trees is yet another example of how plants can adapt to seasonal changes. The two main signals that plants rely on to respond to seasonal changes are photoperiod and temperature, and these signals have critical roles in the temporal regulation of the annual growth cycle of trees. This review presents the latest findings to provide insight into the molecular mechanisms that underlie how photoperiodic and temperature signals regulate seasonal growth in trees. The results point to a high level of conservation in the signalling pathways that mediate photoperiodic control of seasonal growth in trees and flowering in annual plants such as arabidopsis. Furthermore, the data indicate that symplastic communication may mediate certain aspects of seasonal growth. Although considerable insight into the control of phenology in model plants such as poplar and spruce has been obtained, the future challenge is extending these studies to other, non-model trees. © The Author 2017. Published by Oxford University Press on behalf of the Annals of Botany Company. All rights reserved. For Permissions, please email: journals.permissions@oup.com

Two Trees: Migrating Fault Trees to Decision Trees for Real Time Fault Detection on International Space Station

Science.gov (United States)

Lee, Charles; Alena, Richard L.; Robinson, Peter

2004-01-01

We started from ISS fault trees example to migrate to decision trees, presented a method to convert fault trees to decision trees. The method shows that the visualizations of root cause of fault are easier and the tree manipulating becomes more programmatic via available decision tree programs. The visualization of decision trees for the diagnostic shows a format of straight forward and easy understands. For ISS real time fault diagnostic, the status of the systems could be shown by mining the signals through the trees and see where it stops at. The other advantage to use decision trees is that the trees can learn the fault patterns and predict the future fault from the historic data. The learning is not only on the static data sets but also can be online, through accumulating the real time data sets, the decision trees can gain and store faults patterns in the trees and recognize them when they come.

Stochastic analytic regularization

International Nuclear Information System (INIS)

Alfaro, J.

1984-07-01

Stochastic regularization is reexamined, pointing out a restriction on its use due to a new type of divergence which is not present in the unregulated theory. Furthermore, we introduce a new form of stochastic regularization which permits the use of a minimal subtraction scheme to define the renormalized Green functions. (author)

Testing aggregation hypotheses among Neotropical trees and shrubs: results from a 50-ha plot over 20 years of sampling.

Science.gov (United States)

Myster, Randall W; Malahy, Michael P

2012-09-01

Spatial patterns of tropical trees and shrubs are important to understanding their interaction and the resultant structure of tropical rainforests. To assess this issue, we took advantage of previously collected data, on Neotropical tree and shrub stem identified to species and mapped for spatial coordinates in a 50ha plot, with a frequency of every five years and over a 20 year period. These stems data were first placed into four groups, regardless of species, depending on their location in the vertical strata of the rainforest (shrubs, understory trees, mid-sized trees, tall trees) and then used to generate aggregation patterns for each sampling year. We found shrubs and understory trees clumped at small spatial scales of a few meters for several of the years sampled. Alternatively, mid-sized trees and tall trees did not clump, nor did they show uniform (regular) patterns, during any sampling period. In general (1) groups found higher in the canopy did not show aggregation on the ground and (2) the spatial patterns of all four groups showed similarity among different sampling years, thereby supporting a "shifting mosaic" view of plant communities over large areas. Spatial analysis, such as this one, are critical to understanding and predicting tree spaces, tree-tree replacements and the Neotropical forest patterns, such as biodiversity and those needed for sustainability efforts, they produce.

Subthalamic nucleus deep brain stimulation impacts language in early Parkinson's disease.

Directory of Open Access Journals (Sweden)

Lara Phillips

Full Text Available Although deep brain stimulation (DBS of the basal ganglia improves motor outcomes in Parkinson's disease (PD, its effects on cognition, including language, remain unclear. This study examined the impact of subthalamic nucleus (STN DBS on two fundamental capacities of language, grammatical and lexical functions. These functions were tested with the production of regular and irregular past-tenses, which contrast aspects of grammatical (regulars and lexical (irregulars processing while controlling for multiple potentially confounding factors. Aspects of the motor system were tested by contrasting the naming of manipulated (motor and non-manipulated (non-motor objects. Performance was compared between healthy controls and early-stage PD patients treated with either DBS/medications or medications alone. Patients were assessed on and off treatment, with controls following a parallel testing schedule. STN-DBS improved naming of manipulated (motor but not non-manipulated (non-motor objects, as compared to both controls and patients with just medications, who did not differ from each other across assessment sessions. In contrast, STN-DBS led to worse performance at regulars (grammar but not irregulars (lexicon, as compared to the other two subject groups, who again did not differ. The results suggest that STN-DBS negatively impacts language in early PD, but may be specific in depressing aspects of grammatical and not lexical processing. The finding that STN-DBS affects both motor and grammar (but not lexical functions strengthens the view that both depend on basal ganglia circuitry, although the mechanisms for its differential impact on the two (improved motor, impaired grammar remain to be elucidated.

The music of trees: the intergenerative tie between primary care and public health.

Science.gov (United States)

Whitehouse, Peter

2016-01-01

Stories help us frame and understand complex ideas and challenges. Metaphors are particularly powerful linguistic devices that guide and extend our thinking by bridging conceptual domains, for example to consider the brain as a digital computer. Trees are widely used as metaphors for broad concepts like evolution, history, society, and even life itself, i.e. 'the tree of life'. Tree-like diagrams of roots and branches are used to demonstrate historical and cultural relationships, for example, between different species or different languages. In this paper, we describe a theatrical character called a tree doctor which is a living metaphor. A human being, namely the author, lectures, acts or dances as a tree and offers lessons to Homo Sapiens about 'holistic' ideas of health. The character teaches us to not only see the value of our relationships to trees, but the importance of seeing forests as well the individual trees. The metaphorical statement that we should not 'miss the forest for the trees' means we should learn to think of health embedded in systems and communities. In medicine, we too often focus on individual molecules, pharmaceuticals, or even patients and miss the bigger picture of public and environmental health. In a time of great ecological system change, the tree doctor points to broad ethical responsibility for each other and future generations of humans and other living creatures. The character embraces arts and particularly music as a powerful way of infusing purpose and improving the qualities of our lives together, especially as we age. The tree doctor knows the value of intergenerational relationships. But it also points to intergenerative innovations across many cultural domains, disciplines and professions. The tree doctor supports primary care and empowers the value of intergenerational relationships, art and music in the recommendations doctors make to patients to improve their health and well-being.

The fundamental units, processes and patterns of evolution, and the Tree of Life conundrum

Directory of Open Access Journals (Sweden)

Wolf Yuri I

2009-09-01

Full Text Available Abstract Background The elucidation of the dominant role of horizontal gene transfer (HGT in the evolution of prokaryotes led to a severe crisis of the Tree of Life (TOL concept and intense debates on this subject. Concept Prompted by the crisis of the TOL, we attempt to define the primary units and the fundamental patterns and processes of evolution. We posit that replication of the genetic material is the singular fundamental biological process and that replication with an error rate below a certain threshold both enables and necessitates evolution by drift and selection. Starting from this proposition, we outline a general concept of evolution that consists of three major precepts. 1. The primary agency of evolution consists of Fundamental Units of Evolution (FUEs, that is, units of genetic material that possess a substantial degree of evolutionary independence. The FUEs include both bona fide selfish elements such as viruses, viroids, transposons, and plasmids, which encode some of the information required for their own replication, and regular genes that possess quasi-independence owing to their distinct selective value that provides for their transfer between ensembles of FUEs (genomes and preferential replication along with the rest of the recipient genome. 2. The history of replication of a genetic element without recombination is isomorphously represented by a directed tree graph (an arborescence, in the graph theory language. Recombination within a FUE is common between very closely related sequences where homologous recombination is feasible but becomes negligible for longer evolutionary distances. In contrast, shuffling of FUEs occurs at all evolutionary distances. Thus, a tree is a natural representation of the evolution of an individual FUE on the macro scale, but not of an ensemble of FUEs such as a genome. 3. The history of life is properly represented by the "forest" of evolutionary trees for individual FUEs (Forest of Life, or

Acquired Dyslexia in a Transparent Orthography: An Analysis of Acquired Disorders of Reading in the Slovak Language

Directory of Open Access Journals (Sweden)

Marianna Hricová

2012-01-01

Full Text Available The first reports of phonological, surface and deep dyslexia come from orthographies containing quasi-regular mappings between orthography and phonology including English and French. Slovakian is a language with a relatively transparent orthography and hence a mostly regular script. The aim of this study was to investigate impaired oral reading in Slovakian. A novel diagnostic procedure was devised to determine whether disorders of Slovakian reading resemble characteristics in other languages. Slovakian speaking aphasics showed symptoms similar to phonological dyslexia and deep dyslexia in English and French, but there was no evidence of surface dyslexia. The findings are discussed in terms of the orthographic depth hypothesis.

Ultimate Attainment in Late Second Language Acquisition: Phonetic and Grammatical Challenges in Advanced Dutch-English Bilingualism

Science.gov (United States)

Schmid, Monika S.; Gilbers, Steven; Nota, Amber

2014-01-01

The present article provides an exploration of ultimate attainment in second language (L2) and its limitations. It is argued that the question of maturational constraints can best be investigated when the reference population is bilingual and exposed on a regular basis to varieties of their first language (L1) that show cross-linguistic influence.…

Podcasts as a Learning Tool: German Language and Culture Every Day

Science.gov (United States)

Schmidt, Johannes

2008-01-01

Podcasts provide a straightforward opportunity to stay connected with language, culture, and recent events of German-speaking countries. Podcasts offer clearly articulated, authentic material that can be automatically and regularly delivered to your computer and classrooms; continuously exposing students and teachers to German. This article…

Visual language recognition with a feed-forward network of spiking neurons

Energy Technology Data Exchange (ETDEWEB)

Rasmussen, Craig E [Los Alamos National Laboratory; Garrett, Kenyan [Los Alamos National Laboratory; Sottile, Matthew [GALOIS; Shreyas, Ns [INDIANA UNIV.

2010-01-01

An analogy is made and exploited between the recognition of visual objects and language parsing. A subset of regular languages is used to define a one-dimensional 'visual' language, in which the words are translational and scale invariant. This allows an exploration of the viewpoint invariant languages that can be solved by a network of concurrent, hierarchically connected processors. A language family is defined that is hierarchically tiling system recognizable (HREC). As inspired by nature, an algorithm is presented that constructs a cellular automaton that recognizes strings from a language in the HREC family. It is demonstrated how a language recognizer can be implemented from the cellular automaton using a feed-forward network of spiking neurons. This parser recognizes fixed-length strings from the language in parallel and as the computation is pipelined, a new string can be parsed in each new interval of time. The analogy with formal language theory allows inferences to be drawn regarding what class of objects can be recognized by visual cortex operating in purely feed-forward fashion and what class of objects requires a more complicated network architecture.

Frost hardening and dehardening potential in temperate trees from winter to budburst.

Science.gov (United States)

Vitra, Amarante; Lenz, Armando; Vitasse, Yann

2017-10-01

We investigated how deciduous trees can adjust their freezing resistance in response to temperature during the progress of the ecodormancy phase, from midwinter to budburst. We regularly sampled twigs of four different temperate deciduous tree species from January to the leaf-out date. Using computer-controlled freezers and climate chambers, the freezing resistance of buds was measured directly after sampling and also after the application of artificial hardening and dehardening treatments, simulating cold and warm spells. The thermal time to budburst in forcing conditions (c. 20°C) was also quantified at each sampling as a proxy for dormancy depth. Earlier flushing species showed higher freezing resistance than late flushing species at either similar bud development stage or similar dormancy depth. Overall, freezing resistance and its hardening and dehardening potential dramatically decreased during the progress of ecodormancy and became almost nil during budburst. Our results suggest that extreme cold events in winter are not critical for trees, as freezing resistance can be largely enhanced during this period. By contrast, the timing of budburst is a critical component of tree fitness. Our results provide quantitative values of the freezing resistance dynamics during ecodormancy, particularly valuable in process-based species distribution models. © 2017 The Authors. New Phytologist © 2017 New Phytologist Trust.

Tree Nut Allergies

Science.gov (United States)

... Blog Vision Awards Common Allergens Tree Nut Allergy Tree Nut Allergy Learn about tree nut allergy, how ... a Tree Nut Label card . Allergic Reactions to Tree Nuts Tree nuts can cause a severe and ...

Language performance in siblings of nonverbal children with autism.

Science.gov (United States)

Levy, Yonata; Bar-Yuda, Chanit

2011-05-01

The study focuses on language and cognitive abilities of siblings of the linguistically most affected children with autism (i.e. siblings of nonverbal children - SIBS-ANV). Twenty-eight SIBS-ANV (17 boys), ages 4-9 years, took part in the study. All children attended regular schools, and none had received a diagnosis of autism. Controls were 27 typically developing children (SIBS-TD; 16 boys) matched to the SIBS-ANV on age, family background, socioeconomic status and type of school they attended. Significant IQ differences, as well as language differences as measured on the Clinical Evaluation of Language Fundamentals (CELF), emerged between SIBS-ANV and SIBS-TD. However, differences in the language scores mostly disappeared when PIQ and FSIQ were controlled for. Furthermore, grammatical analysis of spontaneous speech samples produced in the course of testing did not reveal any significant differences between the groups. These results add to recent work suggesting that language deficits may not be part of the Broad Autism Phenotype (BAP). It further suggests that the cognitive deficit characteristic of nonverbal people with autism may be familial.

Profile of language and cognitive functions in children with dyslexia in speakers of Brazilian Portuguese.

Science.gov (United States)

Barbosa, Thais; Rodrigues, Camila Cruz; Toledo-Piza, Carolina Mattar; Navas, Ana Luiza Gomes Pinto; Bueno, Orlando Francisco Amodeu

2015-01-01

To verify the language and cognitive profile of children with dyslexia, contributing to the diagnosis of this condition in readers of a regular orthography, such as Brazilian Portuguese. In this study, 47 children with dyslexia (GD) and two controlled groups, one composed of 41 age controls (GCI) and the other with 31 reading controls (GCL), participated. All children were submitted to a battery involving the above-mentioned abilities. GD demonstrated predominant deficits in phonological processing, which were not compatible with a delay in the development of such abilities, indicating an atypical development. The GD also obtained lower scores in both basic and more complex reading and writing skills (i.e., letters, words, pseudowords, and texts, respectively), as well as in other domains, such as language (syntactic processing and oral sentence comprehension), which may be a result of a deficit in phonological skills, that interfered with higher complexity linguistic skills. Phonological abilities demonstrated to be the main difficulty observed in children with dyslexia investigated in this study, corroborating previous studies in other languages. This demonstrates that, independently of the language regularity, phonological skills are fundamental to the diagnosis of developmental dyslexia.

All together now: concurrent learning of multiple structures in an artificial language.

Science.gov (United States)

Romberg, Alexa R; Saffran, Jenny R

2013-01-01

Natural languages contain many layers of sequential structure, from the distribution of phonemes within words to the distribution of phrases within utterances. However, most research modeling language acquisition using artificial languages has focused on only one type of distributional structure at a time. In two experiments, we investigated adult learning of an artificial language that contains dependencies between both adjacent and non-adjacent words. We found that learners rapidly acquired both types of regularities and that the strength of the adjacent statistics influenced learning of both adjacent and non-adjacent dependencies. Additionally, though accuracy was similar for both types of structure, participants' knowledge of the deterministic non-adjacent dependencies was more explicit than their knowledge of the probabilistic adjacent dependencies. The results are discussed in the context of current theories of statistical learning and language acquisition. © 2013 Cognitive Science Society, Inc.

Parents' Expression and Discussion of Emotion in the Multilingual Family: Does Language Matter?

Science.gov (United States)

Chen, Stephen H; Kennedy, Morgan; Zhou, Qing

2012-07-01

Parents regularly use words to express and discuss emotion with their children, but does it matter which language they use to do so? In this article, we examine this question in the multilingual family context by integrating findings from both psychological and linguistic research. We propose that parents' use of different languages for emotional expression or discussion holds significant implications for children's emotional experience, understanding, and regulation. Finally, we suggest that an understanding of the implications of emotion-related language shifts is critical, particularly in adapting interventions within a rapidly diversifying society. © The Author(s) 2012.

CONSEL: for assessing the confidence of phylogenetic tree selection.

Science.gov (United States)

Shimodaira, H; Hasegawa, M

2001-12-01

CONSEL is a program to assess the confidence of the tree selection by giving the p-values for the trees. The main thrust of the program is to calculate the p-value of the Approximately Unbiased (AU) test using the multi-scale bootstrap technique. This p-value is less biased than the other conventional p-values such as the Bootstrap Probability (BP), the Kishino-Hasegawa (KH) test, the Shimodaira-Hasegawa (SH) test, and the Weighted Shimodaira-Hasegawa (WSH) test. CONSEL calculates all these p-values from the output of the phylogeny program packages such as Molphy, PAML, and PAUP*. Furthermore, CONSEL is applicable to a wide class of problems where the BPs are available. The programs are written in C language. The source code for Unix and the executable binary for DOS are found at http://www.ism.ac.jp/~shimo/ shimo@ism.ac.jp

Effect of different tree mortality patterns on stand development in the forest model SIBYLA

Directory of Open Access Journals (Sweden)

Trombik Jiří

2016-09-01

Full Text Available Forest mortality critically affects stand structure and the quality of ecosystem services provided by forests. Spruce bark beetle (Ips typographus generates rather complex infestation and mortality patterns, and implementation of such patterns in forest models is challenging. We present here the procedure, which allows to simulate the bark beetle-related tree mortality in the forest dynamics model Sibyla. We explored how sensitive various production and stand structure indicators are to tree mortality patterns, which can be generated by bark beetles. We compared the simulation outputs for three unmanaged forest stands with 40, 70 and 100% proportion of spruce as affected by the disturbance-related mortality that occurred in a random pattern and in a patchy pattern. The used tree species and age class-specific mortality rates were derived from the disturbance-related mortality records from Slovakia. The proposed algorithm was developed in the SQLite using the Python language, and the algorithm allowed us to define the degree of spatial clustering of dead trees ranging from a random distribution to a completely clustered distribution; a number of trees that died in either mode is set to remain equal. We found significant differences between the long-term developments of the three investigated forest stands, but we found very little effect of the tested mortality modes on stand increment, tree species composition and diversity, and tree size diversity. Hence, our hypothesis that the different pattern of dead trees emergence should affect the competitive interactions between trees and regeneration, and thus affect selected productivity and stand structure indicators was not confirmed.

Big trees, old trees, and growth factor tables

Science.gov (United States)

Kevin T. Smith

2018-01-01

The potential for a tree to reach a great size and to live a long life frequently captures the public's imagination. Sometimes the desire to know the age of an impressively large tree is simple curiosity. For others, the date-of-tree establishment can make a big diff erence for management, particularly for trees at historic sites or those mentioned in property...

A Suffix Tree Or Not a Suffix Tree?

DEFF Research Database (Denmark)

Starikovskaya, Tatiana; Vildhøj, Hjalte Wedel

2015-01-01

In this paper we study the structure of suffix trees. Given an unlabeled tree r on n nodes and suffix links of its internal nodes, we ask the question “Is r a suffix tree?”, i.e., is there a string S whose suffix tree has the same topological structure as r? We place no restrictions on S, in part...

Effective field theory dimensional regularization

International Nuclear Information System (INIS)

Lehmann, Dirk; Prezeau, Gary

2002-01-01

A Lorentz-covariant regularization scheme for effective field theories with an arbitrary number of propagating heavy and light particles is given. This regularization scheme leaves the low-energy analytic structure of Greens functions intact and preserves all the symmetries of the underlying Lagrangian. The power divergences of regularized loop integrals are controlled by the low-energy kinematic variables. Simple diagrammatic rules are derived for the regularization of arbitrary one-loop graphs and the generalization to higher loops is discussed

Effective field theory dimensional regularization

Science.gov (United States)

Lehmann, Dirk; Prézeau, Gary

2002-01-01

A Lorentz-covariant regularization scheme for effective field theories with an arbitrary number of propagating heavy and light particles is given. This regularization scheme leaves the low-energy analytic structure of Greens functions intact and preserves all the symmetries of the underlying Lagrangian. The power divergences of regularized loop integrals are controlled by the low-energy kinematic variables. Simple diagrammatic rules are derived for the regularization of arbitrary one-loop graphs and the generalization to higher loops is discussed.

A Longitudinal Assessment of Early Childhood Education with Integrated Speech Therapy for Children with Significant Language Impairment in Germany

Science.gov (United States)

Ullrich, Dieter; Ullrich, Katja; Marten, Magret

2014-01-01

Background: In Lower Saxony, Germany, pre-school children with language- and speech-deficits have the opportunity to access kindergartens with integrated language-/speech therapy prior to attending primary school, both regular or with integrated speech therapy. It is unknown whether these early childhood education treatments are helpful and…

Tree-growth analyses to estimate tree species' drought tolerance

NARCIS (Netherlands)

Eilmann, B.; Rigling, A.

2012-01-01

Climate change is challenging forestry management and practices. Among other things, tree species with the ability to cope with more extreme climate conditions have to be identified. However, while environmental factors may severely limit tree growth or even cause tree death, assessing a tree

Hierarchical regular small-world networks

International Nuclear Information System (INIS)

Boettcher, Stefan; Goncalves, Bruno; Guclu, Hasan

2008-01-01

Two new networks are introduced that resemble small-world properties. These networks are recursively constructed but retain a fixed, regular degree. They possess a unique one-dimensional lattice backbone overlaid by a hierarchical sequence of long-distance links, mixing real-space and small-world features. Both networks, one 3-regular and the other 4-regular, lead to distinct behaviors, as revealed by renormalization group studies. The 3-regular network is planar, has a diameter growing as √N with system size N, and leads to super-diffusion with an exact, anomalous exponent d w = 1.306..., but possesses only a trivial fixed point T c = 0 for the Ising ferromagnet. In turn, the 4-regular network is non-planar, has a diameter growing as ∼2 √(log 2 N 2 ) , exhibits 'ballistic' diffusion (d w = 1), and a non-trivial ferromagnetic transition, T c > 0. It suggests that the 3-regular network is still quite 'geometric', while the 4-regular network qualifies as a true small world with mean-field properties. As an engineering application we discuss synchronization of processors on these networks. (fast track communication)

Gene flow among established Puerto Rican populations of the exotic tree species, Albizia lebbeck.

Science.gov (United States)

Dunphy, B K; Hamrick, J L

2005-04-01

We estimate gene flow and patterns of genetic diversity in Albizia lebbeck, an invasive leguminous tree in the dry forest of southwestern Puerto Rico. Genetic diversity estimates calculated for 10 populations of 24 trees each indicated that these populations may have been formed from multiple introductions. The presence of unique genotypes in the northernmost populations suggests that novel genotypes are still immigrating into the area. This combination of individuals from disparate locations led to high estimates of genetic diversity (He = 0.266, P = 0.67). Indirect estimates of gene flow indicate that only 0.69 migrants per generation move between populations, suggesting that genetic diversity within populations should decrease due to genetic drift. Since migration-drift equilibrium was not found, however, this estimate needs to be viewed with caution. The regular production of pods in this outcrossing species (tm = 0.979) indicates that sufficient outcross pollen is received to insure successful reproduction. Direct estimates of gene flow indicate that between 44 and 100% of pollen received by trees in four small stands of trees (n < 11) was foreign. The role of gene flow in facilitating the spread of this invasive plant species is discussed.

TreeNetViz: revealing patterns of networks over tree structures.

Science.gov (United States)

Gou, Liang; Zhang, Xiaolong Luke

2011-12-01

Network data often contain important attributes from various dimensions such as social affiliations and areas of expertise in a social network. If such attributes exhibit a tree structure, visualizing a compound graph consisting of tree and network structures becomes complicated. How to visually reveal patterns of a network over a tree has not been fully studied. In this paper, we propose a compound graph model, TreeNet, to support visualization and analysis of a network at multiple levels of aggregation over a tree. We also present a visualization design, TreeNetViz, to offer the multiscale and cross-scale exploration and interaction of a TreeNet graph. TreeNetViz uses a Radial, Space-Filling (RSF) visualization to represent the tree structure, a circle layout with novel optimization to show aggregated networks derived from TreeNet, and an edge bundling technique to reduce visual complexity. Our circular layout algorithm reduces both total edge-crossings and edge length and also considers hierarchical structure constraints and edge weight in a TreeNet graph. These experiments illustrate that the algorithm can reduce visual cluttering in TreeNet graphs. Our case study also shows that TreeNetViz has the potential to support the analysis of a compound graph by revealing multiscale and cross-scale network patterns. © 2011 IEEE

75 FR 76006 - Regular Meeting

Science.gov (United States)

2010-12-07

... FARM CREDIT SYSTEM INSURANCE CORPORATION Regular Meeting AGENCY: Farm Credit System Insurance Corporation Board. ACTION: Regular meeting. SUMMARY: Notice is hereby given of the regular meeting of the Farm Credit System Insurance Corporation Board (Board). Date and Time: The meeting of the Board will be held...

General inverse problems for regular variation

DEFF Research Database (Denmark)

Damek, Ewa; Mikosch, Thomas Valentin; Rosinski, Jan

2014-01-01

Regular variation of distributional tails is known to be preserved by various linear transformations of some random structures. An inverse problem for regular variation aims at understanding whether the regular variation of a transformed random object is caused by regular variation of components ...

Tense Marking in the English Narrative Retells of Dual Language Preschoolers.

Science.gov (United States)

Gusewski, Svenja; Rojas, Raúl

2017-07-26

This longitudinal study investigated the emergence of English tense marking in young (Spanish-English) dual language learners (DLLs) over 4 consecutive academic semesters, addressing the need for longitudinal data on typical acquisition trajectories of English in DLL preschoolers. Language sample analysis was conducted on 139 English narrative retells elicited from 39 preschool-age (Spanish-English) DLLs (range = 39-65 months). Growth curve models captured within- and between-individual change in tense-marking accuracy over time. Tense-marking accuracy was indexed by the finite verb morphology composite and by 2 specifically developed adaptations. Individual tense markers were systematically described in terms of overall accuracy and specific error patterns. Tense-marking accuracy exhibited significant growth over time for each composite. Initially, irregular past-tense accuracy was higher than regular past-tense accuracy; over time, however, regular past-tense marking outpaced accuracy on irregular verbs. These findings suggest that young DLLs can achieve high tense-marking accuracy assuming 2 years of immersive exposure to English. Monitoring the growth in tense-marking accuracy over time and considering productive tense-marking errors as partially correct more precisely captured the emergence of English tense marking in this population with highly variable expressive language skills. https://doi.org/10.23641/asha.5176942.

TREE SELECTING AND TREE RING MEASURING IN DENDROCHRONOLOGICAL INVESTIGATIONS

Directory of Open Access Journals (Sweden)

Sefa Akbulut

2004-04-01

Full Text Available Dendrochronology is a method of dating which makes use of the annual nature of tree growth. Dendrochronology may be divided into a number of subfields, each of which covers one or more aspects of the use of tree ring data: dendroclimatology, dendrogeomorphology, dendrohydrology, dendroecology, dendroarchaelogy, and dendrogylaciology. Basic of all form the analysis of the tree rings. The wood or tree rings can aid to dating past events about climatology, ecology, geology, hydrology. Dendrochronological studies are conducted either on increment cores or on discs. It may be seen abnormalities on tree rings during the measurement like that false rings, missing rings, reaction wood. Like that situation, increment cores must be extracted from four different sides of each tree and be studied as more as on tree.

Dynamic Load Balancing Based on Constrained K-D Tree Decomposition for Parallel Particle Tracing

Energy Technology Data Exchange (ETDEWEB)

Zhang, Jiang; Guo, Hanqi; Yuan, Xiaoru; Hong, Fan; Peterka, Tom

2018-01-01

Particle tracing is a fundamental technique in flow field data visualization. In this work, we present a novel dynamic load balancing method for parallel particle tracing. Specifically, we employ a constrained k-d tree decomposition approach to dynamically redistribute tasks among processes. Each process is initially assigned a regularly partitioned block along with duplicated ghost layer under the memory limit. During particle tracing, the k-d tree decomposition is dynamically performed by constraining the cutting planes in the overlap range of duplicated data. This ensures that each process is reassigned particles as even as possible, and on the other hand the new assigned particles for a process always locate in its block. Result shows good load balance and high efficiency of our method.

What is the Wymysorys Language for Vilamovians Today? Different Functions, Different Language Altitudes

Directory of Open Access Journals (Sweden)

Tymoteusz Król

2016-12-01

Full Text Available What makes the Wilamowice town so unique is the original language, Wymysorys. Vilamovian was brought to Poland by the settlers from the Western Europe and survived through the historical storms in the region till today. However, due to the after-Second World War suppressions of the German-like speaking community – bans of using the language, population displacement and deportations to the labor camps – the intergenerational knowledge transfer was disrupted. Children for whom the Vilamovian was their first language were being force to “unlearn” the language on the behalf of the dominating Polish. This violent political practice resulted in life-lasting trauma and unbreakable fear of speaking Vilamovian. Their native language was being forgotten by the post-war generations, although it was too late for them to naturally canvass Polish instead. Accordingly, a number of people declaring to do not know Wymysorys use particular words from it, while talking in Polish about traditional Vilamovian clothing, customs and values, deeply associated with Vilamowian identity. Contradictory to the earlier predications that Vilamowian language will die completely by the end of the 20th century, in the being of the second decade of the 21st century the dedicated revitalization program was introduced in the region. The initiative engaged scientists from major Polish universities – the University of Warsaw, Adam Mickiewicz University in Poznań – as well as foreign scholars. Wymysorys was introduced to the curriculum of the local schools and the intergenerational meetings are being held regularly. After some time, the Vilamovians also engaged into the revitalization program, even though there are strong differences in their linguistic bases. Today, the knowledge and use of Vilamowian is vividly growing amongst the young. The language once almost forgotten starts not only to gain back its communicative function, but more and more often takes upon a

Visualizing Individual Tree Differences in Tree-Ring Studies

Directory of Open Access Journals (Sweden)

Mario Trouillier

2018-04-01

Full Text Available Averaging tree-ring measurements from multiple individuals is one of the most common procedures in dendrochronology. It serves to filter out noise from individual differences between trees, such as competition, height, and micro-site effects, which ideally results in a site chronology sensitive to regional scale factors such as climate. However, the climate sensitivity of individual trees can be modulated by factors like competition, height, and nitrogen deposition, calling attention to whether average chronologies adequately assess climatic growth-control. In this study, we demonstrate four simple but effective methods to visually assess differences between individual trees. Using individual tree climate-correlations we: (1 employed jitter plots with superimposed metadata to assess potential causes for these differences; (2 plotted the frequency distributions of climate correlations over time as heat maps; (3 mapped the spatial distribution of climate sensitivity over time to assess spatio-temporal dynamics; and (4 used t-distributed Stochastic Neighborhood Embedding (t-SNE to assess which trees were generally more similar in terms of their tree-ring pattern and their correlation with climate variables. This suite of exploratory methods can indicate if individuals in tree-ring datasets respond differently to climate variability, and therefore, should not solely be explored with climate correlations of the mean population chronology.

A syntactic component for Vietnamese language processing

Directory of Open Access Journals (Sweden)

Phuong Le-Hong

2015-06-01

Full Text Available This paper presents the development of a syntactic component for the Vietnamese language. We first discuss the construction of a lexicalized tree-adjoining grammar using an automatic extraction approach. We then present the construction and evaluation of a deep syntactic parser based on the extracted grammar. This is a complete system integrating necessary tools to process Vietnamese text, which permits to take as input raw texts and produce syntactic structures. A dependency annotation scheme for Vietnamese and an algorithm for extracting dependency structures from derivation trees are also proposed. At present, this is the first Vietnamese parsing system capable of producing both constituency and dependency analyses with encouraging performances: 69.33% and 73.21% for constituency and dependency analysis accuracy, respectively. The parser also compares favourably to a statistical parser which is trained and tested on the same data sets.

Large emissions from floodplain trees close the Amazon methane budget

Science.gov (United States)

Pangala, Sunitha R.; Enrich-Prast, Alex; Basso, Luana S.; Peixoto, Roberta Bittencourt; Bastviken, David; Hornibrook, Edward R. C.; Gatti, Luciana V.; Marotta, Humberto; Calazans, Luana Silva Braucks; Sakuragui, Cassia Mônica; Bastos, Wanderley Rodrigues; Malm, Olaf; Gloor, Emanuel; Miller, John Bharat; Gauci, Vincent

2017-12-01

Wetlands are the largest global source of atmospheric methane (CH4), a potent greenhouse gas. However, methane emission inventories from the Amazon floodplain, the largest natural geographic source of CH4 in the tropics, consistently underestimate the atmospheric burden of CH4 determined via remote sensing and inversion modelling, pointing to a major gap in our understanding of the contribution of these ecosystems to CH4 emissions. Here we report CH4 fluxes from the stems of 2,357 individual Amazonian floodplain trees from 13 locations across the central Amazon basin. We find that escape of soil gas through wetland trees is the dominant source of regional CH4 emissions. Methane fluxes from Amazon tree stems were up to 200 times larger than emissions reported for temperate wet forests and tropical peat swamp forests, representing the largest non-ebullitive wetland fluxes observed. Emissions from trees had an average stable carbon isotope value (δ13C) of -66.2 ± 6.4 per mil, consistent with a soil biogenic origin. We estimate that floodplain trees emit 15.1 ± 1.8 to 21.2 ± 2.5 teragrams of CH4 a year, in addition to the 20.5 ± 5.3 teragrams a year emitted regionally from other sources. Furthermore, we provide a ‘top-down’ regional estimate of CH4 emissions of 42.7 ± 5.6 teragrams of CH4 a year for the Amazon basin, based on regular vertical lower-troposphere CH4 profiles covering the period 2010-2013. We find close agreement between our ‘top-down’ and combined ‘bottom-up’ estimates, indicating that large CH4 emissions from trees adapted to permanent or seasonal inundation can account for the emission source that is required to close the Amazon CH4 budget. Our findings demonstrate the importance of tree stem surfaces in mediating approximately half of all wetland CH4 emissions in the Amazon floodplain, a region that represents up to one-third of the global wetland CH4 source when trees are combined with other emission sources.

Large emissions from floodplain trees close the Amazon methane budget.

Science.gov (United States)

Pangala, Sunitha R; Enrich-Prast, Alex; Basso, Luana S; Peixoto, Roberta Bittencourt; Bastviken, David; Hornibrook, Edward R C; Gatti, Luciana V; Marotta, Humberto; Calazans, Luana Silva Braucks; Sakuragui, Cassia Mônica; Bastos, Wanderley Rodrigues; Malm, Olaf; Gloor, Emanuel; Miller, John Bharat; Gauci, Vincent

2017-12-14

Wetlands are the largest global source of atmospheric methane (CH 4 ), a potent greenhouse gas. However, methane emission inventories from the Amazon floodplain, the largest natural geographic source of CH 4 in the tropics, consistently underestimate the atmospheric burden of CH 4 determined via remote sensing and inversion modelling, pointing to a major gap in our understanding of the contribution of these ecosystems to CH 4 emissions. Here we report CH 4 fluxes from the stems of 2,357 individual Amazonian floodplain trees from 13 locations across the central Amazon basin. We find that escape of soil gas through wetland trees is the dominant source of regional CH 4 emissions. Methane fluxes from Amazon tree stems were up to 200 times larger than emissions reported for temperate wet forests and tropical peat swamp forests, representing the largest non-ebullitive wetland fluxes observed. Emissions from trees had an average stable carbon isotope value (δ 13 C) of -66.2 ± 6.4 per mil, consistent with a soil biogenic origin. We estimate that floodplain trees emit 15.1 ± 1.8 to 21.2 ± 2.5 teragrams of CH 4 a year, in addition to the 20.5 ± 5.3 teragrams a year emitted regionally from other sources. Furthermore, we provide a 'top-down' regional estimate of CH 4 emissions of 42.7 ± 5.6 teragrams of CH 4 a year for the Amazon basin, based on regular vertical lower-troposphere CH 4 profiles covering the period 2010-2013. We find close agreement between our 'top-down' and combined 'bottom-up' estimates, indicating that large CH 4 emissions from trees adapted to permanent or seasonal inundation can account for the emission source that is required to close the Amazon CH 4 budget. Our findings demonstrate the importance of tree stem surfaces in mediating approximately half of all wetland CH 4 emissions in the Amazon floodplain, a region that represents up to one-third of the global wetland CH 4 source when trees are combined with other emission sources.

Fault tree handbook

International Nuclear Information System (INIS)

Haasl, D.F.; Roberts, N.H.; Vesely, W.E.; Goldberg, F.F.

1981-01-01

This handbook describes a methodology for reliability analysis of complex systems such as those which comprise the engineered safety features of nuclear power generating stations. After an initial overview of the available system analysis approaches, the handbook focuses on a description of the deductive method known as fault tree analysis. The following aspects of fault tree analysis are covered: basic concepts for fault tree analysis; basic elements of a fault tree; fault tree construction; probability, statistics, and Boolean algebra for the fault tree analyst; qualitative and quantitative fault tree evaluation techniques; and computer codes for fault tree evaluation. Also discussed are several example problems illustrating the basic concepts of fault tree construction and evaluation

Stimulation of Executive Functions as Part of the Language Intervention Process in Children with Autism Spectrum Disorder.

Science.gov (United States)

Sun, Ingrid Ya I; Varanda, Cristina Andrade; Fernandes, Fernanda Dreux

2017-01-01

Identifying effective methods for stimulating language and communication of children with autism spectrum disorder (ASD) is fundamental to the effective use of available resources to support these children. This pilot study was designed to explore the potential benefits of a program of stimulation of executive functions (SEF) on the functional aspects of language and communication through the assessment of the functional communicative profile and social-cognitive performance. Twenty children, aged 5-12 years, with a diagnosis of ASD participated in the study. Two stimulation programs were offered over a 10- to 12-week period as part of the regular services offered to these children through a University's speech and language therapy outpatient clinic in São Paulo, Brazil. Children either received SEF intervention in their home implemented by their parent/s, with close monitoring by the speech-language pathologist (SLP) (group 1), or they received SEF by the SLP during regular speech-language therapy individual sessions (group 2). The findings suggested that there were differences between the children's pre- and posttest performance. Significantly different performances were observed in the areas of occupation of communication space, proportion of communicative interactivity, and social-cognitive performance. The inclusion of activities to stimulate executive function abilities in language intervention for children with ASD warrants further investigation. © 2017 S. Karger AG, Basel.

Serbian language acquisition in communist Romania

Directory of Open Access Journals (Sweden)

Sorescu-Marinković Annemarie

2010-01-01

Full Text Available The paper analyzes a unique linguistic phenomenon characterizing Romania’s western border areas for almost a decade, in the 1980s: the acquisition of the Serbian language by Romanians in Timişoara under the communist regime, primarily through exposure to Yugoslav television programmes. It gives a necessarily sketchy overview of private life under communism, notably the situation in the Banat province, whose privileged position as a result of being closest to the West both geographically and culturally was reflected in the acceptance of pluralism and a critical attitude towards authoritarianism. Taking into account the literature on foreign language acquisition through exposure to television programmes, the study is based on a research involving Romanian natives of Timişoara who, although lacking any formal instruction in Serbian, intensively and regularly watched Yugoslav television programmes in the period in question, and on evaluating their competence and proficiency in Serbian, through language tests, narrative interviews in Romanian and free conversations in Serbian. The conclusion is that most respondents, despite the varying degree of proficiency in Serbian depending on their active use of the language before and after 1989, showed a strong pragmatic competence, which appears to contradict the author’s initial hypothesis.

Continuum-regularized quantum gravity

International Nuclear Information System (INIS)

Chan Huesum; Halpern, M.B.

1987-01-01

The recent continuum regularization of d-dimensional Euclidean gravity is generalized to arbitrary power-law measure and studied in some detail as a representative example of coordinate-invariant regularization. The weak-coupling expansion of the theory illustrates a generic geometrization of regularized Schwinger-Dyson rules, generalizing previous rules in flat space and flat superspace. The rules are applied in a non-trivial explicit check of Einstein invariance at one loop: the cosmological counterterm is computed and its contribution is included in a verification that the graviton mass is zero. (orig.)

Building a Phylogenetic Tree of the Human and Ape Superfamily Using DNA-DNA Hybridization Data

Science.gov (United States)

Maier, Caroline Alexander

2004-01-01

The study describes the process of DNA-DNA hybridization and the history of its use by Sibley and Alquist in simple, straightforward, and interesting language that students easily understand to create their own phylogenetic tree of the hominoid superfamily. They calibrate the DNA clock and use it to estimate the divergence dates of the various…

Attack tree analysis for insider threats on the IoT using isabelle

DEFF Research Database (Denmark)

Kammüller, Florian; Nurse, Jason R. C.; Probst, Christian W.

2016-01-01

The Internet-of-Things (IoT) aims at integrating small devices around humans. The threat from human insiders in "regular" organisations is real; in a fully-connected world of the IoT, organisations face a substantially more severe security challenge due to unexpected access possibilities and info....... On the classified IoT attack examples, we show how this logical approach can be used to make the models more precise and to analyse the previously identified Insider IoT attacks using Isabelle attack trees....

Understanding of subordinate clauses in the language of dysphasic children

Directory of Open Access Journals (Sweden)

Lazarević Emilija

2007-01-01

Full Text Available This paper presents the results of the research of peculiarities of syntactic development, as an element of language structure on the grammatical level of children suffering from developmental dysphasia, after the completed speech pathology treatment of many years. Syntactic level at younger school age was studied by assessing language competence in the accomplishment of communicative sentence with subordinate clause. The research was performed on the samples of children at school age in regular primary schools in Belgrade. The sample comprised 160 respondents who were divided in two groups: target and comparative. The target group consisted of 60 respondents (children suffering from developmental dysphasia after the completed speech pathology treatment of many years, and the comparative group consisted of 100 respondents from regular primary school "Gavrilo Princip" in Zemun. Research results show that grammatical development of children suffering from developmental dysphasia takes place at a considerably slower rate and entails substantially more difficulties in accomplishing predication in subordinate clauses. This paper discusses the consequences which the difficulties in grammatical development can have on school achievement.

Online co-regularized algorithms

NARCIS (Netherlands)

Ruijter, T. de; Tsivtsivadze, E.; Heskes, T.

2012-01-01

We propose an online co-regularized learning algorithm for classification and regression tasks. We demonstrate that by sequentially co-regularizing prediction functions on unlabeled data points, our algorithm provides improved performance in comparison to supervised methods on several UCI benchmarks

Geometric continuum regularization of quantum field theory

International Nuclear Information System (INIS)

Halpern, M.B.

1989-01-01

An overview of the continuum regularization program is given. The program is traced from its roots in stochastic quantization, with emphasis on the examples of regularized gauge theory, the regularized general nonlinear sigma model and regularized quantum gravity. In its coordinate-invariant form, the regularization is seen as entirely geometric: only the supermetric on field deformations is regularized, and the prescription provides universal nonperturbative invariant continuum regularization across all quantum field theory. 54 refs

The process and utility of classification and regression tree methodology in nursing research.

Science.gov (United States)

Kuhn, Lisa; Page, Karen; Ward, John; Worrall-Carter, Linda

2014-06-01

This paper presents a discussion of classification and regression tree analysis and its utility in nursing research. Classification and regression tree analysis is an exploratory research method used to illustrate associations between variables not suited to traditional regression analysis. Complex interactions are demonstrated between covariates and variables of interest in inverted tree diagrams. Discussion paper. English language literature was sourced from eBooks, Medline Complete and CINAHL Plus databases, Google and Google Scholar, hard copy research texts and retrieved reference lists for terms including classification and regression tree* and derivatives and recursive partitioning from 1984-2013. Classification and regression tree analysis is an important method used to identify previously unknown patterns amongst data. Whilst there are several reasons to embrace this method as a means of exploratory quantitative research, issues regarding quality of data as well as the usefulness and validity of the findings should be considered. Classification and regression tree analysis is a valuable tool to guide nurses to reduce gaps in the application of evidence to practice. With the ever-expanding availability of data, it is important that nurses understand the utility and limitations of the research method. Classification and regression tree analysis is an easily interpreted method for modelling interactions between health-related variables that would otherwise remain obscured. Knowledge is presented graphically, providing insightful understanding of complex and hierarchical relationships in an accessible and useful way to nursing and other health professions. © 2013 The Authors. Journal of Advanced Nursing Published by John Wiley & Sons Ltd.

Phylogenetic tree based on complete genomes using fractal and correlation analyses without sequence alignment

Directory of Open Access Journals (Sweden)

Zu-Guo Yu

2006-06-01

Full Text Available The complete genomes of living organisms have provided much information on their phylogenetic relationships. Similarly, the complete genomes of chloroplasts have helped resolve the evolution of this organelle in photosynthetic eukaryotes. In this review, we describe two algorithms to construct phylogenetic trees based on the theories of fractals and dynamic language using complete genomes. These algorithms were developed by our research group in the past few years. Our distance-based phylogenetic tree of 109 prokaryotes and eukaryotes agrees with the biologists' "tree of life" based on the 16S-like rRNA genes in a majority of basic branchings and most lower taxa. Our phylogenetic analysis also shows that the chloroplast genomes are separated into two major clades corresponding to chlorophytes s.l. and rhodophytes s.l. The interrelationships among the chloroplasts are largely in agreement with the current understanding on chloroplast evolution.

The effects of bilingual language proficiency on recall accuracy and semantic clustering in free recall output: evidence for shared semantic associations across languages.

Science.gov (United States)

Francis, Wendy S; Taylor, Randolph S; Gutiérrez, Marisela; Liaño, Mary K; Manzanera, Diana G; Penalver, Renee M

2018-05-19

Two experiments investigated how well bilinguals utilise long-standing semantic associations to encode and retrieve semantic clusters in verbal episodic memory. In Experiment 1, Spanish-English bilinguals (N = 128) studied and recalled word and picture sets. Word recall was equivalent in L1 and L2, picture recall was better in L1 than in L2, and the picture superiority effect was stronger in L1 than in L2. Semantic clustering in word and picture recall was equivalent in L1 and L2. In Experiment 2, Spanish-English bilinguals (N = 128) and English-speaking monolinguals (N = 128) studied and recalled word sequences that contained semantically related pairs. Data were analyzed using a multinomial processing tree approach, the pair-clustering model. Cluster formation was more likely for semantically organised than for randomly ordered word sequences. Probabilities of cluster formation, cluster retrieval, and retrieval of unclustered items did not differ across languages or language groups. Language proficiency has little if any impact on the utilisation of long-standing semantic associations, which are language-general.

Incorporating Language Structure in a Communicative Task: An Analysis of the Language Component of a Communicative Task in the LINC Home Study Program

Science.gov (United States)

Lenchuk, Iryna

2014-01-01

The purpose of this article is to analyze a task included in the LINC Home Study (LHS) program. LHS is a federally funded distance education program offered to newcomers to Canada who are unable to attend regular LINC classes. A task, in which a language structure (a gerund) is chosen and analyzed, was selected from one instructional module of LHS…

Bypassing the Limits of Ll Regularization: Convex Sparse Signal Processing Using Non-Convex Regularization

Science.gov (United States)

Parekh, Ankit

Sparsity has become the basis of some important signal processing methods over the last ten years. Many signal processing problems (e.g., denoising, deconvolution, non-linear component analysis) can be expressed as inverse problems. Sparsity is invoked through the formulation of an inverse problem with suitably designed regularization terms. The regularization terms alone encode sparsity into the problem formulation. Often, the ℓ1 norm is used to induce sparsity, so much so that ℓ1 regularization is considered to be `modern least-squares'. The use of ℓ1 norm, as a sparsity-inducing regularizer, leads to a convex optimization problem, which has several benefits: the absence of extraneous local minima, well developed theory of globally convergent algorithms, even for large-scale problems. Convex regularization via the ℓ1 norm, however, tends to under-estimate the non-zero values of sparse signals. In order to estimate the non-zero values more accurately, non-convex regularization is often favored over convex regularization. However, non-convex regularization generally leads to non-convex optimization, which suffers from numerous issues: convergence may be guaranteed to only a stationary point, problem specific parameters may be difficult to set, and the solution is sensitive to the initialization of the algorithm. The first part of this thesis is aimed toward combining the benefits of non-convex regularization and convex optimization to estimate sparse signals more effectively. To this end, we propose to use parameterized non-convex regularizers with designated non-convexity and provide a range for the non-convex parameter so as to ensure that the objective function is strictly convex. By ensuring convexity of the objective function (sum of data-fidelity and non-convex regularizer), we can make use of a wide variety of convex optimization algorithms to obtain the unique global minimum reliably. The second part of this thesis proposes a non-linear signal

Rate of tree carbon accumulation increases continuously with tree size.

Science.gov (United States)

Stephenson, N L; Das, A J; Condit, R; Russo, S E; Baker, P J; Beckman, N G; Coomes, D A; Lines, E R; Morris, W K; Rüger, N; Alvarez, E; Blundo, C; Bunyavejchewin, S; Chuyong, G; Davies, S J; Duque, A; Ewango, C N; Flores, O; Franklin, J F; Grau, H R; Hao, Z; Harmon, M E; Hubbell, S P; Kenfack, D; Lin, Y; Makana, J-R; Malizia, A; Malizia, L R; Pabst, R J; Pongpattananurak, N; Su, S-H; Sun, I-F; Tan, S; Thomas, D; van Mantgem, P J; Wang, X; Wiser, S K; Zavala, M A

2014-03-06

Forests are major components of the global carbon cycle, providing substantial feedback to atmospheric greenhouse gas concentrations. Our ability to understand and predict changes in the forest carbon cycle--particularly net primary productivity and carbon storage--increasingly relies on models that represent biological processes across several scales of biological organization, from tree leaves to forest stands. Yet, despite advances in our understanding of productivity at the scales of leaves and stands, no consensus exists about the nature of productivity at the scale of the individual tree, in part because we lack a broad empirical assessment of whether rates of absolute tree mass growth (and thus carbon accumulation) decrease, remain constant, or increase as trees increase in size and age. Here we present a global analysis of 403 tropical and temperate tree species, showing that for most species mass growth rate increases continuously with tree size. Thus, large, old trees do not act simply as senescent carbon reservoirs but actively fix large amounts of carbon compared to smaller trees; at the extreme, a single big tree can add the same amount of carbon to the forest within a year as is contained in an entire mid-sized tree. The apparent paradoxes of individual tree growth increasing with tree size despite declining leaf-level and stand-level productivity can be explained, respectively, by increases in a tree's total leaf area that outpace declines in productivity per unit of leaf area and, among other factors, age-related reductions in population density. Our results resolve conflicting assumptions about the nature of tree growth, inform efforts to undertand and model forest carbon dynamics, and have additional implications for theories of resource allocation and plant senescence.

Using Tikhonov Regularization for Spatial Projections from CSR Regularized Spherical Harmonic GRACE Solutions

Science.gov (United States)

Save, H.; Bettadpur, S. V.

2013-12-01

It has been demonstrated before that using Tikhonov regularization produces spherical harmonic solutions from GRACE that have very little residual stripes while capturing all the signal observed by GRACE within the noise level. This paper demonstrates a two-step process and uses Tikhonov regularization to remove the residual stripes in the CSR regularized spherical harmonic coefficients when computing the spatial projections. We discuss methods to produce mass anomaly grids that have no stripe features while satisfying the necessary condition of capturing all observed signal within the GRACE noise level.

Regularized maximum correntropy machine

KAUST Repository

Wang, Jim Jing-Yan; Wang, Yunji; Jing, Bing-Yi; Gao, Xin

2015-01-01

In this paper we investigate the usage of regularized correntropy framework for learning of classifiers from noisy labels. The class label predictors learned by minimizing transitional loss functions are sensitive to the noisy and outlying labels of training samples, because the transitional loss functions are equally applied to all the samples. To solve this problem, we propose to learn the class label predictors by maximizing the correntropy between the predicted labels and the true labels of the training samples, under the regularized Maximum Correntropy Criteria (MCC) framework. Moreover, we regularize the predictor parameter to control the complexity of the predictor. The learning problem is formulated by an objective function considering the parameter regularization and MCC simultaneously. By optimizing the objective function alternately, we develop a novel predictor learning algorithm. The experiments on two challenging pattern classification tasks show that it significantly outperforms the machines with transitional loss functions.

Regularized maximum correntropy machine

KAUST Repository

Wang, Jim Jing-Yan

2015-02-12

In this paper we investigate the usage of regularized correntropy framework for learning of classifiers from noisy labels. The class label predictors learned by minimizing transitional loss functions are sensitive to the noisy and outlying labels of training samples, because the transitional loss functions are equally applied to all the samples. To solve this problem, we propose to learn the class label predictors by maximizing the correntropy between the predicted labels and the true labels of the training samples, under the regularized Maximum Correntropy Criteria (MCC) framework. Moreover, we regularize the predictor parameter to control the complexity of the predictor. The learning problem is formulated by an objective function considering the parameter regularization and MCC simultaneously. By optimizing the objective function alternately, we develop a novel predictor learning algorithm. The experiments on two challenging pattern classification tasks show that it significantly outperforms the machines with transitional loss functions.

Listening to accented speech in a second language: First language and age of acquisition effects.

Science.gov (United States)

Larraza, Saioa; Samuel, Arthur G; Oñederra, Miren Lourdes

2016-11-01

Bilingual speakers must acquire the phonemic inventory of 2 languages and need to recognize spoken words cross-linguistically; a demanding job potentially made even more difficult due to dialectal variation, an intrinsic property of speech. The present work examines how bilinguals perceive second language (L2) accented speech and where accommodation to dialectal variation takes place. Dialectal effects were analyzed at different levels: An AXB discrimination task tapped phonetic-phonological representations, an auditory lexical-decision task tested for effects in accessing the lexicon, and an auditory priming task looked for semantic processing effects. Within that central focus, the goal was to see whether perceptual adjustment at a given level is affected by 2 main linguistic factors: bilinguals' first language and age of acquisition of the L2. Taking advantage of the cross-linguistic situation of the Basque language, bilinguals with different first languages (Spanish or French) and ages of acquisition of Basque (simultaneous, early, or late) were tested. Our use of multiple tasks with multiple types of bilinguals demonstrates that in spite of very similar discrimination capacity, French-Basque versus Spanish-Basque simultaneous bilinguals' performance on lexical access significantly differed. Similarly, results of the early and late groups show that the mapping of phonetic-phonological information onto lexical representations is a more demanding process that accentuates non-native processing difficulties. L1 and AoA effects were more readily overcome in semantic processing; accented variants regularly created priming effects in the different groups of bilinguals. (PsycINFO Database Record (c) 2016 APA, all rights reserved).

Maximum likelihood inference of small trees in the presence of long branches.

Science.gov (United States)

Parks, Sarah L; Goldman, Nick

2014-09-01

The statistical basis of maximum likelihood (ML), its robustness, and the fact that it appears to suffer less from biases lead to it being one of the most popular methods for tree reconstruction. Despite its popularity, very few analytical solutions for ML exist, so biases suffered by ML are not well understood. One possible bias is long branch attraction (LBA), a regularly cited term generally used to describe a propensity for long branches to be joined together in estimated trees. Although initially mentioned in connection with inconsistency of parsimony, LBA has been claimed to affect all major phylogenetic reconstruction methods, including ML. Despite the widespread use of this term in the literature, exactly what LBA is and what may be causing it is poorly understood, even for simple evolutionary models and small model trees. Studies looking at LBA have focused on the effect of two long branches on tree reconstruction. However, to understand the effect of two long branches it is also important to understand the effect of just one long branch. If ML struggles to reconstruct one long branch, then this may have an impact on LBA. In this study, we look at the effect of one long branch on three-taxon tree reconstruction. We show that, counterintuitively, long branches are preferentially placed at the tips of the tree. This can be understood through the use of analytical solutions to the ML equation and distance matrix methods. We go on to look at the placement of two long branches on four-taxon trees, showing that there is no attraction between long branches, but that for extreme branch lengths long branches are joined together disproportionally often. These results illustrate that even small model trees are still interesting to help understand how ML phylogenetic reconstruction works, and that LBA is a complicated phenomenon that deserves further study. © The Author(s) 2014. Published by Oxford University Press, on behalf of the Society of Systematic Biologists.

Promoting Oral Language Skills in Preschool Children through Sociodramatic Play in the Classroom

Directory of Open Access Journals (Sweden)

P.L.N. Randima Rajapaksha

2016-01-01

Full Text Available Children best learn language through playful learning experiences in the preschool classroom. The present study focused on developing oral language skills in preschool children through a sociodramatic play intervention. The study employed a case study design under qualitative approach. The researcher conducted a sociodramatic play intervention collaboratively with the class teacher for a group of 10 children selected utilizing purposive sampling method in a preschool classroom. The intervention was conducted in a preschool located in Colombo, Sri Lanka for 3 weeks. The observation, interview and reflective journal were the instrument used to collect data. The observation carried under two criteria namely, ability to initiate a conversation and ability to respond in a conversation revealed that the sociodramatic play intervention created many opportunities to develop oral language skills in the children than the regular classroom activities. The sociodramatic play activities enhanced children's oral language skills while creating a language rich playful learning experiences. Keywords: Language development, Early childhood education, Sociodramatic play

A bijection between phylogenetic trees and plane oriented recursive trees

OpenAIRE

Prodinger, Helmut

2017-01-01

Phylogenetic trees are binary nonplanar trees with labelled leaves, and plane oriented recursive trees are planar trees with an increasing labelling. Both families are enumerated by double factorials. A bijection is constructed, using the respective representations a 2-partitions and trapezoidal words.

Degree Associated Edge Reconstruction Number of Graphs with Regular Pruned Graph

Directory of Open Access Journals (Sweden)

P. Anusha Devi

2015-10-01

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

dCITE: Measuring Necessary Cladistic Information Can Help You Reduce Polytomy Artefacts in Trees.

Science.gov (United States)

Wise, Michael J

2016-01-01

Biologists regularly create phylogenetic trees to better understand the evolutionary origins of their species of interest, and often use genomes as their data source. However, as more and more incomplete genomes are published, in many cases it may not be possible to compute genome-based phylogenetic trees due to large gaps in the assembled sequences. In addition, comparison of complete genomes may not even be desirable due to the presence of horizontally acquired and homologous genes. A decision must therefore be made about which gene, or gene combinations, should be used to compute a tree. Deflated Cladistic Information based on Total Entropy (dCITE) is proposed as an easily computed metric for measuring the cladistic information in multiple sequence alignments representing a range of taxa, without the need to first compute the corresponding trees. dCITE scores can be used to rank candidate genes or decide whether input sequences provide insufficient cladistic information, making artefactual polytomies more likely. The dCITE method can be applied to protein, nucleotide or encoded phenotypic data, so can be used to select which data-type is most appropriate, given the choice. In a series of experiments the dCITE method was compared with related measures. Then, as a practical demonstration, the ideas developed in the paper were applied to a dataset representing species from the order Campylobacterales; trees based on sequence combinations, selected on the basis of their dCITE scores, were compared with a tree constructed to mimic Multi-Locus Sequence Typing (MLST) combinations of fragments. We see that the greater the dCITE score the more likely it is that the computed phylogenetic tree will be free of artefactual polytomies. Secondly, cladistic information saturates, beyond which little additional cladistic information can be obtained by adding additional sequences. Finally, sequences with high cladistic information produce more consistent trees for the same taxa.

Rate of tree carbon accumulation increases continuously with tree size

Science.gov (United States)

Stephenson, N.L.; Das, A.J.; Condit, R.; Russo, S.E.; Baker, P.J.; Beckman, N.G.; Coomes, D.A.; Lines, E.R.; Morris, W.K.; Rüger, N.; Álvarez, E.; Blundo, C.; Bunyavejchewin, S.; Chuyong, G.; Davies, S.J.; Duque, Á.; Ewango, C.N.; Flores, O.; Franklin, J.F.; Grau, H.R.; Hao, Z.; Harmon, M.E.; Hubbell, S.P.; Kenfack, D.; Lin, Y.; Makana, J.-R.; Malizia, A.; Malizia, L.R.; Pabst, R.J.; Pongpattananurak, N.; Su, S.-H.; Sun, I-F.; Tan, S.; Thomas, D.; van Mantgem, P.J.; Wang, X.; Wiser, S.K.; Zavala, M.A.

2014-01-01

Forests are major components of the global carbon cycle, providing substantial feedback to atmospheric greenhouse gas concentrations. Our ability to understand and predict changes in the forest carbon cycle—particularly net primary productivity and carbon storage - increasingly relies on models that represent biological processes across several scales of biological organization, from tree leaves to forest stands. Yet, despite advances in our understanding of productivity at the scales of leaves and stands, no consensus exists about the nature of productivity at the scale of the individual tree, in part because we lack a broad empirical assessment of whether rates of absolute tree mass growth (and thus carbon accumulation) decrease, remain constant, or increase as trees increase in size and age. Here we present a global analysis of 403 tropical and temperate tree species, showing that for most species mass growth rate increases continuously with tree size. Thus, large, old trees do not act simply as senescent carbon reservoirs but actively fix large amounts of carbon compared to smaller trees; at the extreme, a single big tree can add the same amount of carbon to the forest within a year as is contained in an entire mid-sized tree. The apparent paradoxes of individual tree growth increasing with tree size despite declining leaf-level and stand-level productivity can be explained, respectively, by increases in a tree’s total leaf area that outpace declines in productivity per unit of leaf area and, among other factors, age-related reductions in population density. Our results resolve conflicting assumptions about the nature of tree growth, inform efforts to understand and model forest carbon dynamics, and have additional implications for theories of resource allocation and plant senescence.

Production regularity of ‘Ponkan’ mandarin trees submitted to chemical thinningRegularidade de produção de tangerineira ‘Ponkan’ submetida a raleio químico

Directory of Open Access Journals (Sweden)

Rodrigo Amato Moreira

2012-12-01

Full Text Available Alternate bearing is a problem that has influenced the productivity and fruits quality of ‘Ponkan’ mandarin trees. The aim of this research was to evaluate the effect of chemical thinning on alternate bearing and productivity of ‘Ponkan’ mandarin tree. Ten-year-old plants grafted on ‘Rangpur’ lime (Citrus limonia Osbeck were evaluated in a commercial orchard from December 2006 to July 2008. Five Ethephon concentrations were applied: 0, 150, 300, 450 and 600 mg L-1 in two fruit development stages (30 mm and 40 mm of transverse diameter. The experiment was set in a 5×2 factorial scheme, in randomized blocks with four replications. In the first year after chemical thinning with Ethephon the productivity was evaluated in plants of different treatments. In the second year the alternate bearing and the productivity were evaluated. The chemical thinning promotes yield regularity in ‘Ponkan’ mandarin trees, with the application of Ethephon at concentrations between 300 mg L-1 to 600 mg L-1. Plants sprayed with 600 mg L-1 of Ethephon produced fruit higher amounts in following year to thinning. Para a tangerineira ‘Ponkan’, a alternância de produção é um problema que tem influenciado a qualidade das frutas e a produtividade. A finalidade desta pesquisa foi avaliar os efeitos do raleio químico sobre a alternância de produção e produtividade da tangerineira ‘Ponkan’. Foram utilizadas tangerineiras ‘Ponkan’ enxertadas sobre limoeiro ‘Cravo’ (Citrus limonia Osbeck, de um pomar comercial com dez anos de idade, no período de dezembro de 2006 a julho de 2008. As plantas foram pulverizadas com cinco concentrações de Ethephon: 0, 150, 300, 450, 600 mg L-1, em dois estádios de desenvolvimento das frutas: 30 e 40 mm de diâmetro transversal. Foi utilizado o esquema fatorial 5×2, disposto em blocos casualizados, com quatro repetições. No primeiro ano, após a aplicação do raleio químico com Ethephon, foi avaliado o

Stability and Change in Americans’ Foreign Language Policy Attitudes: 2000-2008

Directory of Open Access Journals (Sweden)

John P. Robinson

2011-08-01

Full Text Available The last decade has seen unprecedented policy emphasis on the Less Commonly Taught Languages (LCTLs – whether broadly, as indicated by the regular publication of lists of languages critical to the national interest, such as that of the US Department of Education (2010, or in the particular languages included in the multiple new Federal programs that comprise the National Security Language Initiative (NSLI, such as the National Language Service Corps, STARTALK, the Language Flagship, the English for Heritage Language Speakers program, or the NSLI for Youth, to cite several examples. The LCTLs predominate in these lists, reflecting a national level policy emphasis on the LCTLs. This emphasis derives from perceived and actual needs for specific LCTLs required for the common weal – for national security, economic well being, and social justice (Brecht et al., 2007; Brecht & Rivers, 2000. This emphasis, consisting in its entirety of programs promulgated, funded, and directed by the Federal government, stands in contrast to the ongoing perception in our professional fields that Foreign Languages (FLs, and the LCTLs among them, are under increasing and unprecedented stress in the educational system, and that furthermore, that the teaching of LCTLs lacks public support, or is even actively opposed in the broader US society (Wiley, 2007.

Recruitment of hornbill-dispersed trees in hunted and logged forests of the Indian Eastern Himalaya.

Science.gov (United States)

Sethi, Pia; Howe, Henry F

2009-06-01

Hunting of hornbills by tribal communities is widespread in logged foothill forests of the Indian Eastern Himalaya. We investigated whether the decline of hornbills has affected the dispersal and recruitment of 3 large-seeded tree species. We hypothesized that 2 low-fecundity tree species, Chisocheton paniculatus and Dysoxylum binectariferum (Meliaceae) bearing arillate fruits, are more dispersal limited than a prolifically fruiting drupaceous tree Polyalthia simiarum (Annonaceae), which has potential dispersers other than hornbills. We estimated the abundance of large avian frugivores during the fruiting season along transects in 2 protected and 2 disturbed forests. We compared recruitment of the tree species near (Hornbills (Anthracoceros albirostris) were significantly lower in disturbed forests, but sites did not differ in abundances of the Mountain Imperial Pigeon (Ducula badia). Overall, tree species showed more severely depressed recruitment of seedlings (77% fewer) and juveniles (69% fewer) in disturbed than in protected forests. In disturbed forests, 93% fewer seedlings of C. paniculatus were beyond parental crowns, and a high number of all seedlings (42%) accumulated directly under reproductive adults. In contrast, D. binectariferum and P. simiarum were recruitment rather than dispersal limited, with fewer dispersed seedlings surviving in disturbed than in protected forests. Results are consistent with the idea that disturbance disrupts mutualisms between hornbills and some large-seeded food plants, with the caveat that role redundancy within even small and specialized disperser assemblages renders other tree species less vulnerable to loss of regular dispersal agents. ©2009 Society for Conservation Biology.

Parallel Evolution of Genes and Languages in the Caucasus Region

Science.gov (United States)

Balanovsky, Oleg; Dibirova, Khadizhat; Dybo, Anna; Mudrak, Oleg; Frolova, Svetlana; Pocheshkhova, Elvira; Haber, Marc; Platt, Daniel; Schurr, Theodore; Haak, Wolfgang; Kuznetsova, Marina; Radzhabov, Magomed; Balaganskaya, Olga; Romanov, Alexey; Zakharova, Tatiana; Soria Hernanz, David F.; Zalloua, Pierre; Koshel, Sergey; Ruhlen, Merritt; Renfrew, Colin; Wells, R. Spencer; Tyler-Smith, Chris; Balanovska, Elena

2012-01-01

We analyzed 40 SNP and 19 STR Y-chromosomal markers in a large sample of 1,525 indigenous individuals from 14 populations in the Caucasus and 254 additional individuals representing potential source populations. We also employed a lexicostatistical approach to reconstruct the history of the languages of the North Caucasian family spoken by the Caucasus populations. We found a different major haplogroup to be prevalent in each of four sets of populations that occupy distinct geographic regions and belong to different linguistic branches. The haplogroup frequencies correlated with geography and, even more strongly, with language. Within haplogroups, a number of haplotype clusters were shown to be specific to individual populations and languages. The data suggested a direct origin of Caucasus male lineages from the Near East, followed by high levels of isolation, differentiation and genetic drift in situ. Comparison of genetic and linguistic reconstructions covering the last few millennia showed striking correspondences between the topology and dates of the respective gene and language trees, and with documented historical events. Overall, in the Caucasus region, unmatched levels of gene-language co-evolution occurred within geographically isolated populations, probably due to its mountainous terrain. PMID:21571925

Characterizing the growth responses of three co-occurring northern conifer tree species to climate variation across a range of conditions

Energy Technology Data Exchange (ETDEWEB)

Green, S.; Miyamoto, Y. [Northern British Columbia Univ., Prince George, BC (Canada). Ecosystem Science and Management Program

2006-07-01

Climate is the key factor affecting tree growth. Trees regularly adapt to changing environmental conditions. Adjusting forest policies and practices under changing environments necessitates an understanding of species-specific tree responses to climate change. This paper discussed a study that examined the responses of 3 northern conifer tree species, notably the lodgepole pine, subalpine fir, and interior spruce. The purpose of the study was to characterize the climate sensitivities of each species growing under various environmental conditions, represented by mean annual temperatures and mean annual precipitations. The paper provided background information on climate change and tree species and discussed the objectives and implications of the study. Study methods were presented in detail and a geographical map showing the eight sampling sites located in central British Columbia and Yukon was also provided. Last, the paper provided the preliminary results and conclusions. It was found that the impacts of changing seasonal climates on tree growth will be species and site-specific. However, the magnitude of these differences were not completely analysed so that the impacts may be similar or significantly different among species or sites. 15 refs., 4 figs.

Time and place in the prehistory of the Aslian languages.

Science.gov (United States)

Dunn, Michael; Kruspe, Nicole; Burenhult, Niclas

2013-01-01

The Aslian language family, located in the Malay Peninsula and southern Thai Isthmus, consists of four distinct branches comprising some 18 languages. These languages predate the now dominant Malay and Thai. The speakers of Aslian languages exhibit some of the highest degree of phylogenetic and societal diversity present in Mainland Southeast Asia today, among them a foraging tradition particularly associated with locally ancient, Pleistocene genetic lineages. Little advance has been made in our understanding of the linguistic prehistory of this region or how such complexity arose. In this article we present a Bayesian phylogeographic analysis of a large sample of Aslian languages. An explicit geographic model of diffusion is combined with a cognate birth-word death model of lexical evolution to infer the location of the major events of Aslian cladogenesis. The resultant phylogenetic trees are calibrated against dates in the historical and archaeological record to infer a detailed picture of Aslian language history, addressing a number of outstanding questions, including (1) whether the root ancestor of Aslian was spoken in the Malay Peninsula, or whether the family had already divided before entry, and (2) the dynamics of the movement of Aslian languages across the peninsula, with a particular focus on its spread to the indigenous foragers. Copyright © 2013 Wayne State University Press, Detroit, Michigan 48201-1309.

Statistically-Estimated Tree Composition for the Northeastern United States at Euro-American Settlement.

Directory of Open Access Journals (Sweden)

Christopher J Paciorek

Full Text Available We present a gridded 8 km-resolution data product of the estimated composition of tree taxa at the time of Euro-American settlement of the northeastern United States and the statistical methodology used to produce the product from trees recorded by land surveyors. Composition is defined as the proportion of stems larger than approximately 20 cm diameter at breast height for 22 tree taxa, generally at the genus level. The data come from settlement-era public survey records that are transcribed and then aggregated spatially, giving count data. The domain is divided into two regions, eastern (Maine to Ohio and midwestern (Indiana to Minnesota. Public Land Survey point data in the midwestern region (ca. 0.8-km resolution are aggregated to a regular 8 km grid, while data in the eastern region, from Town Proprietor Surveys, are aggregated at the township level in irregularly-shaped local administrative units. The product is based on a Bayesian statistical model fit to the count data that estimates composition on the 8 km grid across the entire domain. The statistical model is designed to handle data from both the regular grid and the irregularly-shaped townships and allows us to estimate composition at locations with no data and to smooth over noise caused by limited counts in locations with data. Critically, the model also allows us to quantify uncertainty in our composition estimates, making the product suitable for applications employing data assimilation. We expect this data product to be useful for understanding the state of vegetation in the northeastern United States prior to large-scale Euro-American settlement. In addition to specific regional questions, the data product can also serve as a baseline against which to investigate how forests and ecosystems change after intensive settlement. The data product is being made available at the NIS data portal as version 1.0.

Regularities of Multifractal Measures

Indian Academy of Sciences (India)

First, we prove the decomposition theorem for the regularities of multifractal Hausdorff measure and packing measure in R R d . This decomposition theorem enables us to split a set into regular and irregular parts, so that we can analyze each separately, and recombine them without affecting density properties. Next, we ...

IcyTree: rapid browser-based visualization for phylogenetic trees and networks.

Science.gov (United States)

Vaughan, Timothy G

2017-08-01

IcyTree is an easy-to-use application which can be used to visualize a wide variety of phylogenetic trees and networks. While numerous phylogenetic tree viewers exist already, IcyTree distinguishes itself by being a purely online tool, having a responsive user interface, supporting phylogenetic networks (ancestral recombination graphs in particular), and efficiently drawing trees that include information such as ancestral locations or trait values. IcyTree also provides intuitive panning and zooming utilities that make exploring large phylogenetic trees of many thousands of taxa feasible. IcyTree is a web application and can be accessed directly at http://tgvaughan.github.com/icytree . Currently supported web browsers include Mozilla Firefox and Google Chrome. IcyTree is written entirely in client-side JavaScript (no plugin required) and, once loaded, does not require network access to run. IcyTree is free software, and the source code is made available at http://github.com/tgvaughan/icytree under version 3 of the GNU General Public License. tgvaughan@gmail.com. © The Author(s) 2017. Published by Oxford University Press.

Record of the Solar Activity and of Other Geophysical Phenomenons in Tree Ring

Science.gov (United States)

Rigozo, Nivaor Rodolfo

1999-01-01

Tree ring studies are usually used to determine or verify climatic factors which prevail in a given place or region and may cause tree ring width variations. Few studies are dedicated to the geophysical phenomena which may underlie these tree ring width variations. In order to look for periodicities which may be associated to the solar activity and/or to other geophysical phenomena which may influence tree ring growth, a new interactive image analysis method to measure tree ring width was developed and is presented here. This method makes use of a computer and a high resolution flatbed scanner; a program was also developed in Interactive Data Language (IDL 5.0) to study ring digitized images and transform them into time series. The main advantage of this method is the tree ring image interactive analysis without needing complex and high cost instrumentation. Thirty-nine samples were collected: 12 from Concordia - S. C., 9 from Canela - R. S., 14 from Sao Francisco de Paula - R. S., one from Nova Petropolis - R. S., 2 from Sao Martinho da Serra - R. S. e one from Chile. Fit functions are applied to ring width time series to obtain the best long time range trend (growth rate of every tree) curves and are eliminated through a standardization process that gives the tree ring index time series from which is performed spectral analysis by maximum entropy method and iterative regression. The results obtained show periodicities close to 11 yr, 22 yr Hale solar cycles and 5.5 yr for all sampling locations 52 yr and Gleissberg cycles for Concordia - S. C. and Chile samples. El Nino events were also observed with periods around 4 e 7 yr.

Adaptive Regularization of Neural Classifiers

DEFF Research Database (Denmark)

Andersen, Lars Nonboe; Larsen, Jan; Hansen, Lars Kai

1997-01-01

We present a regularization scheme which iteratively adapts the regularization parameters by minimizing the validation error. It is suggested to use the adaptive regularization scheme in conjunction with optimal brain damage pruning to optimize the architecture and to avoid overfitting. Furthermo......, we propose an improved neural classification architecture eliminating an inherent redundancy in the widely used SoftMax classification network. Numerical results demonstrate the viability of the method...

Language study on Spliced Semigraph using Folding techniques

Science.gov (United States)

Thiagarajan, K.; Padmashree, J.

2018-04-01

In this paper, we proposed algorithm to identify cut vertices and cut edges for n-Cut Spliced Semigraph and splicing the n-Cut Spliced Semigraph using cut vertices else cut edges or combination of cut vertex and cut edge and applying sequence of folding to the spliced semigraph to obtain the semigraph quadruple η(S)=(2, 1, 1, 1). We observed that the splicing and folding using both cut vertices and cut edges is applicable only for n-Cut Spliced Semigraph where n > 2. Also, we transformed the spliced semigraph into tree structure and studied the language for the semigraph with n+2 vertices and n+1 semivertices using Depth First Edge Sequence algorithm and obtain the language structure with sequence of alphabet ‘a’ and ‘b’.

Numerical evaluation of Feynman loop integrals by reduction to tree graphs

International Nuclear Information System (INIS)

Kleinschmidt, T.

2007-12-01

We present a method for the numerical evaluation of loop integrals, based on the Feynman Tree Theorem. This states that loop graphs can be expressed as a sum of tree graphs with additional external on-shell particles. The original loop integral is replaced by a phase space integration over the additional particles. In cross section calculations and for event generation, this phase space can be sampled simultaneously with the phase space of the original external particles. Since very sophisticated matrix element generators for tree graph amplitudes exist and phase space integrations are generically well understood, this method is suited for a future implementation in a fully automated Monte Carlo event generator. A scheme for renormalization and regularization is presented. We show the construction of subtraction graphs which cancel ultraviolet divergences and present a method to cancel internal on-shell singularities. Real emission graphs can be naturally included in the phase space integral of the additional on-shell particles to cancel infrared divergences. As a proof of concept, we apply this method to NLO Bhabha scattering in QED. Cross sections are calculated and are in agreement with results from conventional methods. We also construct a Monte Carlo event generator and present results. (orig.)

Numerical evaluation of Feynman loop integrals by reduction to tree graphs

Energy Technology Data Exchange (ETDEWEB)

Kleinschmidt, T.

2007-12-15

We present a method for the numerical evaluation of loop integrals, based on the Feynman Tree Theorem. This states that loop graphs can be expressed as a sum of tree graphs with additional external on-shell particles. The original loop integral is replaced by a phase space integration over the additional particles. In cross section calculations and for event generation, this phase space can be sampled simultaneously with the phase space of the original external particles. Since very sophisticated matrix element generators for tree graph amplitudes exist and phase space integrations are generically well understood, this method is suited for a future implementation in a fully automated Monte Carlo event generator. A scheme for renormalization and regularization is presented. We show the construction of subtraction graphs which cancel ultraviolet divergences and present a method to cancel internal on-shell singularities. Real emission graphs can be naturally included in the phase space integral of the additional on-shell particles to cancel infrared divergences. As a proof of concept, we apply this method to NLO Bhabha scattering in QED. Cross sections are calculated and are in agreement with results from conventional methods. We also construct a Monte Carlo event generator and present results. (orig.)

TreeScaper: Visualizing and Extracting Phylogenetic Signal from Sets of Trees.

Science.gov (United States)

Huang, Wen; Zhou, Guifang; Marchand, Melissa; Ash, Jeremy R; Morris, David; Van Dooren, Paul; Brown, Jeremy M; Gallivan, Kyle A; Wilgenbusch, Jim C

2016-12-01

Modern phylogenomic analyses often result in large collections of phylogenetic trees representing uncertainty in individual gene trees, variation across genes, or both. Extracting phylogenetic signal from these tree sets can be challenging, as they are difficult to visualize, explore, and quantify. To overcome some of these challenges, we have developed TreeScaper, an application for tree set visualization as well as the identification of distinct phylogenetic signals. GUI and command-line versions of TreeScaper and a manual with tutorials can be downloaded from https://github.com/whuang08/TreeScaper/releases TreeScaper is distributed under the GNU General Public License. © The Author 2016. Published by Oxford University Press on behalf of the Society for Molecular Biology and Evolution. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com.

Condition Number Regularized Covariance Estimation.

Science.gov (United States)

Won, Joong-Ho; Lim, Johan; Kim, Seung-Jean; Rajaratnam, Bala

2013-06-01

Estimation of high-dimensional covariance matrices is known to be a difficult problem, has many applications, and is of current interest to the larger statistics community. In many applications including so-called the "large p small n " setting, the estimate of the covariance matrix is required to be not only invertible, but also well-conditioned. Although many regularization schemes attempt to do this, none of them address the ill-conditioning problem directly. In this paper, we propose a maximum likelihood approach, with the direct goal of obtaining a well-conditioned estimator. No sparsity assumption on either the covariance matrix or its inverse are are imposed, thus making our procedure more widely applicable. We demonstrate that the proposed regularization scheme is computationally efficient, yields a type of Steinian shrinkage estimator, and has a natural Bayesian interpretation. We investigate the theoretical properties of the regularized covariance estimator comprehensively, including its regularization path, and proceed to develop an approach that adaptively determines the level of regularization that is required. Finally, we demonstrate the performance of the regularized estimator in decision-theoretic comparisons and in the financial portfolio optimization setting. The proposed approach has desirable properties, and can serve as a competitive procedure, especially when the sample size is small and when a well-conditioned estimator is required.

Flowering Trees

Indian Academy of Sciences (India)

IAS Admin

Flowering Trees. Ailanthus excelsa Roxb. (INDIAN TREE OF. HEAVEN) of Simaroubaceae is a lofty tree with large pinnately compound alternate leaves, which are ... inflorescences, unisexual and greenish-yellow. Fruits are winged, wings many-nerved. Wood is used in making match sticks. 1. Male flower; 2. Female flower.

Pylogeny: an open-source Python framework for phylogenetic tree reconstruction and search space heuristics

Directory of Open Access Journals (Sweden)

Alexander Safatli

2015-06-01

Full Text Available Summary. Pylogeny is a cross-platform library for the Python programming language that provides an object-oriented application programming interface for phylogenetic heuristic searches. Its primary function is to permit both heuristic search and analysis of the phylogenetic tree search space, as well as to enable the design of novel algorithms to search this space. To this end, the framework supports the structural manipulation of phylogenetic trees, in particular using rearrangement operators such as NNI, SPR, and TBR, the scoring of trees using parsimony and likelihood methods, the construction of a tree search space graph, and the programmatic execution of a few existing heuristic programs. The library supports a range of common phylogenetic file formats and can be used for both nucleotide and protein data. Furthermore, it is also capable of supporting GPU likelihood calculation on nucleotide character data through the BEAGLE library.Availability. Existing development and source code is available for contribution and for download by the public from GitHub (http://github.com/AlexSafatli/Pylogeny. A stable release of this framework is available for download through PyPi (Python Package Index at http://pypi.python.org/pypi/pylogeny.

Why do trees die? Characterizing the drivers of background tree mortality

Science.gov (United States)

Das, Adrian J.; Stephenson, Nathan L.; Davis, Kristin P.

2016-01-01

The drivers of background tree mortality rates—the typical low rates of tree mortality found in forests in the absence of acute stresses like drought—are central to our understanding of forest dynamics, the effects of ongoing environmental changes on forests, and the causes and consequences of geographical gradients in the nature and strength of biotic interactions. To shed light on factors contributing to background tree mortality, we analyzed detailed pathological data from 200,668 tree-years of observation and 3,729 individual tree deaths, recorded over a 13-yr period in a network of old-growth forest plots in California's Sierra Nevada mountain range. We found that: (1) Biotic mortality factors (mostly insects and pathogens) dominated (58%), particularly in larger trees (86%). Bark beetles were the most prevalent (40%), even though there were no outbreaks during the study period; in contrast, the contribution of defoliators was negligible. (2) Relative occurrences of broad classes of mortality factors (biotic, 58%; suppression, 51%; and mechanical, 25%) are similar among tree taxa, but may vary with tree size and growth rate. (3) We found little evidence of distinct groups of mortality factors that predictably occur together on trees. Our results have at least three sets of implications. First, rather than being driven by abiotic factors such as lightning or windstorms, the “ambient” or “random” background mortality that many forest models presume to be independent of tree growth rate is instead dominated by biotic agents of tree mortality, with potentially critical implications for forecasting future mortality. Mechanistic models of background mortality, even for healthy, rapidly growing trees, must therefore include the insects and pathogens that kill trees. Second, the biotic agents of tree mortality, instead of occurring in a few predictable combinations, may generally act opportunistically and with a relatively large degree of independence from

Bayesian Recurrent Neural Network for Language Modeling.

Science.gov (United States)

Chien, Jen-Tzung; Ku, Yuan-Chu

2016-02-01

A language model (LM) is calculated as the probability of a word sequence that provides the solution to word prediction for a variety of information systems. A recurrent neural network (RNN) is powerful to learn the large-span dynamics of a word sequence in the continuous space. However, the training of the RNN-LM is an ill-posed problem because of too many parameters from a large dictionary size and a high-dimensional hidden layer. This paper presents a Bayesian approach to regularize the RNN-LM and apply it for continuous speech recognition. We aim to penalize the too complicated RNN-LM by compensating for the uncertainty of the estimated model parameters, which is represented by a Gaussian prior. The objective function in a Bayesian classification network is formed as the regularized cross-entropy error function. The regularized model is constructed not only by calculating the regularized parameters according to the maximum a posteriori criterion but also by estimating the Gaussian hyperparameter by maximizing the marginal likelihood. A rapid approximation to a Hessian matrix is developed to implement the Bayesian RNN-LM (BRNN-LM) by selecting a small set of salient outer-products. The proposed BRNN-LM achieves a sparser model than the RNN-LM. Experiments on different corpora show the robustness of system performance by applying the rapid BRNN-LM under different conditions.

Flowering Trees

Indian Academy of Sciences (India)

Flowering Trees. Gyrocarpus americanus Jacq. (Helicopter Tree) of Hernandiaceae is a moderate size deciduous tree that grows to about 12 m in height with a smooth, shining, greenish-white bark. The leaves are ovate, rarely irregularly ... flowers which are unpleasant smelling. Fruit is a woody nut with two long thin wings.

Canopy area of large trees explains aboveground biomass variations across neotropical forest landscapes

Science.gov (United States)

Meyer, Victoria; Saatchi, Sassan; Clark, David B.; Keller, Michael; Vincent, Grégoire; Ferraz, António; Espírito-Santo, Fernando; d'Oliveira, Marcus V. N.; Kaki, Dahlia; Chave, Jérôme

2018-06-01

Large tropical trees store significant amounts of carbon in woody components and their distribution plays an important role in forest carbon stocks and dynamics. Here, we explore the properties of a new lidar-derived index, the large tree canopy area (LCA) defined as the area occupied by canopy above a reference height. We hypothesize that this simple measure of forest structure representing the crown area of large canopy trees could consistently explain the landscape variations in forest volume and aboveground biomass (AGB) across a range of climate and edaphic conditions. To test this hypothesis, we assembled a unique dataset of high-resolution airborne light detection and ranging (lidar) and ground inventory data in nine undisturbed old-growth Neotropical forests, of which four had plots large enough (1 ha) to calibrate our model. We found that the LCA for trees greater than 27 m (˜ 25-30 m) in height and at least 100 m2 crown size in a unit area (1 ha), explains more than 75 % of total forest volume variations, irrespective of the forest biogeographic conditions. When weighted by average wood density of the stand, LCA can be used as an unbiased estimator of AGB across sites (R2 = 0.78, RMSE = 46.02 Mg ha-1, bias = -0.63 Mg ha-1). Unlike other lidar-derived metrics with complex nonlinear relations to biomass, the relationship between LCA and AGB is linear and remains unique across forest types. A comparison with tree inventories across the study sites indicates that LCA correlates best with the crown area (or basal area) of trees with diameter greater than 50 cm. The spatial invariance of the LCA-AGB relationship across the Neotropics suggests a remarkable regularity of forest structure across the landscape and a new technique for systematic monitoring of large trees for their contribution to AGB and changes associated with selective logging, tree mortality and other types of tropical forest disturbance and dynamics.

A constructive approach to minimal free resolutions of path ideals of trees

Directory of Open Access Journals (Sweden)

Rachelle R. Bouchat

2017-01-01

Full Text Available For a rooted tree $\\Gamma$, we consider path ideals of $\\Gamma$, which are ideals that are generated by all directed paths of a fixed length in $\\Gamma$. In this paper, we provide a combinatorial description of the minimal free resolution of these path ideals. In particular, we provide a class of subforests of $\\Gamma$ that are in one-to-one correspondence with the multi-graded Betti numbers of the path ideal as well as providing a method for determining the projective dimension and the Castelnuovo-Mumford regularity of a given path ideal.

Cache-Oblivious Search Trees via Binary Trees of Small Height

DEFF Research Database (Denmark)

Brodal, G.S.; Fagerberg, R.; Jacob, R.

2002-01-01

We propose a version of cache oblivious search trees which is simpler than the previous proposal of Bender, Demaine and Farach-Colton and has the same complexity bounds. In particular, our data structure avoids the use of weight balanced B-trees, and can be implemented as just a single array......, and range queries in worst case O(logB n + k/B) memory transfers, where k is the size of the output.The basic idea of our data structure is to maintain a dynamic binary tree of height log n+O(1) using existing methods, embed this tree in a static binary tree, which in turn is embedded in an array in a cache...... oblivious fashion, using the van Emde Boas layout of Prokop.We also investigate the practicality of cache obliviousness in the area of search trees, by providing an empirical comparison of different methods for laying out a search tree in memory....

Flowering Trees

Indian Academy of Sciences (India)

Flowering Trees. Boswellia serrata Roxb. ex Colebr. (Indian Frankincense tree) of Burseraceae is a large-sized deciduous tree that is native to India. Bark is thin, greenish-ash-coloured that exfoliates into smooth papery flakes. Stem exudes pinkish resin ... Fruit is a three-valved capsule. A green gum-resin exudes from the ...

Methane Fluxes at the Tree Stem, Soil, and Ecosystem-scales in a Cottonwood Riparian Forest

Science.gov (United States)

Flanagan, L. B.; Nikkel, D. J.; Scherloski, L. M.; Tkach, R. E.; Rood, S. B.

2017-12-01

Trees can emit methane to the atmosphere that is produced by microbes inside their decaying stems or by taking up and releasing methane that is produced by microbes in adjacent, anoxic soil layers. The significance of these two methane production pathways for possible net release to the atmosphere depends on the magnitude of simultaneous oxidation of atmospheric methane that occurs in well-aerated, shallow soil zones. In order to quantify the significance of these processes, we made methane flux measurements using the eddy covariance technique at the ecosystem-scale and via chamber-based methods applied on the soil surface and on tree stems in a riparian cottonwood ecosystem in southern Alberta that was dominated by Populus tree species and their natural hybrids. Tree stem methane fluxes varied greatly among individual Populus trees and changed seasonally, with peak growing season average values of 4 nmol m-2 s-1 (tree surface area basis). When scaled to the ecosystem, the tree stem methane emissions (0.9 nmol m-2 s-1, ground area basis) were slightly higher than average soil surface methane uptake rates (-0.8 nmol m-2 s-1). In addition, we observed regular nighttime increases in methane concentration within the forest boundary layer (by 300 nmol mol-1 on average at 22 m height during July). The majority of the methane concentration build-up was flushed from the ecosystem to the well-mixed atmosphere, with combined eddy covariance and air column storage fluxes reaching values of 70-80 nmol m-2 s-1 for approximately one hour after sunrise. Daily average net methane emission rates at the ecosystem-scale were 4.4 nmol m-2 s-1 during July. Additional lab studies demonstrated that tree stem methane was produced via the CO2-reduction pathway, as tissue in the central stem of living Populus trees was being decomposed. This study demonstrated net methane emission from an upland, cottonwood forest ecosystem, resulting from microbe methane production in tree stems that

Condition Number Regularized Covariance Estimation*

Science.gov (United States)

Won, Joong-Ho; Lim, Johan; Kim, Seung-Jean; Rajaratnam, Bala

2012-01-01

Estimation of high-dimensional covariance matrices is known to be a difficult problem, has many applications, and is of current interest to the larger statistics community. In many applications including so-called the “large p small n” setting, the estimate of the covariance matrix is required to be not only invertible, but also well-conditioned. Although many regularization schemes attempt to do this, none of them address the ill-conditioning problem directly. In this paper, we propose a maximum likelihood approach, with the direct goal of obtaining a well-conditioned estimator. No sparsity assumption on either the covariance matrix or its inverse are are imposed, thus making our procedure more widely applicable. We demonstrate that the proposed regularization scheme is computationally efficient, yields a type of Steinian shrinkage estimator, and has a natural Bayesian interpretation. We investigate the theoretical properties of the regularized covariance estimator comprehensively, including its regularization path, and proceed to develop an approach that adaptively determines the level of regularization that is required. Finally, we demonstrate the performance of the regularized estimator in decision-theoretic comparisons and in the financial portfolio optimization setting. The proposed approach has desirable properties, and can serve as a competitive procedure, especially when the sample size is small and when a well-conditioned estimator is required. PMID:23730197

DupTree: a program for large-scale phylogenetic analyses using gene tree parsimony.

Science.gov (United States)

Wehe, André; Bansal, Mukul S; Burleigh, J Gordon; Eulenstein, Oliver

2008-07-01

DupTree is a new software program for inferring rooted species trees from collections of gene trees using the gene tree parsimony approach. The program implements a novel algorithm that significantly improves upon the run time of standard search heuristics for gene tree parsimony, and enables the first truly genome-scale phylogenetic analyses. In addition, DupTree allows users to examine alternate rootings and to weight the reconciliation costs for gene trees. DupTree is an open source project written in C++. DupTree for Mac OS X, Windows, and Linux along with a sample dataset and an on-line manual are available at http://genome.cs.iastate.edu/CBL/DupTree

The Mind of the Copaíba Tree: Notes on Extractivism, Animism, and Ontology from Southern Bahia

Directory of Open Access Journals (Sweden)

Jonathan DeVore

2017-12-01

Full Text Available This article analyzes ritualized prescriptions for harvesting oleoresin or “oil” from the copaíba tree in Brazil. These harvesting prescriptions involve increasingly complex attributions of mind to the copaíba tree itself. The copaíba tree is widespread throughout the Americas, and for centuries has been well-known for the medicinal oil that can be extracted from its trunk. In Brazil, contemporary knowledge of the copaíba tree is bound up with colonial history and what were often destructive extractivist economies. Whereas historical accounts of the copaíba tree are often limited to mechanistic descriptions for extracting oil, this article examines attributions of mind that harvesters make to the copaíba tree. These attributions can be read from procedures for extracting oil. Such procedures are concerned with moon cycles, tree marking, sexual activity, and gaze. The article shows that such prescriptions have a wide transregional and interethnic distribution, from the Amazon Basin in northern Brazil to the Atlantic Forest on Bahia’s southern coast. New evidence from southern Bahia also involves prescriptions concerning speech and naming, which presuppose that the copaíba tree is sensitive to intentionality and human language. These mind attributions are inferred through pragmatic analysis of the (ontological presuppositions that are embedded by harvesting prescriptions. The contribution concludes with reflections on the implications of this presuppositional analytic approach for debates concerned with animism and the “ontological turn.”

Flowering Trees

Indian Academy of Sciences (India)

More Details Fulltext PDF. Volume 8 Issue 8 August 2003 pp 112-112 Flowering Trees. Zizyphus jujuba Lam. of Rhamnaceae · More Details Fulltext PDF. Volume 8 Issue 9 September 2003 pp 97-97 Flowering Trees. Moringa oleifera · More Details Fulltext PDF. Volume 8 Issue 10 October 2003 pp 100-100 Flowering Trees.

Embedding complete ternary tree in hypercubes using AVL trees

NARCIS (Netherlands)

S.A. Choudum; I. Raman (Indhumathi)

2008-01-01

htmlabstractA complete ternary tree is a tree in which every non-leaf vertex has exactly three children. We prove that a complete ternary tree of height h, TTh, is embeddable in a hypercube of dimension . This result coincides with the result of [2]. However, in this paper, the embedding utilizes

Ghost-tree: creating hybrid-gene phylogenetic trees for diversity analyses.

Science.gov (United States)

Fouquier, Jennifer; Rideout, Jai Ram; Bolyen, Evan; Chase, John; Shiffer, Arron; McDonald, Daniel; Knight, Rob; Caporaso, J Gregory; Kelley, Scott T

2016-02-24

Fungi play critical roles in many ecosystems, cause serious diseases in plants and animals, and pose significant threats to human health and structural integrity problems in built environments. While most fungal diversity remains unknown, the development of PCR primers for the internal transcribed spacer (ITS) combined with next-generation sequencing has substantially improved our ability to profile fungal microbial diversity. Although the high sequence variability in the ITS region facilitates more accurate species identification, it also makes multiple sequence alignment and phylogenetic analysis unreliable across evolutionarily distant fungi because the sequences are hard to align accurately. To address this issue, we created ghost-tree, a bioinformatics tool that integrates sequence data from two genetic markers into a single phylogenetic tree that can be used for diversity analyses. Our approach starts with a "foundation" phylogeny based on one genetic marker whose sequences can be aligned across organisms spanning divergent taxonomic groups (e.g., fungal families). Then, "extension" phylogenies are built for more closely related organisms (e.g., fungal species or strains) using a second more rapidly evolving genetic marker. These smaller phylogenies are then grafted onto the foundation tree by mapping taxonomic names such that each corresponding foundation-tree tip would branch into its new "extension tree" child. We applied ghost-tree to graft fungal extension phylogenies derived from ITS sequences onto a foundation phylogeny derived from fungal 18S sequences. Our analysis of simulated and real fungal ITS data sets found that phylogenetic distances between fungal communities computed using ghost-tree phylogenies explained significantly more variance than non-phylogenetic distances. The phylogenetic metrics also improved our ability to distinguish small differences (effect sizes) between microbial communities, though results were similar to non

DG TO FT - AUTOMATIC TRANSLATION OF DIGRAPH TO FAULT TREE MODELS

Science.gov (United States)

Iverson, D. L.

1994-01-01

root node. A subtree is created for each of the inputs to the digraph terminal node and the root of those subtrees are added as children of the top node of the fault tree. Every node in the digraph upstream of the terminal node will be visited and converted. During the conversion process, the algorithm keeps track of the path from the digraph terminal node to the current digraph node. If a node is visited twice, then the program has found a cycle in the digraph. This cycle is broken by finding the minimal cut sets of the twice visited digraph node and forming those cut sets into subtrees. Another implementation of the algorithm resolves loops by building a subtree based on the digraph minimal cut sets calculation. It does not reduce the subtree to minimal cut set form. This second implementation produces larger fault trees, but runs much faster than the version using minimal cut sets since it does not spend time reducing the subtrees to minimal cut sets. The fault trees produced by DG TO FT will contain OR gates, AND gates, Basic Event nodes, and NOP gates. The results of a translation can be output as a text object description of the fault tree similar to the text digraph input format. The translator can also output a LISP language formatted file and an augmented LISP file which can be used by the FTDS (ARC-13019) diagnosis system, available from COSMIC, which performs diagnostic reasoning using the fault tree as a knowledge base. DG TO FT is written in C-language to be machine independent. It has been successfully implemented on a Sun running SunOS, a DECstation running ULTRIX, a Macintosh running System 7, and a DEC VAX running VMS. The RAM requirement varies with the size of the models. DG TO FT is available in UNIX tar format on a .25 inch streaming magnetic tape cartridge (standard distribution) or on a 3.5 inch diskette. It is also available on a 3.5 inch Macintosh format diskette or on a 9-track 1600 BPI magnetic tape in DEC VAX FILES-11 format. Sample input

Trees are good, but…

Science.gov (United States)

E.G. McPherson; F. Ferrini

2010-01-01

We know that “trees are good,” and most people believe this to be true. But if this is so, why are so many trees neglected, and so many tree wells empty? An individual’s attitude toward trees may result from their firsthand encounters with specific trees. Understanding how attitudes about trees are shaped, particularly aversion to trees, is critical to the business of...

Multiple-purpose trees for pastoral farming in New Zealand: with emphasis on tree legumes. [Lucerne Tree: Medick Tree

Energy Technology Data Exchange (ETDEWEB)

Davies, D J.G.; Macfarlane, R P

1979-01-01

The potential for soil conservation and agroforestry of several native and exotic legumes is discussed. Flowering period, chemical composition of leaves/pods, hardiness to frost and drought, timber value, forage potential for livestock and bees, ornamental value and other products are tabulated with information on up to 38 species. Two low-growing species that have proved useful for slope stabilization as well as forage are tree lucerne (Cytisus palmensis) and tree medick (Medicago arborea), the latter being shrubby and more suitable for cold districts. Gleditsia triacanthos is recommended as a shade and fodder tree for farm pasture.

Modular Implementation of Programming Languages and a Partial-Order Approach to Infinitary Rewriting

DEFF Research Database (Denmark)

Bahr, Patrick

2012-01-01

In this dissertation we investigate two independent areas of research. In the first part, we develop techniques for implementing programming languages in a modular fashion. Within this problem domain, we focus on operations on typed abstract syntax trees with the goal of developing a framework...... that facilitates the definition, manipulation and composition of such operations. The result of our work is a comprehensive combinator library that provides these facilities. What sets our approach apart is the use of recursion schemes derived from tree automata in order to implement operations on abstract syntax...... trees. The second part is concerned with infinitary rewriting, a field that studies transfinite rewrite sequences. We extend the established theory of infinitary rewriting in two ways: (1) a novel approach to convergence in infinitary rewriting that replaces convergence in a metric space with the limit...

Shedding light on tree growth : ring analysis of juvenile tropical trees

NARCIS (Netherlands)

Soliz Gamboa, C.C.

2010-01-01

In the understory of tropical forests light is believed to be the main limiting growth factor for the newly established trees. Trees growing in shade of the understory may experience periods of slow radial growth. It is expected that gaps created by tree or branch fall will provoke tree growth

Inferring species trees from incongruent multi-copy gene trees using the Robinson-Foulds distance

Science.gov (United States)

2013-01-01

Background Constructing species trees from multi-copy gene trees remains a challenging problem in phylogenetics. One difficulty is that the underlying genes can be incongruent due to evolutionary processes such as gene duplication and loss, deep coalescence, or lateral gene transfer. Gene tree estimation errors may further exacerbate the difficulties of species tree estimation. Results We present a new approach for inferring species trees from incongruent multi-copy gene trees that is based on a generalization of the Robinson-Foulds (RF) distance measure to multi-labeled trees (mul-trees). We prove that it is NP-hard to compute the RF distance between two mul-trees; however, it is easy to calculate this distance between a mul-tree and a singly-labeled species tree. Motivated by this, we formulate the RF problem for mul-trees (MulRF) as follows: Given a collection of multi-copy gene trees, find a singly-labeled species tree that minimizes the total RF distance from the input mul-trees. We develop and implement a fast SPR-based heuristic algorithm for the NP-hard MulRF problem. We compare the performance of the MulRF method (available at http://genome.cs.iastate.edu/CBL/MulRF/) with several gene tree parsimony approaches using gene tree simulations that incorporate gene tree error, gene duplications and losses, and/or lateral transfer. The MulRF method produces more accurate species trees than gene tree parsimony approaches. We also demonstrate that the MulRF method infers in minutes a credible plant species tree from a collection of nearly 2,000 gene trees. Conclusions Our new phylogenetic inference method, based on a generalized RF distance, makes it possible to quickly estimate species trees from large genomic data sets. Since the MulRF method, unlike gene tree parsimony, is based on a generic tree distance measure, it is appealing for analyses of genomic data sets, in which many processes such as deep coalescence, recombination, gene duplication and losses as

English language pre-service and in-service teachers’ self-efficacy and attitudes towards integration of students with learning difficulties

Directory of Open Access Journals (Sweden)

Cimermanová Ivana

2017-01-01

Full Text Available The study of foreign languages is obligatory for all pupils in Slovakia, where the first foreign language is English. Conforming to integration legislation, pupils with special educational needs (SEN are taught in mainstream classes. Foreign language teachers, however, lack training and where not prepared how to apply teaching methods and techniques for pupils with SEN in the regular language learning class. In the study presented, 187 elementary school teachers filled out questionnaires dealing with integration of pupils with SEN and possible inclusion of learners with disabilities in Slovakia and a group of 56 university FLT students - teachers-to-be. Teachers are not forced and/or encouraged to take part in in-service courses or other education on how to teach these pupils. The pre-service teachers are offered courses on SEN teaching, however, these are not compulsory and mostly general education oriented. The majority of in-service and pre-service teachers felt that pupils with SEN should be taught in regular education class. The article also describes the current situation concerning integration of students with SEN using the official statistical data.

[Event-related brain potentials when Russian verbs being conjugated: to the problem of language processing modularity].

Science.gov (United States)

Dan'ko, S G; Boĭtsova, Iu A; Solov'eva, M L; Chernigovskaia, T V; Medvedev, S V

2014-01-01

In the light of alternative conceptions of "two-system" and "single-system" models of language processing the efforts have been undertaken to study brain mechanisnis for generation of regular and irregular forms of Russian verbs. The 19 EEG channels of evoked activity were registered along with casual alternations of speech morphology operations to be compared. Verbs of imperfective aspect in the form of an infinitive, belonging either to a group of productive verbs (default, conventionally regular class), or toan unproductive group of verbs (conventionally irregular class) were presented to healthy subjects. The subjects were requested to produce first person present time forms of these verbs. Results of analysis of event related potentials (ERP) for a group of 22 persons are presented. Statistically reliable ERP amplitude distinctions between the verb groups are found onlyin the latencies 600-850 ms in central and parietal zones of the cortex. In these latencies ERP values associated with a presentation of irregular verbs are negative in relation to ERP values associated with the presentation of regular verbs. The received results are interpreted as a consequence of various complexity of mental work with verbs of these different groups and presumably don't support a hypothesis of universality of the "two-system" brain mechanism for processing of the regular and irregular language forms.

Notes on the Phonological History of the Austronesian Languages of the Sarmi Coast.

Science.gov (United States)

Grace, George W.

This study analyzes the sound correspondences of six Oceanic languages using reconstructed forms from Proto-Oceanic as a frame of reference. Sobei, Wakde, Masimasi, Anus, Bojgo, and Tarpia provide the cognates used in the analysis. Consonants and vowels are analyzed, and sound correspondences are examined for regularity of development and possible…

Trees

Science.gov (United States)

Al-Khaja, Nawal

2007-01-01

This is a thematic lesson plan for young learners about palm trees and the importance of taking care of them. The two part lesson teaches listening, reading and speaking skills. The lesson includes parts of a tree; the modal auxiliary, can; dialogues and a role play activity.

Regularity effect in prospective memory during aging

Directory of Open Access Journals (Sweden)

Geoffrey Blondelle

2016-10-01

Full Text Available Background: Regularity effect can affect performance in prospective memory (PM, but little is known on the cognitive processes linked to this effect. Moreover, its impacts with regard to aging remain unknown. To our knowledge, this study is the first to examine regularity effect in PM in a lifespan perspective, with a sample of young, intermediate, and older adults. Objective and design: Our study examined the regularity effect in PM in three groups of participants: 28 young adults (18–30, 16 intermediate adults (40–55, and 25 older adults (65–80. The task, adapted from the Virtual Week, was designed to manipulate the regularity of the various activities of daily life that were to be recalled (regular repeated activities vs. irregular non-repeated activities. We examine the role of several cognitive functions including certain dimensions of executive functions (planning, inhibition, shifting, and binding, short-term memory, and retrospective episodic memory to identify those involved in PM, according to regularity and age. Results: A mixed-design ANOVA showed a main effect of task regularity and an interaction between age and regularity: an age-related difference in PM performances was found for irregular activities (older < young, but not for regular activities. All participants recalled more regular activities than irregular ones with no age effect. It appeared that recalling of regular activities only involved planning for both intermediate and older adults, while recalling of irregular ones were linked to planning, inhibition, short-term memory, binding, and retrospective episodic memory. Conclusion: Taken together, our data suggest that planning capacities seem to play a major role in remembering to perform intended actions with advancing age. Furthermore, the age-PM-paradox may be attenuated when the experimental design is adapted by implementing a familiar context through the use of activities of daily living. The clinical

Punctuated equilibrium in the large-scale evolution of programming languages.

Science.gov (United States)

Valverde, Sergi; Solé, Ricard V

2015-06-06

The analogies and differences between biological and cultural evolution have been explored by evolutionary biologists, historians, engineers and linguists alike. Two well-known domains of cultural change are language and technology. Both share some traits relating the evolution of species, but technological change is very difficult to study. A major challenge in our way towards a scientific theory of technological evolution is how to properly define evolutionary trees or clades and how to weight the role played by horizontal transfer of information. Here, we study the large-scale historical development of programming languages, which have deeply marked social and technological advances in the last half century. We analyse their historical connections using network theory and reconstructed phylogenetic networks. Using both data analysis and network modelling, it is shown that their evolution is highly uneven, marked by innovation events where new languages are created out of improved combinations of different structural components belonging to previous languages. These radiation events occur in a bursty pattern and are tied to novel technological and social niches. The method can be extrapolated to other systems and consistently captures the major classes of languages and the widespread horizontal design exchanges, revealing a punctuated evolutionary path. © 2015 The Author(s) Published by the Royal Society. All rights reserved.

A geographical analysis of speech-language pathology services to support multilingual children.

Science.gov (United States)

Verdon, Sarah; McLeod, Sharynne; McDonald, Simon

2014-06-01

The speech-language pathology workforce strives to provide equitable, quality services to multilingual people. However, the extent to which this is being achieved is unknown. Participants in this study were 2849 members of Speech Pathology Australia and 4386 children in the Birth cohort of the Longitudinal Study of Australian Children (LSAC). Statistical and geospatial analyses were undertaken to identify the linguistic diversity and geographical distribution of Australian speech-language pathology services and Australian children. One fifth of services offered by Speech Pathology Australia members (20.2%) were available in a language other than English. Services were most commonly offered in Australian Sign Language (Auslan) (4.3%), French (3.1%), Italian (2.2%), Greek (1.6%), and Cantonese (1.5%). Among 4-5-year-old children in the nationally representative LSAC, 15.3% regularly spoke and/or understood a language other than English. The most common languages spoken by the children were Arabic (1.5%), Italian (1.2%), Greek (0.9%), Spanish (0.9%), and Vietnamese (0.9%). There was a mismatch between the location of and languages in which multilingual services were offered, and the location of and languages spoken by children. These findings highlight the need for SLPs to be culturally competent in providing equitable services to all clients, regardless of the languages they speak.

J-regular rings with injectivities

OpenAIRE

Shen, Liang

2010-01-01

A ring $R$ is called a J-regular ring if R/J(R) is von Neumann regular, where J(R) is the Jacobson radical of R. It is proved that if R is J-regular, then (i) R is right n-injective if and only if every homomorphism from an $n$-generated small right ideal of $R$ to $R_{R}$ can be extended to one from $R_{R}$ to $R_{R}$; (ii) R is right FP-injective if and only if R is right (J, R)-FP-injective. Some known results are improved.

Spectra of chemical trees

International Nuclear Information System (INIS)

Balasubramanian, K.

1982-01-01

A method is developed for obtaining the spectra of trees of NMR and chemical interests. The characteristic polynomials of branched trees can be obtained in terms of the characteristic polynomials of unbranched trees and branches by pruning the tree at the joints. The unbranched trees can also be broken down further until a tree containing just two vertices is obtained. The effectively reduces the order of the secular determinant of the tree used at the beginning to determinants of orders atmost equal to the number of vertices in the branch containing the largest number of vertices. An illustrative example of a NMR graph is given for which the 22 x 22 secular determinant is reduced to determinants of orders atmost 4 x 4 in just the second step of the algorithm. The tree pruning algorithm can be applied even to trees with no symmetry elements and such a factoring can be achieved. Methods developed here can be elegantly used to find if two trees are cospectral and to construct cospectral trees

Random Forest-Based Recognition of Isolated Sign Language Subwords Using Data from Accelerometers and Surface Electromyographic Sensors.

Science.gov (United States)

Su, Ruiliang; Chen, Xiang; Cao, Shuai; Zhang, Xu

2016-01-14

Sign language recognition (SLR) has been widely used for communication amongst the hearing-impaired and non-verbal community. This paper proposes an accurate and robust SLR framework using an improved decision tree as the base classifier of random forests. This framework was used to recognize Chinese sign language subwords using recordings from a pair of portable devices worn on both arms consisting of accelerometers (ACC) and surface electromyography (sEMG) sensors. The experimental results demonstrated the validity of the proposed random forest-based method for recognition of Chinese sign language (CSL) subwords. With the proposed method, 98.25% average accuracy was obtained for the classification of a list of 121 frequently used CSL subwords. Moreover, the random forests method demonstrated a superior performance in resisting the impact of bad training samples. When the proportion of bad samples in the training set reached 50%, the recognition error rate of the random forest-based method was only 10.67%, while that of a single decision tree adopted in our previous work was almost 27.5%. Our study offers a practical way of realizing a robust and wearable EMG-ACC-based SLR systems.

Juvenile wood volume and its proportion to stem volume vs. selected biometric features of Scots pine (Pinus sylvestris L. trees

Directory of Open Access Journals (Sweden)

Arkadiusz Tomczak

2011-01-01

Full Text Available The aim of the study was to determine whether there is a correlation between breast height diameter, tree height and stem total volume of Scots pines, on the one hand, and volume and proportion of juvenile wood, on the other. The investigations comprised pure pine stands of the IInd, IIIrd, IVth and Vth age classes developed in conditions of fresh mixed coniferous forest. A distinct curvilinear correlation was found between volume and proportion of juvenile wood in tree stems and breast height diameter, height and stem total volume. Because of high values of determination coefficients (R2, which characterised the above-mentioned correlations, it seems appropriate to use these regularities to assess the quality of the timber raw material regarding the proportions of its volume and juvenile wood in stems of Scots pine trees.

MeshTree: A Delay optimised Overlay Multicast Tree Building Protocol

OpenAIRE

Tan, Su-Wei; Waters, A. Gill; Crawford, John

2005-01-01

We study decentralised low delay degree-constrained overlay multicast tree construction for single source real-time applications. This optimisation problem is NP-hard even if computed centrally. We identify two problems in traditional distributed solutions, namely the greedy problem and delay-cost trade-off. By offering solutions to these problems, we propose a new self-organising distributed tree building protocol called MeshTree. The main idea is to embed the delivery tree in a degree-bound...

Minimum variance rooting of phylogenetic trees and implications for species tree reconstruction.

Science.gov (United States)

Mai, Uyen; Sayyari, Erfan; Mirarab, Siavash

2017-01-01

Phylogenetic trees inferred using commonly-used models of sequence evolution are unrooted, but the root position matters both for interpretation and downstream applications. This issue has been long recognized; however, whether the potential for discordance between the species tree and gene trees impacts methods of rooting a phylogenetic tree has not been extensively studied. In this paper, we introduce a new method of rooting a tree based on its branch length distribution; our method, which minimizes the variance of root to tip distances, is inspired by the traditional midpoint rerooting and is justified when deviations from the strict molecular clock are random. Like midpoint rerooting, the method can be implemented in a linear time algorithm. In extensive simulations that consider discordance between gene trees and the species tree, we show that the new method is more accurate than midpoint rerooting, but its relative accuracy compared to using outgroups to root gene trees depends on the size of the dataset and levels of deviations from the strict clock. We show high levels of error for all methods of rooting estimated gene trees due to factors that include effects of gene tree discordance, deviations from the clock, and gene tree estimation error. Our simulations, however, did not reveal significant differences between two equivalent methods for species tree estimation that use rooted and unrooted input, namely, STAR and NJst. Nevertheless, our results point to limitations of existing scalable rooting methods.

Dynamic Ising model: reconstruction of evolutionary trees

International Nuclear Information System (INIS)

De Oliveira, P M C

2013-01-01

An evolutionary tree is a cascade of bifurcations starting from a single common root, generating a growing set of daughter species as time goes by. ‘Species’ here is a general denomination for biological species, spoken languages or any other entity which evolves through heredity. From the N currently alive species within a clade, distances are measured through pairwise comparisons made by geneticists, linguists, etc. The larger is such a distance that, for a pair of species, the older is their last common ancestor. The aim is to reconstruct the previously unknown bifurcations, i.e. the whole clade, from knowledge of the N(N − 1)/2 quoted distances, which are taken for granted. A mechanical method is presented and its applicability is discussed. (paper)

Iterative Regularization with Minimum-Residual Methods

DEFF Research Database (Denmark)

Jensen, Toke Koldborg; Hansen, Per Christian

2007-01-01

subspaces. We provide a combination of theory and numerical examples, and our analysis confirms the experience that MINRES and MR-II can work as general regularization methods. We also demonstrate theoretically and experimentally that the same is not true, in general, for GMRES and RRGMRES their success......We study the regularization properties of iterative minimum-residual methods applied to discrete ill-posed problems. In these methods, the projection onto the underlying Krylov subspace acts as a regularizer, and the emphasis of this work is on the role played by the basis vectors of these Krylov...... as regularization methods is highly problem dependent....

Iterative regularization with minimum-residual methods

DEFF Research Database (Denmark)

Jensen, Toke Koldborg; Hansen, Per Christian

2006-01-01

subspaces. We provide a combination of theory and numerical examples, and our analysis confirms the experience that MINRES and MR-II can work as general regularization methods. We also demonstrate theoretically and experimentally that the same is not true, in general, for GMRES and RRGMRES - their success......We study the regularization properties of iterative minimum-residual methods applied to discrete ill-posed problems. In these methods, the projection onto the underlying Krylov subspace acts as a regularizer, and the emphasis of this work is on the role played by the basis vectors of these Krylov...... as regularization methods is highly problem dependent....

Scheduling language and algorithm development study. Volume 2, phase 2: Introduction to plans programming. [user guide

Science.gov (United States)

Cochran, D. R.; Ishikawa, M. K.; Paulson, R. E.; Ramsey, H. R.

1975-01-01

A user guide for the Programming Language for Allocation and Network Scheduling (PLANS) is presented. Information is included for the construction of PLANS programs. The basic philosophy of PLANS is discussed, and access and update reference techniques are described along with the use of tree structures.

Multiple graph regularized protein domain ranking.

Science.gov (United States)

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

2012-11-19

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

TreePlus: interactive exploration of networks with enhanced tree layouts.

Science.gov (United States)

Lee, Bongshin; Parr, Cynthia S; Plaisant, Catherine; Bederson, Benjamin B; Veksler, Vladislav D; Gray, Wayne D; Kotfila, Christopher

2006-01-01

Despite extensive research, it is still difficult to produce effective interactive layouts for large graphs. Dense layout and occlusion make food webs, ontologies, and social networks difficult to understand and interact with. We propose a new interactive Visual Analytics component called TreePlus that is based on a tree-style layout. TreePlus reveals the missing graph structure with visualization and interaction while maintaining good readability. To support exploration of the local structure of the graph and gathering of information from the extensive reading of labels, we use a guiding metaphor of "Plant a seed and watch it grow." It allows users to start with a node and expand the graph as needed, which complements the classic overview techniques that can be effective at (but often limited to) revealing clusters. We describe our design goals, describe the interface, and report on a controlled user study with 28 participants comparing TreePlus with a traditional graph interface for six tasks. In general, the advantage of TreePlus over the traditional interface increased as the density of the displayed data increased. Participants also reported higher levels of confidence in their answers with TreePlus and most of them preferred TreePlus.

Refining discordant gene trees.

Science.gov (United States)

Górecki, Pawel; Eulenstein, Oliver

2014-01-01

Evolutionary studies are complicated by discordance between gene trees and the species tree in which they evolved. Dealing with discordant trees often relies on comparison costs between gene and species trees, including the well-established Robinson-Foulds, gene duplication, and deep coalescence costs. While these costs have provided credible results for binary rooted gene trees, corresponding cost definitions for non-binary unrooted gene trees, which are frequently occurring in practice, are challenged by biological realism. We propose a natural extension of the well-established costs for comparing unrooted and non-binary gene trees with rooted binary species trees using a binary refinement model. For the duplication cost we describe an efficient algorithm that is based on a linear time reduction and also computes an optimal rooted binary refinement of the given gene tree. Finally, we show that similar reductions lead to solutions for computing the deep coalescence and the Robinson-Foulds costs. Our binary refinement of Robinson-Foulds, gene duplication, and deep coalescence costs for unrooted and non-binary gene trees together with the linear time reductions provided here for computing these costs significantly extends the range of trees that can be incorporated into approaches dealing with discordance.

General three-state model with biased population replacement: Analytical solution and application to language dynamics

Science.gov (United States)

Colaiori, Francesca; Castellano, Claudio; Cuskley, Christine F.; Loreto, Vittorio; Pugliese, Martina; Tria, Francesca

2015-01-01

Empirical evidence shows that the rate of irregular usage of English verbs exhibits discontinuity as a function of their frequency: the most frequent verbs tend to be totally irregular. We aim to qualitatively understand the origin of this feature by studying simple agent-based models of language dynamics, where each agent adopts an inflectional state for a verb and may change it upon interaction with other agents. At the same time, agents are replaced at some rate by new agents adopting the regular form. In models with only two inflectional states (regular and irregular), we observe that either all verbs regularize irrespective of their frequency, or a continuous transition occurs between a low-frequency state, where the lemma becomes fully regular, and a high-frequency one, where both forms coexist. Introducing a third (mixed) state, wherein agents may use either form, we find that a third, qualitatively different behavior may emerge, namely, a discontinuous transition in frequency. We introduce and solve analytically a very general class of three-state models that allows us to fully understand these behaviors in a unified framework. Realistic sets of interaction rules, including the well-known naming game (NG) model, result in a discontinuous transition, in agreement with recent empirical findings. We also point out that the distinction between speaker and hearer in the interaction has no effect on the collective behavior. The results for the general three-state model, although discussed in terms of language dynamics, are widely applicable.

Development of a QGIS Plugin to Obtain Parameters and Elements of Plantation Trees and Vineyards with Aerial Photographs

Directory of Open Access Journals (Sweden)

Lia Duarte

2018-03-01

Full Text Available Unmanned Aerial Vehicle (UAV imagery allows for a new way of obtaining geographic information. In this work, a Geographical Information System (GIS open source application was developed in QGIS software that estimates several parameters and metrics on tree crown through image analysis techniques (image segmentation and image classification and fractal analysis. The metrics that have been estimated were: area, perimeter, number of trees, distance between trees, and a missing tree check. This methodology was tested on three different plantations: olive, eucalyptus, and vineyard. The application developed is free, open source and takes advantage of QGIS integration with external software. Several tools available from Orfeo Toolbox and Geographic Resources Analysis Support System (GRASS GIS were employed to generate a classified raster image which allows calculating the metrics referred before. The application was developed in the Python 2.7 language. Also, some functions, modules, and classes from the QGIS Application Programming Interface (API and PyQt4 API were used. This new plugin is a valuable tool, which allowed for automatizing several parameters and metrics on tree crown using GIS analysis tools, while considering data acquired by UAV.

Visual statistical learning is related to natural language ability in adults: An ERP study.

Science.gov (United States)

Daltrozzo, Jerome; Emerson, Samantha N; Deocampo, Joanne; Singh, Sonia; Freggens, Marjorie; Branum-Martin, Lee; Conway, Christopher M

2017-03-01

Statistical learning (SL) is believed to enable language acquisition by allowing individuals to learn regularities within linguistic input. However, neural evidence supporting a direct relationship between SL and language ability is scarce. We investigated whether there are associations between event-related potential (ERP) correlates of SL and language abilities while controlling for the general level of selective attention. Seventeen adults completed tests of visual SL, receptive vocabulary, grammatical ability, and sentence completion. Response times and ERPs showed that SL is related to receptive vocabulary and grammatical ability. ERPs indicated that the relationship between SL and grammatical ability was independent of attention while the association between SL and receptive vocabulary depended on attention. The implications of these dissociative relationships in terms of underlying mechanisms of SL and language are discussed. These results further elucidate the cognitive nature of the links between SL mechanisms and language abilities. Copyright © 2017 Elsevier Inc. All rights reserved.

Boosting bonsai trees for handwritten/printed text discrimination

Science.gov (United States)

Ricquebourg, Yann; Raymond, Christian; Poirriez, Baptiste; Lemaitre, Aurélie; Coüasnon, Bertrand

2013-12-01

Boosting over decision-stumps proved its efficiency in Natural Language Processing essentially with symbolic features, and its good properties (fast, few and not critical parameters, not sensitive to over-fitting) could be of great interest in the numeric world of pixel images. In this article we investigated the use of boosting over small decision trees, in image classification processing, for the discrimination of handwritten/printed text. Then, we conducted experiments to compare it to usual SVM-based classification revealing convincing results with very close performance, but with faster predictions and behaving far less as a black-box. Those promising results tend to make use of this classifier in more complex recognition tasks like multiclass problems.

Simple street tree sampling

Science.gov (United States)

David J. Nowak; Jeffrey T. Walton; James Baldwin; Jerry. Bond

2015-01-01

Information on street trees is critical for management of this important resource. Sampling of street tree populations provides an efficient means to obtain street tree population information. Long-term repeat measures of street tree samples supply additional information on street tree changes and can be used to report damages from catastrophic events. Analyses of...

TreeFam: a curated database of phylogenetic trees of animal gene families

DEFF Research Database (Denmark)

Li, Heng; Coghlan, Avril; Ruan, Jue

2006-01-01

TreeFam is a database of phylogenetic trees of gene families found in animals. It aims to develop a curated resource that presents the accurate evolutionary history of all animal gene families, as well as reliable ortholog and paralog assignments. Curated families are being added progressively......, based on seed alignments and trees in a similar fashion to Pfam. Release 1.1 of TreeFam contains curated trees for 690 families and automatically generated trees for another 11 646 families. These represent over 128 000 genes from nine fully sequenced animal genomes and over 45 000 other animal proteins...

Cultural phylogeography of the Bantu Languages of sub-Saharan Africa.

Science.gov (United States)

Currie, Thomas E; Meade, Andrew; Guillon, Myrtille; Mace, Ruth

2013-07-07

There is disagreement about the routes taken by populations speaking Bantu languages as they expanded to cover much of sub-Saharan Africa. Here, we build phylogenetic trees of Bantu languages and map them onto geographical space in order to assess the likely pathway of expansion and test between dispersal scenarios. The results clearly support a scenario in which groups first moved south through the rainforest from a homeland somewhere near the Nigeria-Cameroon border. Emerging on the south side of the rainforest, one branch moved south and west. Another branch moved towards the Great Lakes, eventually giving rise to the monophyletic clade of East Bantu languages that inhabit East and Southeastern Africa. These phylogenies also reveal information about more general processes involved in the diversification of human populations into distinct ethnolinguistic groups. Our study reveals that Bantu languages show a latitudinal gradient in covering greater areas with increasing distance from the equator. Analyses suggest that this pattern reflects a true ecological relationship rather than merely being an artefact of shared history. The study shows how a phylogeographic approach can address questions relating to the specific histories of certain groups, as well as general cultural evolutionary processes.

Spectral curves in gauge/string dualities: integrability, singular sectors and regularization

International Nuclear Information System (INIS)

Konopelchenko, Boris; Alonso, Luis Martínez; Medina, Elena

2013-01-01

We study the moduli space of the spectral curves y 2 = W′(z) 2 + f(z) which characterize the vacua of N=1 U(n) supersymmetric gauge theories with an adjoint Higgs field and a polynomial tree level potential W(z). The integrable structure of the Whitham equations is used to determine the spectral curves from their moduli. An alternative characterization of the spectral curves in terms of critical points of a family of polynomial solutions W to Euler–Poisson–Darboux equations is provided. The equations for these critical points are a generalization of the planar limit equations for one-cut random matrix models. Moreover, singular spectral curves with higher order branch points turn out to be described by degenerate critical points of W. As a consequence we propose a multiple scaling limit method of regularization and show that, in the simplest cases, it leads to the Painlevè-I equation and its multi-component generalizations. (paper)

Tree-space statistics and approximations for large-scale analysis of anatomical trees

DEFF Research Database (Denmark)

Feragen, Aasa; Owen, Megan; Petersen, Jens

2013-01-01

parametrize the relevant parts of tree-space well. Using the developed approximate statistics, we illustrate how the structure and geometry of airway trees vary across a population and show that airway trees with Chronic Obstructive Pulmonary Disease come from a different distribution in tree-space than...

Higher derivative regularization and chiral anomaly

International Nuclear Information System (INIS)

Nagahama, Yoshinori.

1985-02-01

A higher derivative regularization which automatically leads to the consistent chiral anomaly is analyzed in detail. It explicitly breaks all the local gauge symmetry but preserves global chiral symmetry and leads to the chirally symmetric consistent anomaly. This regularization thus clarifies the physics content contained in the consistent anomaly. We also briefly comment on the application of this higher derivative regularization to massless QED. (author)

Language Teachers' Target Language Project: Language for Specific Purposes of Language Teaching

Science.gov (United States)

Korenev, Alexey; Westbrook, Carolyn; Merry, Yvonne; Ershova, Tatiana

2016-01-01

The Language Teachers' Target Language project (LTTL) aims to describe language teachers' target language use domain (Bachman & Palmer 2010) and to develop a language test for future teachers of English. The team comprises four researchers from Moscow State University (MSU) and Southampton Solent University.

Relating phylogenetic trees to transmission trees of infectious disease outbreaks.

Science.gov (United States)

Ypma, Rolf J F; van Ballegooijen, W Marijn; Wallinga, Jacco

2013-11-01

Transmission events are the fundamental building blocks of the dynamics of any infectious disease. Much about the epidemiology of a disease can be learned when these individual transmission events are known or can be estimated. Such estimations are difficult and generally feasible only when detailed epidemiological data are available. The genealogy estimated from genetic sequences of sampled pathogens is another rich source of information on transmission history. Optimal inference of transmission events calls for the combination of genetic data and epidemiological data into one joint analysis. A key difficulty is that the transmission tree, which describes the transmission events between infected hosts, differs from the phylogenetic tree, which describes the ancestral relationships between pathogens sampled from these hosts. The trees differ both in timing of the internal nodes and in topology. These differences become more pronounced when a higher fraction of infected hosts is sampled. We show how the phylogenetic tree of sampled pathogens is related to the transmission tree of an outbreak of an infectious disease, by the within-host dynamics of pathogens. We provide a statistical framework to infer key epidemiological and mutational parameters by simultaneously estimating the phylogenetic tree and the transmission tree. We test the approach using simulations and illustrate its use on an outbreak of foot-and-mouth disease. The approach unifies existing methods in the emerging field of phylodynamics with transmission tree reconstruction methods that are used in infectious disease epidemiology.

Multiple graph regularized protein domain ranking

KAUST Repository

Wang, Jim Jing-Yan

2012-11-19

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

Multiple graph regularized protein domain ranking

KAUST Repository

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

2012-01-01

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

Multiple graph regularized protein domain ranking

Directory of Open Access Journals (Sweden)

Wang Jim

2012-11-01

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

Tree-growth analyses to estimate tree species' drought tolerance.

Science.gov (United States)

Eilmann, Britta; Rigling, Andreas

2012-02-01

Climate change is challenging forestry management and practices. Among other things, tree species with the ability to cope with more extreme climate conditions have to be identified. However, while environmental factors may severely limit tree growth or even cause tree death, assessing a tree species' potential for surviving future aggravated environmental conditions is rather demanding. The aim of this study was to find a tree-ring-based method suitable for identifying very drought-tolerant species, particularly potential substitute species for Scots pine (Pinus sylvestris L.) in Valais. In this inner-Alpine valley, Scots pine used to be the dominating species for dry forests, but today it suffers from high drought-induced mortality. We investigate the growth response of two native tree species, Scots pine and European larch (Larix decidua Mill.), and two non-native species, black pine (Pinus nigra Arnold) and Douglas fir (Pseudotsuga menziesii Mirb. var. menziesii), to drought. This involved analysing how the radial increment of these species responded to increasing water shortage (abandonment of irrigation) and to increasingly frequent drought years. Black pine and Douglas fir are able to cope with drought better than Scots pine and larch, as they show relatively high radial growth even after irrigation has been stopped and a plastic growth response to drought years. European larch does not seem to be able to cope with these dry conditions as it lacks the ability to recover from drought years. The analysis of trees' short-term response to extreme climate events seems to be the most promising and suitable method for detecting how tolerant a tree species is towards drought. However, combining all the methods used in this study provides a complete picture of how water shortage could limit species.

Are trees long-lived?

Science.gov (United States)

Kevin T. Smith

2009-01-01

Trees and tree care can capture the best of people's motivations and intentions. Trees are living memorials that help communities heal at sites of national tragedy, such as Oklahoma City and the World Trade Center. We mark the places of important historical events by the trees that grew nearby even if the original tree, such as the Charter Oak in Connecticut or...

75 FR 53966 - Regular Meeting

Science.gov (United States)

2010-09-02

... FARM CREDIT SYSTEM INSURANCE CORPORATION Regular Meeting AGENCY: Farm Credit System Insurance Corporation Board. SUMMARY: Notice is hereby given of the regular meeting of the Farm Credit System Insurance Corporation Board (Board). DATE AND TIME: The meeting of the Board will be held at the offices of the Farm...

Using Boosted Decision Trees to look for displaced Jets in the ATLAS Calorimeter

CERN Multimedia

CERN. Geneva

2017-01-01

A boosted decision tree is used to identify unique jets in a recently released conference note describing a search for long lived particles decaying to hadrons in the ATLAS Calorimeter. Neutral Long lived particles decaying to hadrons are “typical” signatures in a lot of models including Hidden Valley models, Higgs Portal Models, Baryogenesis, Stealth SUSY, etc. Long lived neutral particles that decay in the calorimeter leave behind an object that looks like a regular Standard Model jet, with subtle differences. For example, the later in the calorimeter it decays, the less energy will be deposited in the early layers of the calorimeter. Because the jet does not originate at the interaction point, it will likely be more narrow as reconstructed by the standard Anti-kT jet reconstruction algorithm used by ATLAS. To separate the jets due to neutral long lived decays from the standard model jets we used a boosted decision tree with thirteen variables as inputs. We used the information from the boosted decision...

Work and family life of childrearing women workers in Japan: comparison of non-regular employees with short working hours, non-regular employees with long working hours, and regular employees.

Science.gov (United States)

Seto, Masako; Morimoto, Kanehisa; Maruyama, Soichiro

2006-05-01

This study assessed the working and family life characteristics, and the degree of domestic and work strain of female workers with different employment statuses and weekly working hours who are rearing children. Participants were the mothers of preschoolers in a large Japanese city. We classified the women into three groups according to the hours they worked and their employment conditions. The three groups were: non-regular employees working less than 30 h a week (n=136); non-regular employees working 30 h or more per week (n=141); and regular employees working 30 h or more a week (n=184). We compared among the groups the subjective values of work, financial difficulties, childcare and housework burdens, psychological effects, and strains such as work and family strain, work-family conflict, and work dissatisfaction. Regular employees were more likely to report job pressures and inflexible work schedules and to experience more strain related to work and family than non-regular employees. Non-regular employees were more likely to be facing financial difficulties. In particular, non-regular employees working longer hours tended to encounter socioeconomic difficulties and often lacked support from family and friends. Female workers with children may have different social backgrounds and different stressors according to their working hours and work status.

RAFT: a computer program for fault tree risk calculations

International Nuclear Information System (INIS)

Seybold, G.D.

1977-11-01

A description and user instructions are presented for RAFT, a FORTRAN computer code for calculation of a risk measure for fault tree cut sets. RAFT calculates release quantities and a risk measure based on the product of probability and release quantity for cut sets of fault trees modeling the accidental release of radioactive material from a nuclear fuel cycle facility. Cut sets and their probabilities are supplied as input to RAFT from an external fault tree analysis code. Using the total inventory available of radioactive material, along with release fractions for each event in a cut set, the release terms are calculated for each cut set. Each release term is multiplied by the cut set probability to yield the cut set risk measure. RAFT orders the dominant cut sets on the risk measure. The total risk measure of processed cut sets and their fractional contributions are supplied as output. Input options are available to eliminate redundant cut sets, apply threshold values on cut set probability and risk, and control the total number of cut sets output. Hash addressing is used to remove redundant cut sets from the analysis. Computer hardware and software restrictions are given along with a sample problem and cross-reference table of the code. Except for the use of file management utilities, RAFT is written exclusively in FORTRAN language and is operational on a Control Data, CYBER 74-18--series computer system. 4 figures

There's Life in Hazard Trees

Science.gov (United States)

Mary Torsello; Toni McLellan

The goals of hazard tree management programs are to maximize public safety and maintain a healthy sustainable tree resource. Although hazard tree management frequently targets removal of trees or parts of trees that attract wildlife, it can take into account a diversity of tree values. With just a little extra planning, hazard tree management can be highly beneficial...

Fast Tree: Computing Large Minimum-Evolution Trees with Profiles instead of a Distance Matrix

Energy Technology Data Exchange (ETDEWEB)

N. Price, Morgan; S. Dehal, Paramvir; P. Arkin, Adam

2009-07-31

Gene families are growing rapidly, but standard methods for inferring phylogenies do not scale to alignments with over 10,000 sequences. We present FastTree, a method for constructing large phylogenies and for estimating their reliability. Instead of storing a distance matrix, FastTree stores sequence profiles of internal nodes in the tree. FastTree uses these profiles to implement neighbor-joining and uses heuristics to quickly identify candidate joins. FastTree then uses nearest-neighbor interchanges to reduce the length of the tree. For an alignment with N sequences, L sites, and a different characters, a distance matrix requires O(N^2) space and O(N^2 L) time, but FastTree requires just O( NLa + N sqrt(N) ) memory and O( N sqrt(N) log(N) L a ) time. To estimate the tree's reliability, FastTree uses local bootstrapping, which gives another 100-fold speedup over a distance matrix. For example, FastTree computed a tree and support values for 158,022 distinct 16S ribosomal RNAs in 17 hours and 2.4 gigabytes of memory. Just computing pairwise Jukes-Cantor distances and storing them, without inferring a tree or bootstrapping, would require 17 hours and 50 gigabytes of memory. In simulations, FastTree was slightly more accurate than neighbor joining, BIONJ, or FastME; on genuine alignments, FastTree's topologies had higher likelihoods. FastTree is available at http://microbesonline.org/fasttree.

Incremental projection approach of regularization for inverse problems

Energy Technology Data Exchange (ETDEWEB)

Souopgui, Innocent, E-mail: innocent.souopgui@usm.edu [The University of Southern Mississippi, Department of Marine Science (United States); Ngodock, Hans E., E-mail: hans.ngodock@nrlssc.navy.mil [Naval Research Laboratory (United States); Vidard, Arthur, E-mail: arthur.vidard@imag.fr; Le Dimet, François-Xavier, E-mail: ledimet@imag.fr [Laboratoire Jean Kuntzmann (France)

2016-10-15

This paper presents an alternative approach to the regularized least squares solution of ill-posed inverse problems. Instead of solving a minimization problem with an objective function composed of a data term and a regularization term, the regularization information is used to define a projection onto a convex subspace of regularized candidate solutions. The objective function is modified to include the projection of each iterate in the place of the regularization. Numerical experiments based on the problem of motion estimation for geophysical fluid images, show the improvement of the proposed method compared with regularization methods. For the presented test case, the incremental projection method uses 7 times less computation time than the regularization method, to reach the same error target. Moreover, at convergence, the incremental projection is two order of magnitude more accurate than the regularization method.

Geometric regularizations and dual conifold transitions

International Nuclear Information System (INIS)

Landsteiner, Karl; Lazaroiu, Calin I.

2003-01-01

We consider a geometric regularization for the class of conifold transitions relating D-brane systems on noncompact Calabi-Yau spaces to certain flux backgrounds. This regularization respects the SL(2,Z) invariance of the flux superpotential, and allows for computation of the relevant periods through the method of Picard-Fuchs equations. The regularized geometry is a noncompact Calabi-Yau which can be viewed as a monodromic fibration, with the nontrivial monodromy being induced by the regulator. It reduces to the original, non-monodromic background when the regulator is removed. Using this regularization, we discuss the simple case of the local conifold, and show how the relevant field-theoretic information can be extracted in this approach. (author)

TreeRipper web application: towards a fully automated optical tree recognition software

Directory of Open Access Journals (Sweden)

Hughes Joseph

2011-05-01

Full Text Available Abstract Background Relationships between species, genes and genomes have been printed as trees for over a century. Whilst this may have been the best format for exchanging and sharing phylogenetic hypotheses during the 20th century, the worldwide web now provides faster and automated ways of transferring and sharing phylogenetic knowledge. However, novel software is needed to defrost these published phylogenies for the 21st century. Results TreeRipper is a simple website for the fully-automated recognition of multifurcating phylogenetic trees (http://linnaeus.zoology.gla.ac.uk/~jhughes/treeripper/. The program accepts a range of input image formats (PNG, JPG/JPEG or GIF. The underlying command line c++ program follows a number of cleaning steps to detect lines, remove node labels, patch-up broken lines and corners and detect line edges. The edge contour is then determined to detect the branch length, tip label positions and the topology of the tree. Optical Character Recognition (OCR is used to convert the tip labels into text with the freely available tesseract-ocr software. 32% of images meeting the prerequisites for TreeRipper were successfully recognised, the largest tree had 115 leaves. Conclusions Despite the diversity of ways phylogenies have been illustrated making the design of a fully automated tree recognition software difficult, TreeRipper is a step towards automating the digitization of past phylogenies. We also provide a dataset of 100 tree images and associated tree files for training and/or benchmarking future software. TreeRipper is an open source project licensed under the GNU General Public Licence v3.

MixtureTree annotator: a program for automatic colorization and visual annotation of MixtureTree.

Directory of Open Access Journals (Sweden)

Shu-Chuan Chen

Full Text Available The MixtureTree Annotator, written in JAVA, allows the user to automatically color any phylogenetic tree in Newick format generated from any phylogeny reconstruction program and output the Nexus file. By providing the ability to automatically color the tree by sequence name, the MixtureTree Annotator provides a unique advantage over any other programs which perform a similar function. In addition, the MixtureTree Annotator is the only package that can efficiently annotate the output produced by MixtureTree with mutation information and coalescent time information. In order to visualize the resulting output file, a modified version of FigTree is used. Certain popular methods, which lack good built-in visualization tools, for example, MEGA, Mesquite, PHY-FI, TreeView, treeGraph and Geneious, may give results with human errors due to either manually adding colors to each node or with other limitations, for example only using color based on a number, such as branch length, or by taxonomy. In addition to allowing the user to automatically color any given Newick tree by sequence name, the MixtureTree Annotator is the only method that allows the user to automatically annotate the resulting tree created by the MixtureTree program. The MixtureTree Annotator is fast and easy-to-use, while still allowing the user full control over the coloring and annotating process.

On Determining if Tree-based Networks Contain Fixed Trees.

Science.gov (United States)

Anaya, Maria; Anipchenko-Ulaj, Olga; Ashfaq, Aisha; Chiu, Joyce; Kaiser, Mahedi; Ohsawa, Max Shoji; Owen, Megan; Pavlechko, Ella; St John, Katherine; Suleria, Shivam; Thompson, Keith; Yap, Corrine

2016-05-01

We address an open question of Francis and Steel about phylogenetic networks and trees. They give a polynomial time algorithm to decide if a phylogenetic network, N, is tree-based and pose the problem: given a fixed tree T and network N, is N based on T? We show that it is [Formula: see text]-hard to decide, by reduction from 3-Dimensional Matching (3DM) and further that the problem is fixed-parameter tractable.

Adaptive regularization

DEFF Research Database (Denmark)

Hansen, Lars Kai; Rasmussen, Carl Edward; Svarer, C.

1994-01-01

Regularization, e.g., in the form of weight decay, is important for training and optimization of neural network architectures. In this work the authors provide a tool based on asymptotic sampling theory, for iterative estimation of weight decay parameters. The basic idea is to do a gradient desce...

LANGUAGE POLICIES AND MULTILINGUAL EDUCATION IN MINORITY SCHOOLS IN OTTOMAN EMPIRE: OUTCOMES AND FUTURE INSIGHTS

Directory of Open Access Journals (Sweden)

Emrah DOLGUNSOZ

2014-05-01

Full Text Available Language is the spirit of nations; the cement of the culture mosaic. Its education has a critical role especially for multi-national societies and states. According to Human Rights, every individual has the right to develop, teach and learn his native language in any setting. But this democratic right is required to be regularized with a healthy, efficient and long term multilingual education policy. As one of the most powerful multi-ethnic empires of history, Ottoman Empire embraced numerous cultures and several unique languages. As a policy, the Empire followed a relatively flexible and irregular language policy which fostered national homogeneity and unity in time. On the other hand, the Empire always kept the gap between Anatolian Turkish language by employing Ottoman language as official language. The imbalanced policies of multilingual education and Porte’s distance to Anatolian Turkish contributed a lot to the disintegration of the Empire. This study focuses on why Ottoman language policies adversely affected the unity of the multilingual Empire, scrutinizes the insufficient multilingual education models among Muslim society with its outcomes and discusses how multilingual education in minority schools contributed the disintegration process.

Evaluation of properties over phylogenetic trees using stochastic logics.

Science.gov (United States)

Requeno, José Ignacio; Colom, José Manuel

2016-06-14

Model checking has been recently introduced as an integrated framework for extracting information of the phylogenetic trees using temporal logics as a querying language, an extension of modal logics that imposes restrictions of a boolean formula along a path of events. The phylogenetic tree is considered a transition system modeling the evolution as a sequence of genomic mutations (we understand mutation as different ways that DNA can be changed), while this kind of logics are suitable for traversing it in a strict and exhaustive way. Given a biological property that we desire to inspect over the phylogeny, the verifier returns true if the specification is satisfied or a counterexample that falsifies it. However, this approach has been only considered over qualitative aspects of the phylogeny. In this paper, we repair the limitations of the previous framework for including and handling quantitative information such as explicit time or probability. To this end, we apply current probabilistic continuous-time extensions of model checking to phylogenetics. We reinterpret a catalog of qualitative properties in a numerical way, and we also present new properties that couldn't be analyzed before. For instance, we obtain the likelihood of a tree topology according to a mutation model. As case of study, we analyze several phylogenies in order to obtain the maximum likelihood with the model checking tool PRISM. In addition, we have adapted the software for optimizing the computation of maximum likelihoods. We have shown that probabilistic model checking is a competitive framework for describing and analyzing quantitative properties over phylogenetic trees. This formalism adds soundness and readability to the definition of models and specifications. Besides, the existence of model checking tools hides the underlying technology, omitting the extension, upgrade, debugging and maintenance of a software tool to the biologists. A set of benchmarks justify the feasibility of our

Whole-tree distribution and temporal variation of non-structural carbohydrates in broadleaf evergreen trees.

Science.gov (United States)

Smith, Merryn G; Miller, Rebecca E; Arndt, Stefan K; Kasel, Sabine; Bennett, Lauren T

2018-04-01

Non-structural carbohydrates (NSCs) form a fundamental yet poorly quantified carbon pool in trees. Studies of NSC seasonality in forest trees have seldom measured whole-tree NSC stocks and allocation among organs, and are not representative of all tree functional types. Non-structural carbohydrate research has primarily focussed on broadleaf deciduous and coniferous evergreen trees with distinct growing seasons, while broadleaf evergreen trees remain under-studied despite their different growth phenology. We measured whole-tree NSC allocation and temporal variation in Eucalyptus obliqua L'Hér., a broadleaf evergreen tree species typically occurring in mixed-age temperate forests, which has year-round growth and the capacity to resprout after fire. Our overarching objective was to improve the empirical basis for understanding the functional importance of NSC allocation and stock changes at the tree- and organ-level in this tree functional type. Starch was the principal storage carbohydrate and was primarily stored in the stem and roots of young (14-year-old) trees rather than the lignotuber, which did not appear to be a specialized starch storage organ. Whole-tree NSC stocks were depleted during spring and summer due to significant decreases in starch mass in the roots and stem, seemingly to support root and crown growth but potentially exacerbated by water stress in summer. Seasonality of stem NSCs differed between young and mature trees, and was not synchronized with stem basal area increments in mature trees. Our results suggest that the relative magnitude of seasonal NSC stock changes could vary with tree growth stage, and that the main drivers of NSC fluctuations in broadleaf evergreen trees in temperate biomes could be periodic disturbances such as summer drought and fire, rather than growth phenology. These results have implications for understanding post-fire tree recovery via resprouting, and for incorporating NSC pools into carbon models of mixed

The effect of contaminated groundwater on tree growth: A tree-ring analysis

International Nuclear Information System (INIS)

LeBlanc, D.C.; Loehle, C.

1990-10-01

A study was conducted on the effect of contaminated groundwater seepage on tree growth downslope from F- and H-Area seepage basins of the Savannah River Site. Trees in wetlands along Four Mile Creek began to show localized stress and mortality in the late 1970s. Extreme winter temperatures and high rainfall were ruled out as potential causal factors of tree stress. Drought was shown to affect trees in both contaminated and uncontaminated zones, but trees in uncontaminated areas exhibit better recovery after drought than trees in contaminated areas. Pollution-mediated alteration of soil acidity and aluminum, sodium, and heavy metal concentrations likely acted to predispose trees to decline, with severe drought acting as the trigger for decline initiation and tree death. Thus, a moderate pollution loading, not sufficient to cause visible damage of itself, may create conditions in which sudden, severe decline could result from natural stresses. This mechanism of forest decline is common, and should be considered in evaluations of the impact of pollution on wetland forest systems. 28 refs., 4 figs., 6 tabs

SILVA tree viewer: interactive web browsing of the SILVA phylogenetic guide trees.

Science.gov (United States)

Beccati, Alan; Gerken, Jan; Quast, Christian; Yilmaz, Pelin; Glöckner, Frank Oliver

2017-09-30

Phylogenetic trees are an important tool to study the evolutionary relationships among organisms. The huge amount of available taxa poses difficulties in their interactive visualization. This hampers the interaction with the users to provide feedback for the further improvement of the taxonomic framework. The SILVA Tree Viewer is a web application designed for visualizing large phylogenetic trees without requiring the download of any software tool or data files. The SILVA Tree Viewer is based on Web Geographic Information Systems (Web-GIS) technology with a PostgreSQL backend. It enables zoom and pan functionalities similar to Google Maps. The SILVA Tree Viewer enables access to two phylogenetic (guide) trees provided by the SILVA database: the SSU Ref NR99 inferred from high-quality, full-length small subunit sequences, clustered at 99% sequence identity and the LSU Ref inferred from high-quality, full-length large subunit sequences. The Tree Viewer provides tree navigation, search and browse tools as well as an interactive feedback system to collect any kinds of requests ranging from taxonomy to data curation and improving the tool itself.

Regularizing portfolio optimization

International Nuclear Information System (INIS)

Still, Susanne; Kondor, Imre

2010-01-01

The optimization of large portfolios displays an inherent instability due to estimation error. This poses a fundamental problem, because solutions that are not stable under sample fluctuations may look optimal for a given sample, but are, in effect, very far from optimal with respect to the average risk. In this paper, we approach the problem from the point of view of statistical learning theory. The occurrence of the instability is intimately related to over-fitting, which can be avoided using known regularization methods. We show how regularized portfolio optimization with the expected shortfall as a risk measure is related to support vector regression. The budget constraint dictates a modification. We present the resulting optimization problem and discuss the solution. The L2 norm of the weight vector is used as a regularizer, which corresponds to a diversification 'pressure'. This means that diversification, besides counteracting downward fluctuations in some assets by upward fluctuations in others, is also crucial because it improves the stability of the solution. The approach we provide here allows for the simultaneous treatment of optimization and diversification in one framework that enables the investor to trade off between the two, depending on the size of the available dataset.

Regularizing portfolio optimization

Science.gov (United States)

Still, Susanne; Kondor, Imre

2010-07-01

The optimization of large portfolios displays an inherent instability due to estimation error. This poses a fundamental problem, because solutions that are not stable under sample fluctuations may look optimal for a given sample, but are, in effect, very far from optimal with respect to the average risk. In this paper, we approach the problem from the point of view of statistical learning theory. The occurrence of the instability is intimately related to over-fitting, which can be avoided using known regularization methods. We show how regularized portfolio optimization with the expected shortfall as a risk measure is related to support vector regression. The budget constraint dictates a modification. We present the resulting optimization problem and discuss the solution. The L2 norm of the weight vector is used as a regularizer, which corresponds to a diversification 'pressure'. This means that diversification, besides counteracting downward fluctuations in some assets by upward fluctuations in others, is also crucial because it improves the stability of the solution. The approach we provide here allows for the simultaneous treatment of optimization and diversification in one framework that enables the investor to trade off between the two, depending on the size of the available dataset.

Intercropping competition between apple trees and crops in agroforestry systems on the Loess Plateau of China.

Science.gov (United States)

Gao, Lubo; Xu, Huasen; Bi, Huaxing; Xi, Weimin; Bao, Biao; Wang, Xiaoyan; Bi, Chao; Chang, Yifang

2013-01-01

Agroforestry has been widely practiced in the Loess Plateau region of China because of its prominent effects in reducing soil and water losses, improving land-use efficiency and increasing economic returns. However, the agroforestry practices may lead to competition between crops and trees for underground soil moisture and nutrients, and the trees on the canopy layer may also lead to shortage of light for crops. In order to minimize interspecific competition and maximize the benefits of tree-based intercropping systems, we studied photosynthesis, growth and yield of soybean (Glycine max L. Merr.) and peanut (Arachis hypogaea L.) by measuring photosynthetically active radiation, net photosynthetic rate, soil moisture and soil nutrients in a plantation of apple (Malus pumila M.) at a spacing of 4 m × 5 m on the Loess Plateau of China. The results showed that for both intercropping systems in the study region, soil moisture was the primary factor affecting the crop yields followed by light. Deficiency of the soil nutrients also had a significant impact on crop yields. Compared with soybean, peanut was more suitable for intercropping with apple trees to obtain economic benefits in the region. We concluded that apple-soybean and apple-peanut intercropping systems can be practical and beneficial in the region. However, the distance between crops and tree rows should be adjusted to minimize interspecies competition. Agronomic measures such as regular canopy pruning, root barriers, additional irrigation and fertilization also should be applied in the intercropping systems.

Resummed tree heptagon

Science.gov (United States)

Belitsky, A. V.

2018-04-01

The form factor program for the regularized space-time S-matrix in planar maximally supersymmetric gauge theory, known as the pentagon operator product expansion, is formulated in terms of flux-tube excitations propagating on a dual two-dimensional world-sheet, whose dynamics is known exactly as a function of 't Hooft coupling. Both MHV and non-MHV amplitudes are described in a uniform, systematic fashion within this framework, with the difference between the two encoded in coupling-dependent helicity form factors expressed via Zhukowski variables. The nontrivial SU(4) tensor structure of flux-tube transitions is coupling independent and is known for any number of charged excitations from solutions of a system of Watson and Mirror equations. This description allows one to resum the infinite series of form factors and recover the space-time S-matrix exactly in kinematical variables at a given order of perturbation series. Recently, this was done for the hexagon. Presently, we successfully perform resummation for the seven-leg tree NMHV amplitude. To this end, we construct the flux-tube integrands of the fifteen independent Grassmann component of the heptagon with an infinite number of small fermion-antifermion pairs accounted for in NMHV two-channel conformal blocks.

Sequence comparison alignment-free approach based on suffix tree and L-words frequency.

Science.gov (United States)

Soares, Inês; Goios, Ana; Amorim, António

2012-01-01

The vast majority of methods available for sequence comparison rely on a first sequence alignment step, which requires a number of assumptions on evolutionary history and is sometimes very difficult or impossible to perform due to the abundance of gaps (insertions/deletions). In such cases, an alternative alignment-free method would prove valuable. Our method starts by a computation of a generalized suffix tree of all sequences, which is completed in linear time. Using this tree, the frequency of all possible words with a preset length L-L-words--in each sequence is rapidly calculated. Based on the L-words frequency profile of each sequence, a pairwise standard Euclidean distance is then computed producing a symmetric genetic distance matrix, which can be used to generate a neighbor joining dendrogram or a multidimensional scaling graph. We present an improvement to word counting alignment-free approaches for sequence comparison, by determining a single optimal word length and combining suffix tree structures to the word counting tasks. Our approach is, thus, a fast and simple application that proved to be efficient and powerful when applied to mitochondrial genomes. The algorithm was implemented in Python language and is freely available on the web.

Tessellating the Sphere with Regular Polygons

Science.gov (United States)

Soto-Johnson, Hortensia; Bechthold, Dawn

2004-01-01

Tessellations in the Euclidean plane and regular polygons that tessellate the sphere are reviewed. The regular polygons that can possibly tesellate the sphere are spherical triangles, squares and pentagons.

D2-tree

DEFF Research Database (Denmark)

Brodal, Gerth Stølting; Sioutas, Spyros; Pantazos, Kostas

2015-01-01

We present a new overlay, called the Deterministic Decentralized tree (D2-tree). The D2-tree compares favorably to other overlays for the following reasons: (a) it provides matching and better complexities, which are deterministic for the supported operations; (b) the management of nodes (peers...

Tree felling 2014

CERN Multimedia

2014-01-01

With a view to creating new landscapes and making its population of trees safer and healthier, this winter CERN will complete the tree-felling campaign started in 2010.   Tree felling will take place between 15 and 22 November on the Swiss part of the Meyrin site. This work is being carried out above all for safety reasons. The trees to be cut down are at risk of falling as they are too old and too tall to withstand the wind. In addition, the roots of poplar trees are very powerful and spread widely, potentially damaging underground networks, pavements and roadways. Compensatory tree planting campaigns will take place in the future, subject to the availability of funding, with the aim of creating coherent landscapes while also respecting the functional constraints of the site. These matters are being considered in close collaboration with the Geneva nature and countryside directorate (Direction générale de la nature et du paysage, DGNP). GS-SE Group

Learning foreign labels from a foreign speaker: the role of (limited) exposure to a second language.

Science.gov (United States)

Akhtar, Nameera; Menjivar, Jennifer; Hoicka, Elena; Sabbagh, Mark A

2012-11-01

Three- and four-year-olds (N = 144) were introduced to novel labels by an English speaker and a foreign speaker (of Nordish, a made-up language), and were asked to endorse one of the speaker's labels. Monolingual English-speaking children were compared to bilingual children and English-speaking children who were regularly exposed to a language other than English. All children tended to endorse the English speaker's labels when asked 'What do you call this?', but when asked 'What do you call this in Nordish?', children with exposure to a second language were more likely to endorse the foreign label than monolingual and bilingual children. The findings suggest that, at this age, exposure to, but not necessarily immersion in, more than one language may promote the ability to learn foreign words from a foreign speaker.

Phylogenetic trees

OpenAIRE

Baños, Hector; Bushek, Nathaniel; Davidson, Ruth; Gross, Elizabeth; Harris, Pamela E.; Krone, Robert; Long, Colby; Stewart, Allen; Walker, Robert

2016-01-01

We introduce the package PhylogeneticTrees for Macaulay2 which allows users to compute phylogenetic invariants for group-based tree models. We provide some background information on phylogenetic algebraic geometry and show how the package PhylogeneticTrees can be used to calculate a generating set for a phylogenetic ideal as well as a lower bound for its dimension. Finally, we show how methods within the package can be used to compute a generating set for the join of any two ideals.

The Use of Analogies in Language Teaching: Representing the Content of Teachers' Practical Knowledge

Science.gov (United States)

Hulshof, Hans; Verloop, Nico

2002-01-01

This study sought to determine how experienced language teachers use analogies to help students comprehend a text on the course of their regular teaching routines. It is assumed that analogies constitute one important component of the content of teachers' practical knowledge in the context of reading-comprehension instruction. The framework of the…

Accretion onto some well-known regular black holes

International Nuclear Information System (INIS)

Jawad, Abdul; Shahzad, M.U.

2016-01-01

In this work, we discuss the accretion onto static spherically symmetric regular black holes for specific choices of the equation of state parameter. The underlying regular black holes are charged regular black holes using the Fermi-Dirac distribution, logistic distribution, nonlinear electrodynamics, respectively, and Kehagias-Sftesos asymptotically flat regular black holes. We obtain the critical radius, critical speed, and squared sound speed during the accretion process near the regular black holes. We also study the behavior of radial velocity, energy density, and the rate of change of the mass for each of the regular black holes. (orig.)

Accretion onto some well-known regular black holes

Energy Technology Data Exchange (ETDEWEB)

Jawad, Abdul; Shahzad, M.U. [COMSATS Institute of Information Technology, Department of Mathematics, Lahore (Pakistan)

2016-03-15

In this work, we discuss the accretion onto static spherically symmetric regular black holes for specific choices of the equation of state parameter. The underlying regular black holes are charged regular black holes using the Fermi-Dirac distribution, logistic distribution, nonlinear electrodynamics, respectively, and Kehagias-Sftesos asymptotically flat regular black holes. We obtain the critical radius, critical speed, and squared sound speed during the accretion process near the regular black holes. We also study the behavior of radial velocity, energy density, and the rate of change of the mass for each of the regular black holes. (orig.)

Accretion onto some well-known regular black holes

Science.gov (United States)

Jawad, Abdul; Shahzad, M. Umair

2016-03-01

In this work, we discuss the accretion onto static spherically symmetric regular black holes for specific choices of the equation of state parameter. The underlying regular black holes are charged regular black holes using the Fermi-Dirac distribution, logistic distribution, nonlinear electrodynamics, respectively, and Kehagias-Sftesos asymptotically flat regular black holes. We obtain the critical radius, critical speed, and squared sound speed during the accretion process near the regular black holes. We also study the behavior of radial velocity, energy density, and the rate of change of the mass for each of the regular black holes.

Identifying the rooted species tree from the distribution of unrooted gene trees under the coalescent.

Science.gov (United States)

Allman, Elizabeth S; Degnan, James H; Rhodes, John A

2011-06-01

Gene trees are evolutionary trees representing the ancestry of genes sampled from multiple populations. Species trees represent populations of individuals-each with many genes-splitting into new populations or species. The coalescent process, which models ancestry of gene copies within populations, is often used to model the probability distribution of gene trees given a fixed species tree. This multispecies coalescent model provides a framework for phylogeneticists to infer species trees from gene trees using maximum likelihood or Bayesian approaches. Because the coalescent models a branching process over time, all trees are typically assumed to be rooted in this setting. Often, however, gene trees inferred by traditional phylogenetic methods are unrooted. We investigate probabilities of unrooted gene trees under the multispecies coalescent model. We show that when there are four species with one gene sampled per species, the distribution of unrooted gene tree topologies identifies the unrooted species tree topology and some, but not all, information in the species tree edges (branch lengths). The location of the root on the species tree is not identifiable in this situation. However, for 5 or more species with one gene sampled per species, we show that the distribution of unrooted gene tree topologies identifies the rooted species tree topology and all its internal branch lengths. The length of any pendant branch leading to a leaf of the species tree is also identifiable for any species from which more than one gene is sampled.

Diagrammatic methods in phase-space regularization

International Nuclear Information System (INIS)

Bern, Z.; Halpern, M.B.; California Univ., Berkeley

1987-11-01

Using the scalar prototype and gauge theory as the simplest possible examples, diagrammatic methods are developed for the recently proposed phase-space form of continuum regularization. A number of one-loop and all-order applications are given, including general diagrammatic discussions of the nogrowth theorem and the uniqueness of the phase-space stochastic calculus. The approach also generates an alternate derivation of the equivalence of the large-β phase-space regularization to the more conventional coordinate-space regularization. (orig.)

Metric regularity and subdifferential calculus

International Nuclear Information System (INIS)

Ioffe, A D

2000-01-01

The theory of metric regularity is an extension of two classical results: the Lyusternik tangent space theorem and the Graves surjection theorem. Developments in non-smooth analysis in the 1980s and 1990s paved the way for a number of far-reaching extensions of these results. It was also well understood that the phenomena behind the results are of metric origin, not connected with any linear structure. At the same time it became clear that some basic hypotheses of the subdifferential calculus are closely connected with the metric regularity of certain set-valued maps. The survey is devoted to the metric theory of metric regularity and its connection with subdifferential calculus in Banach spaces

Flowchart Programs, Regular Expressions, and Decidability of Polynomial Growth-Rate

Directory of Open Access Journals (Sweden)

Amir M. Ben-Amram

2016-07-01

Full Text Available We present a new method for inferring complexity properties for a class of programs in the form of flowcharts annotated with loop information. Specifically, our method can (soundly and completely decide if computed values are polynomially bounded as a function of the input; and similarly for the running time. Such complexity properties are undecidable for a Turing-complete programming language, and a common work-around in program analysis is to settle for sound but incomplete solutions. In contrast, we consider a class of programs that is Turing-incomplete, but strong enough to include several challenges for this kind of analysis. For a related language that has well-structured syntax, similar to Meyer and Ritchie's LOOP programs, the problem has been previously proved to be decidable. The analysis relied on the compositionality of programs, hence the challenge in obtaining similar results for flowchart programs with arbitrary control-flow graphs. Our answer to the challenge is twofold: first, we propose a class of loop-annotated flowcharts, which is more general than the class of flowcharts that directly represent structured programs; secondly, we present a technique to reuse the ideas from the work on tructured programs and apply them to such flowcharts. The technique is inspired by the classic translation of non-deterministic automata to regular expressions, but we obviate the exponential cost of constructing such an expression, obtaining a polynomial-time analysis. These ideas may well be applicable to other analysis problems.

Temporal regularity of the environment drives time perception

OpenAIRE

van Rijn, H; Rhodes, D; Di Luca, M

2016-01-01

It’s reasonable to assume that a regularly paced sequence should be perceived as regular, but here we show that perceived regularity depends on the context in which the sequence is embedded. We presented one group of participants with perceptually regularly paced sequences, and another group of participants with mostly irregularly paced sequences (75% irregular, 25% regular). The timing of the final stimulus in each sequence could be var- ied. In one experiment, we asked whether the last stim...

Covering tree with stars

DEFF Research Database (Denmark)

Baumbach, Jan; Guo, Jiong; Ibragimov, Rashid

2015-01-01

We study the tree edit distance problem with edge deletions and edge insertions as edit operations. We reformulate a special case of this problem as Covering Tree with Stars (CTS): given a tree T and a set of stars, can we connect the stars in by adding edges between them such that the resulting...... tree is isomorphic to T? We prove that in the general setting, CST is NP-complete, which implies that the tree edit distance considered here is also NP-hard, even when both input trees having diameters bounded by 10. We also show that, when the number of distinct stars is bounded by a constant k, CTS...

Growing trees in child brains: graph theoretical analysis of electroencephalography-derived minimum spanning tree in 5- and 7-year-old children reflects brain maturation.

Science.gov (United States)

Boersma, Maria; Smit, Dirk J A; Boomsma, Dorret I; De Geus, Eco J C; Delemarre-van de Waal, Henriette A; Stam, Cornelis J

2013-01-01

The child brain is a small-world network, which is hypothesized to change toward more ordered configurations with development. In graph theoretical studies, comparing network topologies under different conditions remains a critical point. Constructing a minimum spanning tree (MST) might present a solution, since it does not require setting a threshold and uses a fixed number of nodes and edges. In this study, the MST method is introduced to examine developmental changes in functional brain network topology in young children. Resting-state electroencephalography was recorded from 227 children twice at 5 and 7 years of age. Synchronization likelihood (SL) weighted matrices were calculated in three different frequency bands from which MSTs were constructed, which represent constructs of the most important routes for information flow in a network. From these trees, several parameters were calculated to characterize developmental change in network organization. The MST diameter and eccentricity significantly increased, while the leaf number and hierarchy significantly decreased in the alpha band with development. Boys showed significant higher leaf number, betweenness, degree and hierarchy and significant lower SL, diameter, and eccentricity than girls in the theta band. The developmental changes indicate a shift toward more decentralized line-like trees, which supports the previously hypothesized increase toward regularity of brain networks with development. Additionally, girls showed more line-like decentralized configurations, which is consistent with the view that girls are ahead of boys in brain development. MST provides an elegant method sensitive to capture subtle developmental changes in network organization without the bias of network comparison.

Does Lateral Transmission Obscure Inheritance in Hunter-Gatherer Languages?

Science.gov (United States)

Bowern, Claire; Epps, Patience; Gray, Russell; Hill, Jane; Hunley, Keith; McConvell, Patrick; Zentz, Jason

2011-01-01

In recent years, linguists have begun to increasingly rely on quantitative phylogenetic approaches to examine language evolution. Some linguists have questioned the suitability of phylogenetic approaches on the grounds that linguistic evolution is largely reticulate due to extensive lateral transmission, or borrowing, among languages. The problem may be particularly pronounced in hunter-gatherer languages, where the conventional wisdom among many linguists is that lexical borrowing rates are so high that tree building approaches cannot provide meaningful insights into evolutionary processes. However, this claim has never been systematically evaluated, in large part because suitable data were unavailable. In addition, little is known about the subsistence, demographic, ecological, and social factors that might mediate variation in rates of borrowing among languages. Here, we evaluate these claims with a large sample of hunter-gatherer languages from three regions around the world. In this study, a list of 204 basic vocabulary items was collected for 122 hunter-gatherer and small-scale cultivator languages from three ecologically diverse case study areas: northern Australia, northwest Amazonia, and California and the Great Basin. Words were rigorously coded for etymological (inheritance) status, and loan rates were calculated. Loan rate variability was examined with respect to language area, subsistence mode, and population size, density, and mobility; these results were then compared to the sample of 41 primarily agriculturalist languages in [1]. Though loan levels varied both within and among regions, they were generally low in all regions (mean 5.06%, median 2.49%, and SD 7.56), despite substantial demographic, ecological, and social variation. Amazonian levels were uniformly very low, with no language exhibiting more than 4%. Rates were low but more variable in the other two study regions, in part because of several outlier languages where rates of borrowing were

Trees in the city: valuing street trees in Portland, Oregon

Science.gov (United States)

G.H. Donovan; D.T. Butry

2010-01-01

We use a hedonic price model to simultaneously estimate the effects of street trees on the sales price and the time-on-market (TOM) of houses in Portland. Oregon. On average, street trees add $8,870 to sales price and reduce TOM by 1.7 days. In addition, we found that the benefits of street trees spill over to neighboring houses. Because the provision and maintenance...

Urban tree growth modeling

Science.gov (United States)

E. Gregory McPherson; Paula J. Peper

2012-01-01

This paper describes three long-term tree growth studies conducted to evaluate tree performance because repeated measurements of the same trees produce critical data for growth model calibration and validation. Several empirical and process-based approaches to modeling tree growth are reviewed. Modeling is more advanced in the fields of forestry and...

Electron Tree

DEFF Research Database (Denmark)

Appelt, Ane L; Rønde, Heidi S

2013-01-01

The photo shows a close-up of a Lichtenberg figure – popularly called an “electron tree” – produced in a cylinder of polymethyl methacrylate (PMMA). Electron trees are created by irradiating a suitable insulating material, in this case PMMA, with an intense high energy electron beam. Upon discharge......, during dielectric breakdown in the material, the electrons generate branching chains of fractures on leaving the PMMA, producing the tree pattern seen. To be able to create electron trees with a clinical linear accelerator, one needs to access the primary electron beam used for photon treatments. We...... appropriated a linac that was being decommissioned in our department and dismantled the head to circumvent the target and ion chambers. This is one of 24 electron trees produced before we had to stop the fun and allow the rest of the accelerator to be disassembled....

Classification and regression trees

CERN Document Server

Breiman, Leo; Olshen, Richard A; Stone, Charles J

1984-01-01

The methodology used to construct tree structured rules is the focus of this monograph. Unlike many other statistical procedures, which moved from pencil and paper to calculators, this text's use of trees was unthinkable before computers. Both the practical and theoretical sides have been developed in the authors' study of tree methods. Classification and Regression Trees reflects these two sides, covering the use of trees as a data analysis method, and in a more mathematical framework, proving some of their fundamental properties.

The uniqueness of the regularization procedure

International Nuclear Information System (INIS)

Brzezowski, S.

1981-01-01

On the grounds of the BPHZ procedure, the criteria of correct regularization in perturbation calculations of QFT are given, together with the prescription for dividing the regularized formulas into the finite and infinite parts. (author)

Coupling regularizes individual units in noisy populations

International Nuclear Information System (INIS)

Ly Cheng; Ermentrout, G. Bard

2010-01-01

The regularity of a noisy system can modulate in various ways. It is well known that coupling in a population can lower the variability of the entire network; the collective activity is more regular. Here, we show that diffusive (reciprocal) coupling of two simple Ornstein-Uhlenbeck (O-U) processes can regularize the individual, even when it is coupled to a noisier process. In cellular networks, the regularity of individual cells is important when a select few play a significant role. The regularizing effect of coupling surprisingly applies also to general nonlinear noisy oscillators. However, unlike with the O-U process, coupling-induced regularity is robust to different kinds of coupling. With two coupled noisy oscillators, we derive an asymptotic formula assuming weak noise and coupling for the variance of the period (i.e., spike times) that accurately captures this effect. Moreover, we find that reciprocal coupling can regularize the individual period of higher dimensional oscillators such as the Morris-Lecar and Brusselator models, even when coupled to noisier oscillators. Coupling can have a counterintuitive and beneficial effect on noisy systems. These results have implications for the role of connectivity with noisy oscillators and the modulation of variability of individual oscillators.

Learning regularization parameters for general-form Tikhonov

International Nuclear Information System (INIS)

Chung, Julianne; Español, Malena I

2017-01-01

Computing regularization parameters for general-form Tikhonov regularization can be an expensive and difficult task, especially if multiple parameters or many solutions need to be computed in real time. In this work, we assume training data is available and describe an efficient learning approach for computing regularization parameters that can be used for a large set of problems. We consider an empirical Bayes risk minimization framework for finding regularization parameters that minimize average errors for the training data. We first extend methods from Chung et al (2011 SIAM J. Sci. Comput. 33 3132–52) to the general-form Tikhonov problem. Then we develop a learning approach for multi-parameter Tikhonov problems, for the case where all involved matrices are simultaneously diagonalizable. For problems where this is not the case, we describe an approach to compute near-optimal regularization parameters by using operator approximations for the original problem. Finally, we propose a new class of regularizing filters, where solutions correspond to multi-parameter Tikhonov solutions, that requires less data than previously proposed optimal error filters, avoids the generalized SVD, and allows flexibility and novelty in the choice of regularization matrices. Numerical results for 1D and 2D examples using different norms on the errors show the effectiveness of our methods. (paper)

Benefit-based tree valuation

Science.gov (United States)

E.G. McPherson

2007-01-01

Benefit-based tree valuation provides alternative estimates of the fair and reasonable value of trees while illustrating the relative contribution of different benefit types. This study compared estimates of tree value obtained using cost- and benefit-based approaches. The cost-based approach used the Council of Landscape and Tree Appraisers trunk formula method, and...

5 CFR 551.421 - Regular working hours.

Science.gov (United States)

2010-01-01

... 5 Administrative Personnel 1 2010-01-01 2010-01-01 false Regular working hours. 551.421 Section... Activities § 551.421 Regular working hours. (a) Under the Act there is no requirement that a Federal employee... distinction based on whether the activity is performed by an employee during regular working hours or outside...

Regular extensions of some classes of grammars

NARCIS (Netherlands)

Nijholt, Antinus

Culik and Cohen introduced the class of LR-regular grammars, an extension of the LR(k) grammars. In this report we consider the analogous extension of the LL(k) grammers, called the LL-regular grammars. The relations of this class of grammars to other classes of grammars are shown. Every LL-regular

Fragmentation of random trees

International Nuclear Information System (INIS)

Kalay, Z; Ben-Naim, E

2015-01-01

We study fragmentation of a random recursive tree into a forest by repeated removal of nodes. The initial tree consists of N nodes and it is generated by sequential addition of nodes with each new node attaching to a randomly-selected existing node. As nodes are removed from the tree, one at a time, the tree dissolves into an ensemble of separate trees, namely, a forest. We study statistical properties of trees and nodes in this heterogeneous forest, and find that the fraction of remaining nodes m characterizes the system in the limit N→∞. We obtain analytically the size density ϕ s of trees of size s. The size density has power-law tail ϕ s ∼s −α with exponent α=1+(1/m). Therefore, the tail becomes steeper as further nodes are removed, and the fragmentation process is unusual in that exponent α increases continuously with time. We also extend our analysis to the case where nodes are added as well as removed, and obtain the asymptotic size density for growing trees. (paper)

MODERN METHODOLOGICAL TOOLS FOR STUDENTS’ LANGUAGE SKILLS SELF-ASSESSMENT

Directory of Open Access Journals (Sweden)

A. N. Astanina

2017-01-01

Full Text Available Introduction. Nowadays, the problem of standardization of foreign language training at the higher school is becoming currently topical. With regard to the processes of globalization, the international educational projects and students exchange programs gain greater international recognition. Such international programmes involve foreign language knowledge graded as not only high certified academic levels but also as basic language skills. The lack of foreign language competence becomes the obstacle for successful training, depriving a future graduate of a part of chances to become the competitive and popular expert in the chosen profession. The success of a foreign language course completion among students depends on many factors; the most important factor is motivation which can affect self-assessment of training results. The aim of the study is to describe possibilities of the CanDos tools implementation for the organization of students self-consciousness and self-assessment of own achievements in order to influence the motivation for mastering a foreign language.Methodology and research methods. The research is based on competencybased approach. The methods involve comparative analysis, synthesis, and generalization.Results and scientific novelty. The questionnaire developed for the experiment helped to collect the data concerning the effectiveness of the CanDos software implementation for self-assessment of students’ foreign language skills. The corresponding self-assessment helps students to carry out a self-reflection of own knowledge and abilities, and to find “weak points” in language proficiency which need additional practice and improvement. By regularly using CanDos software as self-assessment tools, students learn to identify the correspondence of their language competence to the external requirements and standards of education. Orientation to training results will help future experts to create self-motivation that positively

Regular non-twisting S-branes

International Nuclear Information System (INIS)

Obregon, Octavio; Quevedo, Hernando; Ryan, Michael P.

2004-01-01

We construct a family of time and angular dependent, regular S-brane solutions which corresponds to a simple analytical continuation of the Zipoy-Voorhees 4-dimensional vacuum spacetime. The solutions are asymptotically flat and turn out to be free of singularities without requiring a twist in space. They can be considered as the simplest non-singular generalization of the singular S0-brane solution. We analyze the properties of a representative of this family of solutions and show that it resembles to some extent the asymptotic properties of the regular Kerr S-brane. The R-symmetry corresponds, however, to the general lorentzian symmetry. Several generalizations of this regular solution are derived which include a charged S-brane and an additional dilatonic field. (author)

Peripheral Exophytic Oral Lesions: A Clinical Decision Tree

Directory of Open Access Journals (Sweden)

Hamed Mortazavi

2017-01-01

Full Text Available Diagnosis of peripheral oral exophytic lesions might be quite challenging. This review article aimed to introduce a decision tree for oral exophytic lesions according to their clinical features. General search engines and specialized databases including PubMed, PubMed Central, Medline Plus, EBSCO, Science Direct, Scopus, Embase, and authenticated textbooks were used to find relevant topics by means of keywords such as “oral soft tissue lesion,” “oral tumor like lesion,” “oral mucosal enlargement,” and “oral exophytic lesion.” Related English-language articles published since 1988 to 2016 in both medical and dental journals were appraised. Upon compilation of data, peripheral oral exophytic lesions were categorized into two major groups according to their surface texture: smooth (mesenchymal or nonsquamous epithelium-originated and rough (squamous epithelium-originated. Lesions with smooth surface were also categorized into three subgroups according to their general frequency: reactive hyperplastic lesions/inflammatory hyperplasia, salivary gland lesions (nonneoplastic and neoplastic, and mesenchymal lesions (benign and malignant neoplasms. In addition, lesions with rough surface were summarized in six more common lesions. In total, 29 entities were organized in the form of a decision tree in order to help clinicians establish a logical diagnosis by a stepwise progression method.

Influence of trap location on the efficiency of trapping in dendrimers and regular hyperbranched polymers.

Science.gov (United States)

Lin, Yuan; Zhang, Zhongzhi

2013-03-07

The trapping process in polymer systems constitutes a fundamental mechanism for various other dynamical processes taking place in these systems. In this paper, we study the trapping problem in two representative polymer networks, Cayley trees and Vicsek fractals, which separately model dendrimers and regular hyperbranched polymers. Our goal is to explore the impact of trap location on the efficiency of trapping in these two important polymer systems, with the efficiency being measured by the average trapping time (ATT) that is the average of source-to-trap mean first-passage time over every staring point in the whole networks. For Cayley trees, we derive an exact analytic formula for the ATT to an arbitrary trap node, based on which we further obtain the explicit expression of ATT for the case that the trap is uniformly distributed. For Vicsek fractals, we provide the closed-form solution for ATT to a peripheral node farthest from the central node, as well as the numerical solutions for the case when the trap is placed on other nodes. Moreover, we derive the exact formula for the ATT corresponding to the trapping problem when the trap has a uniform distribution over all nodes. Our results show that the influence of trap location on the trapping efficiency is completely different for the two polymer networks. In Cayley trees, the leading scaling of ATT increases with the shortest distance between the trap and the central node, implying that trap's position has an essential impact on the trapping efficiency; while in Vicsek fractals, the effect of location of the trap is negligible, since the dominant behavior of ATT is identical, respective of the location where the trap is placed. We also present that for all cases of trapping problems being studied, the trapping process is more efficient in Cayley trees than in Vicsek fractals. We demonstrate that all differences related to trapping in the two polymer systems are rooted in their underlying topological structures.

FTAP, Minimal Cut Sets of Arbitrary Fault Trees. FRTPLT, Fault Tree Structure and Logical Gates Plot for Program FTAP. FRTGEN, Fault Trees by Sub-tree Generator from Parent Tree for Program FTAP

International Nuclear Information System (INIS)

Willie, Randall R.; Rabien, U.

1997-01-01

1 - Description of problem or function: FTAP is a general-purpose program for deriving minimal reliability cut and path set families from the fault tree for a complex system. The program has a number of useful features that make it well-suited to nearly all fault tree applications. An input fault tree may specify the system state as any logical function of subsystem or component state variables or complements of these variables; thus, for instance, 'exclusive-or' type relations may be formed. When fault tree logical relations involve complements of state variables, the analyst may instruct FTAP to produce a family of prime implicants, a generalization of the minimal cut set concept. The program offers the flexibility of several distinct methods of generating cut set families. FTAP can also identify certain subsystems as system modules and provide a collection of minimal cut set families that essentially expresses the system state as a function of these module state variables. Another feature allows a useful subfamily to be obtained when the family of minimal cut sets or prime implicants is too large to be found in its entirety; this subfamily may consist of only those sets not containing more than some fixed number of elements or only those sets 'interesting' to the analyst in some special sense. Finally, the analyst can modify the input fault tree in various ways by declaring state variables identically true or false. 2 - Method of solution: Fault tree methods are based on the observation that the system state, either working or failed, can usually be expressed as a Boolean relation between states of several large, readily identifiable subsystems. The state of each subsystem in turn depends on states of simpler subsystems and components which compose it, so that the state of the system itself is determined by a hierarchy of logical relationships between states of subsystems. A fault tree is a graphical representation of these relationships. 3 - Restrictions on the

Winter Birch Trees

Science.gov (United States)

Sweeney, Debra; Rounds, Judy

2011-01-01

Trees are great inspiration for artists. Many art teachers find themselves inspired and maybe somewhat obsessed with the natural beauty and elegance of the lofty tree, and how it changes through the seasons. One such tree that grows in several regions and always looks magnificent, regardless of the time of year, is the birch. In this article, the…

Fast N-Gram Language Model Look-Ahead for Decoders With Static Pronunciation Prefix Trees

NARCIS (Netherlands)

Huijbregts, M.A.H.; Ordelman, Roeland J.F.; de Jong, Franciska M.G.

2008-01-01

Decoders that make use of token-passing restrict their search space by various types of token pruning. With use of the Language Model Look-Ahead (LMLA) technique it is possible to increase the number of tokens that can be pruned without loss of decoding precision. Unfortunately, for token passing

36 CFR 223.4 - Exchange of trees or portions of trees.

Science.gov (United States)

2010-07-01

... 36 Parks, Forests, and Public Property 2 2010-07-01 2010-07-01 false Exchange of trees or portions of trees. 223.4 Section 223.4 Parks, Forests, and Public Property FOREST SERVICE, DEPARTMENT OF AGRICULTURE SALE AND DISPOSAL OF NATIONAL FOREST SYSTEM TIMBER General Provisions § 223.4 Exchange of trees or...

How many trees are enough? Tree death and the urban canopy

Science.gov (United States)

Lara A. Roman

2014-01-01

Massive city tree planting campaigns have invigorated the urban forestry movement, and engaged politicians, planners, and the public in urban greening. Million tree initiatives have been launched in Los Angeles, CA; Denver, CO; New York City, NY; Philadelphia, PA, and other cities. Sacramento, CA even has a five million tree program. These...

Near-Regular Structure Discovery Using Linear Programming

KAUST Repository

Huang, Qixing

2014-06-02

Near-regular structures are common in manmade and natural objects. Algorithmic detection of such regularity greatly facilitates our understanding of shape structures, leads to compact encoding of input geometries, and enables efficient generation and manipulation of complex patterns on both acquired and synthesized objects. Such regularity manifests itself both in the repetition of certain geometric elements, as well as in the structured arrangement of the elements. We cast the regularity detection problem as an optimization and efficiently solve it using linear programming techniques. Our optimization has a discrete aspect, that is, the connectivity relationships among the elements, as well as a continuous aspect, namely the locations of the elements of interest. Both these aspects are captured by our near-regular structure extraction framework, which alternates between discrete and continuous optimizations. We demonstrate the effectiveness of our framework on a variety of problems including near-regular structure extraction, structure-preserving pattern manipulation, and markerless correspondence detection. Robustness results with respect to geometric and topological noise are presented on synthesized, real-world, and also benchmark datasets. © 2014 ACM.

Visualization of Uncertain Contour Trees

DEFF Research Database (Denmark)

Kraus, Martin

2010-01-01

Contour trees can represent the topology of large volume data sets in a relatively compact, discrete data structure. However, the resulting trees often contain many thousands of nodes; thus, many graph drawing techniques fail to produce satisfactory results. Therefore, several visualization methods...... were proposed recently for the visualization of contour trees. Unfortunately, none of these techniques is able to handle uncertain contour trees although any uncertainty of the volume data inevitably results in partially uncertain contour trees. In this work, we visualize uncertain contour trees...... by combining the contour trees of two morphologically filtered versions of a volume data set, which represent the range of uncertainty. These two contour trees are combined and visualized within a single image such that a range of potential contour trees is represented by the resulting visualization. Thus...

Tetravalent one-regular graphs of order 4p2

DEFF Research Database (Denmark)

Feng, Yan-Quan; Kutnar, Klavdija; Marusic, Dragan

2014-01-01

A graph is one-regular if its automorphism group acts regularly on the set of its arcs. In this paper tetravalent one-regular graphs of order 4p2, where p is a prime, are classified.......A graph is one-regular if its automorphism group acts regularly on the set of its arcs. In this paper tetravalent one-regular graphs of order 4p2, where p is a prime, are classified....