WorldWideScience

Sample records for random recursive trees

  1. Random recursive trees and the elephant random walk

    Science.gov (United States)

    Kürsten, Rüdiger

    2016-03-01

    One class of random walks with infinite memory, so-called elephant random walks, are simple models describing anomalous diffusion. We present a surprising connection between these models and bond percolation on random recursive trees. We use a coupling between the two models to translate results from elephant random walks to the percolation process. We calculate, besides other quantities, exact expressions for the first and the second moment of the root cluster size and of the number of nodes in child clusters of the first generation. We further introduce another model, the skew elephant random walk, and calculate the first and second moment of this process.

  2. A recursive algorithm for trees and forests

    OpenAIRE

    Guo, Song; Guo, Victor J. W.

    2017-01-01

    Trees or rooted trees have been generously studied in the literature. A forest is a set of trees or rooted trees. Here we give recurrence relations between the number of some kind of rooted forest with $k$ roots and that with $k+1$ roots on $\\{1,2,\\ldots,n\\}$. Classical formulas for counting various trees such as rooted trees, bipartite trees, tripartite trees, plane trees, $k$-ary plane trees, $k$-edge colored trees follow immediately from our recursive relations.

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

  4. On Fusing Recursive Traversals of K-d Trees

    Energy Technology Data Exchange (ETDEWEB)

    Rajbhandari, Samyam; Kim, Jinsung; Krishnamoorthy, Sriram; Pouchet, Louis-Noel; Rastello, Fabrice; Harrison, Robert J.; Sadayappan, Ponnuswamy

    2016-03-17

    Loop fusion is a key program transformation for data locality optimization that is implemented in production compilers. But optimizing compilers currently cannot exploit fusion opportunities across a set of recursive tree traversal computations with producer-consumer relationships. In this paper, we develop a compile-time approach to dependence characterization and program transformation to enable fusion across recursively specified traversals over k-ary trees. We present the FuseT source-to-source code transformation framework to automatically generate fused composite recursive operators from an input program containing a sequence of primitive recursive operators. We use our framework to implement fused operators for MADNESS, Multiresolution Adaptive Numerical Environment for Scientific Simulation. We show that locality optimization through fusion can offer more than an order of magnitude performance improvement.

  5. On the Hosoya index of a family of deterministic recursive trees

    Science.gov (United States)

    Chen, Xufeng; Zhang, Jingyuan; Sun, Weigang

    2017-01-01

    In this paper, we calculate the Hosoya index in a family of deterministic recursive trees with a special feature that includes new nodes which are connected to existing nodes with a certain rule. We then obtain a recursive solution of the Hosoya index based on the operations of a determinant. The computational complexity of our proposed algorithm is O(log2 n) with n being the network size, which is lower than that of the existing numerical methods. Finally, we give a weighted tree shrinking method as a graphical interpretation of the recurrence formula for the Hosoya index.

  6. Random Walks and Trees

    Directory of Open Access Journals (Sweden)

    Shi Zhan

    2011-03-01

    Full Text Available These notes provide an elementary and self-contained introduction to branching random walks. Section 1 gives a brief overview of Galton–Watson trees, whereas Section 2 presents the classical law of large numbers for branching random walks. These two short sections are not exactly indispensable, but they introduce the idea of using size-biased trees, thus giving motivations and an avant-goût to the main part, Section 3, where branching random walks are studied from a deeper point of view, and are connected to the model of directed polymers on a tree. Tree-related random processes form a rich and exciting research subject. These notes cover only special topics. For a general account, we refer to the St-Flour lecture notes of Peres [47] and to the forthcoming book of Lyons and Peres [42], as well as to Duquesne and Le Gall [23] and Le Gall [37] for continuous random trees.

  7. Laplacian spectrum of a family of recursive trees and its applications in network coherence

    Science.gov (United States)

    Sun, Weigang; Xuan, Tengfei; Qin, Sen

    2016-06-01

    Many of the topological and dynamical properties of a network are related to its Laplacian spectrum; these properties include network diameter, Kirchhoff index, and mean first-passage time. This paper investigates consensus dynamics in a linear dynamical system with additive stochastic disturbances, which is characterized as network coherence by the Laplacian spectrum. We choose a family of uniform recursive trees as our model, and propose a method to calculate the first- and second-order network coherence. Using the tree structures, we identify a relationship between the Laplacian matrix and Laplacian eigenvalues. We then derive the exact solutions for the reciprocals and square reciprocals of all nonzero Laplacian eigenvalues. We also obtain the scalings of network coherence with network size. The scalings of network coherence of the studied trees are smaller than those of Vicsek fractals and are not related to its fractal dimension.

  8. Random Projection Trees Revisited

    OpenAIRE

    Dhesi, Aman; Kar, Purushottam

    2010-01-01

    The Random Projection Tree structures proposed in [Freund-Dasgupta STOC08] are space partitioning data structures that automatically adapt to various notions of intrinsic dimensionality of data. We prove new results for both the RPTreeMax and the RPTreeMean data structures. Our result for RPTreeMax gives a near-optimal bound on the number of levels required by this data structure to reduce the size of its cells by a factor $s \\geq 2$. We also prove a packing lemma for this data structure. Our...

  9. A small-world network derived from the deterministic uniform recursive tree by line graph operation

    Science.gov (United States)

    Hou, Pengfeng; Zhao, Haixing; Mao, Yaping; Wang, Zhao

    2016-03-01

    The deterministic uniform recursive tree ({DURT}) is one of the deterministic versions of the uniform recursive tree ({URT}). Zhang et al (2008 Eur. Phys. J. B 63 507-13) studied the properties of DURT, including its topological characteristics and spectral properties. Although DURT shows a logarithmic scaling with the size of the network, DURT is not a small-world network since its clustering coefficient is zero. Lu et al (2012 Physica A 391 87-92) proposed a deterministic small-world network by adding some edges with a simple rule in each DURT iteration. In this paper, we intoduce a method for constructing a new deterministic small-world network by the line graph operation in each DURT iteration. The line graph operation brings about cliques at each node of the previous given graph, and the resulting line graph possesses larger clustering coefficients. On the other hand, this operation can decrease the diameter at almost one, then giving the analytic solutions to several topological characteristics of the model proposed. Supported by The Ministry of Science and Technology 973 project (No. 2010C B334708); National Science Foundation of China (Nos. 61164005, 11161037, 11101232, 11461054, 11551001); The Ministry of education scholars and innovation team support plan of Yangtze River (No. IRT1068); Qinghai Province Nature Science Foundation Project (Nos. 2012-Z-943, 2014-ZJ-907).

  10. Large Deviations for Random Trees.

    Science.gov (United States)

    Bakhtin, Yuri; Heitsch, Christine

    2008-08-01

    We consider large random trees under Gibbs distributions and prove a Large Deviation Principle (LDP) for the distribution of degrees of vertices of the tree. The LDP rate function is given explicitly. An immediate consequence is a Law of Large Numbers for the distribution of vertex degrees in a large random tree. Our motivation for this study comes from the analysis of RNA secondary structures.

  11. Human action analysis with randomized trees

    CERN Document Server

    Yu, Gang; Liu, Zicheng

    2014-01-01

    This book will provide a comprehensive overview on human action analysis with randomized trees. It will cover both the supervised random trees and the unsupervised random trees. When there are sufficient amount of labeled data available, supervised random trees provides a fast method for space-time interest point matching. When labeled data is minimal as in the case of example-based action search, unsupervised random trees is used to leverage the unlabelled data. We describe how the randomized trees can be used for action classification, action detection, action search, and action prediction.

  12. Recursive Random Lasso (RRLasso for Identifying Anti-Cancer Drug Targets.

    Directory of Open Access Journals (Sweden)

    Heewon Park

    Full Text Available Uncovering driver genes is crucial for understanding heterogeneity in cancer. L1-type regularization approaches have been widely used for uncovering cancer driver genes based on genome-scale data. Although the existing methods have been widely applied in the field of bioinformatics, they possess several drawbacks: subset size limitations, erroneous estimation results, multicollinearity, and heavy time consumption. We introduce a novel statistical strategy, called a Recursive Random Lasso (RRLasso, for high dimensional genomic data analysis and investigation of driver genes. For time-effective analysis, we consider a recursive bootstrap procedure in line with the random lasso. Furthermore, we introduce a parametric statistical test for driver gene selection based on bootstrap regression modeling results. The proposed RRLasso is not only rapid but performs well for high dimensional genomic data analysis. Monte Carlo simulations and analysis of the "Sanger Genomics of Drug Sensitivity in Cancer dataset from the Cancer Genome Project" show that the proposed RRLasso is an effective tool for high dimensional genomic data analysis. The proposed methods provide reliable and biologically relevant results for cancer driver gene selection.

  13. Aspects of insertion in random trees

    NARCIS (Netherlands)

    Bagchi, Arunabha; Reingold, E.M.

    1982-01-01

    A method formulated by Yao and used by Brown has yielded bounds on the fraction of nodes with specified properties in trees bult by a sequence of random internal nodes in a random tree built by binary search and insertion, and show that in such a tree about bounds better than those now known. We

  14. RecRWR: A Recursive Random Walk Method for Improved Identification of Diseases

    Directory of Open Access Journals (Sweden)

    Joel Perdiz Arrais

    2015-01-01

    Full Text Available High-throughput methods such as next-generation sequencing or DNA microarrays lack precision, as they return hundreds of genes for a single disease profile. Several computational methods applied to physical interaction of protein networks have been successfully used in identification of the best disease candidates for each expression profile. An open problem for these methods is the ability to combine and take advantage of the wealth of biomedical data publicly available. We propose an enhanced method to improve selection of the best disease targets for a multilayer biomedical network that integrates PPI data annotated with stable knowledge from OMIM diseases and GO biological processes. We present a comprehensive validation that demonstrates the advantage of the proposed approach, Recursive Random Walk with Restarts (RecRWR. The obtained results outline the superiority of the proposed approach, RecRWR, in identifying disease candidates, especially with high levels of biological noise and benefiting from all data available.

  15. Recursive analysis

    CERN Document Server

    Goodstein, R L

    2010-01-01

    Recursive analysis develops natural number computations into a framework appropriate for real numbers. This text is based upon primary recursive arithmetic and presents a unique combination of classical analysis and intuitional analysis. Written by a master in the field, it is suitable for graduate students of mathematics and computer science and can be read without a detailed knowledge of recursive arithmetic.Introductory chapters on recursive convergence and recursive and relative continuity are succeeded by explorations of recursive and relative differentiability, the relative integral, and

  16. Speech Recognition Using Randomized Relational Decision Trees

    National Research Council Canada - National Science Library

    Amit, Yali

    1999-01-01

    .... This implies that we recognize words as units, without recognizing their subcomponents. Multiple randomized decision trees are used to access the large pool of acoustic events in a systematic manner and are aggregated to produce the classifier.

  17. Clinical elements that predict outcome after traumatic brain injury: a prospective multicenter recursive partitioning (decision-tree) analysis.

    Science.gov (United States)

    Brown, Allen W; Malec, James F; McClelland, Robyn L; Diehl, Nancy N; Englander, Jeffrey; Cifu, David X

    2005-10-01

    Traumatic brain injury (TBI) often presents clinicians with a complex combination of clinical elements that can confound treatment and make outcome prediction challenging. Predictive models have commonly used acute physiological variables and gross clinical measures to predict mortality and basic outcome endpoints. The primary goal of this study was to consider all clinical elements available concerning a survivor of TBI admitted for inpatient rehabilitation, and identify those factors that predict disability, need for supervision, and productive activity one year after injury. The Traumatic Brain Injury Model Systems (TBIMS) database was used for decision tree analysis using recursive partitioning (n = 3463). Outcome measures included the Functional Independence Measure(), the Disability Rating Scale, the Supervision Rating Scale, and a measure of productive activity. Predictor variables included all physical examination elements, measures of injury severity (initial Glasgow Coma Scale score, duration of post-traumatic amnesia [PTA], length of coma, CT scan pathology), gender, age, and years of education. The duration of PTA, age, and most elements of the physical examination were predictive of early disability. The duration of PTA alone was selected to predict late disability and independent living. The duration of PTA, age, sitting balance, and limb strength were selected to predict productive activity at 1 year. The duration of PTA was the best predictor of outcome selected in this model for all endpoints and elements of the physical examination provided additional predictive value. Valid and reliable measures of PTA and physical impairment after TBI are important for accurate outcome prediction.

  18. OPTIMAL LINEAR COMBINED FILTERING OF RANDOM SEQUENCES BASED ON THE RECURSIVE LEAST SQUARES METHOD

    Directory of Open Access Journals (Sweden)

    V. M. Artemiev

    2015-01-01

    Full Text Available The problem of the synthesis of linear combined filter for the criterion of minimizing current losses on the basis of the recursive least squares method is being solved. This approach does not requirea priori knowledge of the statistical characteristics of impacts that is an advantage compared with the Kalman filter. A comparative evaluation of the filters’ accuracy is provided using the values of variances of the filtering errors.

  19. Thinking recursively

    CERN Document Server

    Roberts, Eric S

    1986-01-01

    Concentrating on the practical value of recursion, this text, the first of its kind, is essential to computer science students' education. In this text, students will learn the concept and programming applications of recursive thinking. This will ultimately prepare students for advanced topics in computer science such as compiler construction, formal language theory, and the mathematical foundations of computer science.

  20. Use of Recursive Partitioning Analysis in Clinical Trials and Meta-Analysis of Randomized Clinical Trials, 1990-2016.

    Science.gov (United States)

    Fors, Martha Maria; Viada, Carmen Elena; Gonzalez, Paloma

    2017-01-01

    Recursive Partitioning Analysis (RPA) is a very flexible non parametric algorithm that allows classification of individuals according to certain criteria, particularly in clinical trials, the method is used to predict response to treatment or classify individuals according to prognostic factors. In this paper we examine how often RPA is used in clinical trials and in meta-analysis. We reviewed abstracts published between 1990 and 2016, and extracted data regarding clinical trial phase, year of publication, type of treatment, medical indication and main evaluated endpoints. One hundred and eighty three studies were identified; of these 43 were meta-analyses and 23 were clinical trials. Most of the studies were published between 2011 and 2016, for both clinical trials and meta-analyses of randomized clinical trials. The prediction of overall survival and progression free survival were the outcomes most evaluated, at 43.5% and 51.2% respectively. Regarding the use of RPA in clinical trials, the brain was the most common site studied, while for meta-analytic studies, other cancer sites were also studied. The combination of chemotherapy and radiation was seen frequently in clinical trials. Recursive partitioning analysis is a very easy technique to use, and it could be a very powerful tool to predict response in different subgroups of patients, although it is not widely used in clinical trials. Copyright© Bentham Science Publishers; For any queries, please email at epub@benthamscience.org.

  1. The resistance of randomly grown trees

    Science.gov (United States)

    Colman, E. R.; Rodgers, G. J.

    2011-12-01

    An electrical network with the structure of a random tree is considered: starting from a root vertex, in one iteration each leaf (a vertex with zero or one adjacent edges) of the tree is extended by either a single edge with probability p or two edges with probability 1 - p. With each edge having a resistance equal to 1Ω, the total resistance Rn between the root vertex and a busbar connecting all the vertices at the nth level is considered. A dynamical system is presented which approximates Rn, it is shown that the mean value for this system approaches (1 + p)/(1 - p) as n → ∞, the distribution of Rn at large n is also examined. Additionally, a random sequence construction akin to a random Fibonacci sequence is used to approximate Rn; this sequence is shown to be related to the Legendre polynomials and its mean is shown to converge with | - (1 + p)/(1 - p)| ˜ n-1/2.

  2. On recursion.

    Science.gov (United States)

    Watumull, Jeffrey; Hauser, Marc D; Roberts, Ian G; Hornstein, Norbert

    2014-01-08

    It is a truism that conceptual understanding of a hypothesis is required for its empirical investigation. However, the concept of recursion as articulated in the context of linguistic analysis has been perennially confused. Nowhere has this been more evident than in attempts to critique and extend Hauseretal's. (2002) articulation. These authors put forward the hypothesis that what is uniquely human and unique to the faculty of language-the faculty of language in the narrow sense (FLN)-is a recursive system that generates and maps syntactic objects to conceptual-intentional and sensory-motor systems. This thesis was based on the standard mathematical definition of recursion as understood by Gödel and Turing, and yet has commonly been interpreted in other ways, most notably and incorrectly as a thesis about the capacity for syntactic embedding. As we explain, the recursiveness of a function is defined independent of such output, whether infinite or finite, embedded or unembedded-existent or non-existent. And to the extent that embedding is a sufficient, though not necessary, diagnostic of recursion, it has not been established that the apparent restriction on embedding in some languages is of any theoretical import. Misunderstanding of these facts has generated research that is often irrelevant to the FLN thesis as well as to other theories of language competence that focus on its generative power of expression. This essay is an attempt to bring conceptual clarity to such discussions as well as to future empirical investigations by explaining three criterial properties of recursion: computability (i.e., rules in intension rather than lists in extension); definition by induction (i.e., rules strongly generative of structure); and mathematical induction (i.e., rules for the principled-and potentially unbounded-expansion of strongly generated structure). By these necessary and sufficient criteria, the grammars of all natural languages are recursive.

  3. Recursive Distinctioning

    CERN Document Server

    Isaacson, Joel

    2016-01-01

    Recursive distinctioning (RD) is a name coined by Joel Isaacson in his original patent document describing how fundamental patterns of process arise from the systematic application of operations of distinction and description upon themselves. Recursive distinctioning means just what it says. A pattern of distinctions is given in a space based on a graphical structure (such as a line of print or a planar lattice or given graph). Each node of the graph is occupied by a letter from some arbitrary alphabet. A specialized alphabet is given that can indicate distinctions about neighbors of a given node. The neighbors of a node are all nodes that are connected to the given node by edges in the graph. The letters in the specialized alphabet (call it SA) are used to describe the states of the letters in the given graph and at each stage in the recursion, letters in SA are written at all nodes in the graph, describing its previous state. The recursive structure that results from the iteration of descriptions is called ...

  4. The resistance of randomly grown trees

    Energy Technology Data Exchange (ETDEWEB)

    Colman, E R; Rodgers, G J, E-mail: Ewan.Colman@brunel.ac.uk [Department of Mathematical Sciences, Brunel University, Uxbridge, Middlesex UB8 3PH (United Kingdom)

    2011-12-16

    An electrical network with the structure of a random tree is considered: starting from a root vertex, in one iteration each leaf (a vertex with zero or one adjacent edges) of the tree is extended by either a single edge with probability p or two edges with probability 1 - p. With each edge having a resistance equal to 1{Omega}, the total resistance R{sub n} between the root vertex and a busbar connecting all the vertices at the nth level is considered. A dynamical system is presented which approximates R{sub n}, it is shown that the mean value Left-Pointing-Angle-Bracket R{sub n} Right-Pointing-Angle-Bracket for this system approaches (1 + p)/(1 - p) as n {yields} {infinity}, the distribution of R{sub n} at large n is also examined. Additionally, a random sequence construction akin to a random Fibonacci sequence is used to approximate R{sub n}; this sequence is shown to be related to the Legendre polynomials and its mean is shown to converge with | Left-Pointing-Angle-Bracket R{sub n} Right-Pointing-Angle-Bracket - (1 + p)/(1 - p)| {approx} n{sup -1/2}. (paper)

  5. Randomized Binomial Tree and Pricing of American-Style Options

    OpenAIRE

    Hu Xiaoping; Cao Jie

    2014-01-01

    Randomized binomial tree and methods for pricing American options were studied. Firstly, both the completeness and the no-arbitrage conditions in the randomized binomial tree market were proved. Secondly, the description of the node was given, and the cubic polynomial relationship between the number of nodes and the time steps was also obtained. Then, the characteristics of paths and storage structure of the randomized binomial tree were depicted. Then, the procedure and method for pricing Am...

  6. Analysis of some parameters for random nodes in priority trees

    Directory of Open Access Journals (Sweden)

    Alois Panholzer

    2008-04-01

    Full Text Available Priority trees are a certain data structure used for priority queue administration. Under the model that all permutations of the numbers $1, dots, n$ are equally likely to construct a priority tree of size $n$ we study the following parameters in size-$n$ trees: depth of a random node, number of right edges to a random node, and number of descendants of a random node. For all parameters studied we give limiting distribution results.

  7. Decision tree modeling using R.

    Science.gov (United States)

    Zhang, Zhongheng

    2016-08-01

    In machine learning field, decision tree learner is powerful and easy to interpret. It employs recursive binary partitioning algorithm that splits the sample in partitioning variable with the strongest association with the response variable. The process continues until some stopping criteria are met. In the example I focus on conditional inference tree, which incorporates tree-structured regression models into conditional inference procedures. While growing a single tree is subject to small changes in the training data, random forests procedure is introduced to address this problem. The sources of diversity for random forests come from the random sampling and restricted set of input variables to be selected. Finally, I introduce R functions to perform model based recursive partitioning. This method incorporates recursive partitioning into conventional parametric model building.

  8. Recursively-regular subdivisions and applications

    Directory of Open Access Journals (Sweden)

    Rafel Jaume

    2016-05-01

    Full Text Available We generalize regular subdivisions (polyhedral complexes resulting from the projection of the lower faces of a polyhedron introducing the class of recursively-regular subdivisions. Informally speaking, a recursively-regular subdivision is a subdivision that can be obtained by splitting some faces of a regular subdivision by other regular subdivisions (and continue recursively. We also define the finest regular coarsening and the regularity tree of a polyhedral complex. We prove that recursively-regular subdivisions are not necessarily connected by flips and that they are acyclic with respect to the in-front relation. We show that the finest regular coarsening of a subdivision can be efficiently computed, and that whether a subdivision is recursively regular can be efficiently decided. As an application, we also extend a theorem known since 1981 on illuminating space by cones and present connections of recursive regularity to tensegrity theory and graph-embedding problems.     

  9. Minimal vertex covers of random trees

    OpenAIRE

    Coulomb, Stephane

    2004-01-01

    We study minimal vertex covers of trees. Contrarily to the number $N_{vc}(A)$ of minimal vertex covers of the tree $A$, $\\log N_{vc}(A)$ is a self-averaging quantity. We show that, for large sizes $n$, $\\lim_{n\\to +\\infty} _n/n= 0.1033252\\pm 10^{-7}$. The basic idea is, given a tree, to concentrate on its degenerate vertices, that is those vertices which belong to some minimal vertex cover but not to all of them. Deletion of the other vertices induces a forest of totally degenerate trees. We ...

  10. Recursion Theory Week

    CERN Document Server

    Müller, Gert; Sacks, Gerald

    1990-01-01

    These proceedings contain research and survey papers from many subfields of recursion theory, with emphasis on degree theory, in particular the development of frameworks for current techniques in this field. Other topics covered include computational complexity theory, generalized recursion theory, proof theoretic questions in recursion theory, and recursive mathematics.

  11. Minimal vertex covers of random trees

    Science.gov (United States)

    Coulomb, Stéphane

    2005-06-01

    We study minimal vertex covers of trees. In contrast to the number Nvc(A) of minimal vertex covers of the tree A, logNvc(A) is a self-averaging quantity. We show that, for large sizes n, \\lim_{n\\to+\\infty } \\langle \\log N_{\\mathrm {vc}}(A)\\rangle_n/n= 0.103\\,3252\\pm 10^{-7} . The basic idea is, given a tree, to concentrate on its degenerate vertices, that is those vertices which belong to some minimal vertex cover but not to all of them. Deletion of the other vertices induces a forest of totally degenerate trees. We show that the problem reduces to the computation of the size distribution of this forest, which we perform analytically, and of the average \\langle \\log N_{\\mathrm {vc}}\\rangle over totally degenerate trees of given size, which we perform numerically.

  12. Recursions for Statistical Multiple Alignment

    DEFF Research Database (Denmark)

    Hein, Jotun; Pedersen, Christian Nørgaard Storm; Jensen, Jens Ledet

    2002-01-01

    Algorithms are presented that allow the calculation of the probability of a set of sequences related by a binary tree that have evolved according to the Thorne–Kishino–Felsenstein model for a fixed set of parameters. The algorithms are based on a Markov chain generating sequences...... and their alignment at nodes in a tree. Depending on whether the complete realization of this Markov chain is decomposed into the first transition and the rest of the realization or the last transition and the first part of the realization, two kinds of recursions are obtained that are computationally similar...... but probabilistically different. The running time of the algorithms is , where Li is the length of the ith observed sequences and d is the number of sequences. An alternative recursion is also formulated that uses only a Markov chain involving the inner nodes of a tree....

  13. Personalized Risk Prediction in Clinical Oncology Research: Applications and Practical Issues Using Survival Trees and Random Forests.

    Science.gov (United States)

    Hu, Chen; Steingrimsson, Jon Arni

    2017-10-19

    A crucial component of making individualized treatment decisions is to accurately predict each patient's disease risk. In clinical oncology, disease risks are often measured through time-to-event data, such as overall survival and progression/recurrence-free survival, and are often subject to censoring. Risk prediction models based on recursive partitioning methods are becoming increasingly popular largely due to their ability to handle nonlinear relationships, higher-order interactions, and/or high-dimensional covariates. The most popular recursive partitioning methods are versions of the Classification and Regression Tree (CART) algorithm, which builds a simple interpretable tree structured model. With the aim of increasing prediction accuracy, the random forest algorithm averages multiple CART trees, creating a flexible risk prediction model. Risk prediction models used in clinical oncology commonly use both traditional demographic and tumor pathological factors as well as high-dimensional genetic markers and treatment parameters from multimodality treatments. In this article, we describe the most commonly used extensions of the CART and random forest algorithms to right-censored outcomes. We focus on how they differ from the methods for noncensored outcomes, and how the different splitting rules and methods for cost-complexity pruning impact these algorithms. We demonstrate these algorithms by analyzing a randomized Phase III clinical trial of breast cancer. We also conduct Monte Carlo simulations to compare the prediction accuracy of survival forests with more commonly used regression models under various scenarios. These simulation studies aim to evaluate how sensitive the prediction accuracy is to the underlying model specifications, the choice of tuning parameters, and the degrees of missing covariates.

  14. Quantum walks induced by Dirichlet random walks on infinite trees

    Science.gov (United States)

    Higuchi, Yusuke; Segawa, Etsuo

    2018-02-01

    We consider the Grover walk on infinite trees from the viewpoint of spectral analysis. From the previous work, infinite regular trees provide localization. In this paper, we give the complete characterization of the eigenspace of this Grover walk, which involves localization of its behavior and recovers the previous work. Our result suggests that the Grover walk on infinite trees may be regarded as a limit of the quantum walk induced by the isotropic random walk with the Dirichlet boundary condition at the n-th depth rather than one with the Neumann boundary condition.

  15. Programming macro tree transducers

    DEFF Research Database (Denmark)

    Bahr, Patrick; Day, Laurence E.

    2013-01-01

    A tree transducer is a set of mutually recursive functions transforming an input tree into an output tree. Macro tree transducers extend this recursion scheme by allowing each function to be defined in terms of an arbitrary number of accumulation parameters. In this paper, we show how macro tree ...

  16. On the number of spanning trees in random regular graphs

    DEFF Research Database (Denmark)

    Greenhill, Catherine; Kwan, Matthew; Wind, David Kofoed

    2014-01-01

    Let d >= 3 be a fixed integer. We give an asympotic formula for the expected number of spanning trees in a uniformly random d-regular graph with n vertices. (The asymptotics are as n -> infinity, restricted to even n if d is odd.) We also obtain the asymptotic distribution of the number of spanni...

  17. Limit distributions for queues and random rooted trees

    Directory of Open Access Journals (Sweden)

    Lajos Takács

    1993-01-01

    Full Text Available In this paper several limit theorems are proved for the fluctuations of the queue size during the initial busy period of a queuing process with one server. These theorems are used to find the solutions of various problems connected with the heights and widths of random rooted trees.

  18. Recursion theory computational aspects of definability

    CERN Document Server

    Chong, Chi Tat

    2015-01-01

    This monograph presents recursion theory from a generalized and largely global point of view. A major theme is the study of the structures of degrees arising from two key notions of reducibility, the Turing degrees and the hyperdegrees, using ideas and techniques beyond those of classical recursion theory. These include structure theory, hyperarithmetic determinacy and rigidity, basis theorems, independence results on Turing degrees, as well as applications to higher randomness.

  19. Randomized tree construction algorithm to explore energy landscapes.

    Science.gov (United States)

    Jaillet, Léonard; Corcho, Francesc J; Pérez, Juan-Jesús; Cortés, Juan

    2011-12-01

    In this work, a new method for exploring conformational energy landscapes is described. The method, called transition-rapidly exploring random tree (T-RRT), combines ideas from statistical physics and robot path planning algorithms. A search tree is constructed on the conformational space starting from a given state. The tree expansion is driven by a double strategy: on the one hand, it is naturally biased toward yet unexplored regions of the space; on the other, a Monte Carlo-like transition test guides the expansion toward energetically favorable regions. The balance between these two strategies is automatically achieved due to a self-tuning mechanism. The method is able to efficiently find both energy minima and transition paths between them. As a proof of concept, the method is applied to two academic benchmarks and the alanine dipeptide. Copyright © 2011 Wiley Periodicals, Inc.

  20. Recursive Lexicographical Search

    DEFF Research Database (Denmark)

    Iskhakov, Fedor; Rust, John; Schjerning, Bertel

    2016-01-01

    (MPE) of these games, much less all of them. We propose a fast and robust generalization of backward induction we call state recursion that operates on a decomposition of the overall DDG into a finite number of more tractable stage games, which can be solved recursively. We provide conditions under......We define a class of dynamic Markovian games, directional dynamic games (DDG), where directionality is represented by a strategy-independent partial order on the state space. We show that many games are DDGs, yet none of the existing algorithms are guaranteed to find any Markov perfect equilibrium...... which state recursion finds at least one MPE of the overall DDG and introduce a recursive lexicographic search (RLS) algorithm that systematically and efficiently uses state recursion to find all MPE of the overall game in a finite number of steps. We apply RLS to find all MPE of a dynamic model...

  1. MARRT: Medial Axis biased rapidly-exploring random trees

    KAUST Repository

    Denny, Jory

    2014-05-01

    © 2014 IEEE. Motion planning is a difficult and widely studied problem in robotics. Current research aims not only to find feasible paths, but to ensure paths have certain properties, e.g., shortest or safest paths. This is difficult for current state-of-the-art sampling-based techniques as they typically focus on simply finding any path. Despite this difficulty, sampling-based techniques have shown great success in planning for a wide range of applications. Among such planners, Rapidly-Exploring Random Trees (RRTs) search the planning space by biasing exploration toward unexplored regions. This paper introduces a novel RRT variant, Medial Axis RRT (MARRT), which biases tree exploration to the medial axis of free space by pushing all configurations from expansion steps towards the medial axis. We prove that this biasing increases the tree\\'s clearance from obstacles. Improving obstacle clearance is useful where path safety is important, e.g., path planning for robots performing tasks in close proximity to the elderly. Finally, we experimentally analyze MARRT, emphasizing its ability to effectively map difficult passages while increasing obstacle clearance, and compare it to contemporary RRT techniques.

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

  3. Average weighted receiving time in recursive weighted Koch networks

    Indian Academy of Sciences (India)

    Motivated by the empirical observation in airport networks and metabolic networks, we introduce the model of the recursive weighted Koch networks created by the recursive division method. As a fundamental dynamical process, random walks have received considerable interest in the scientific community. Then, we study ...

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

  5. Recursive Programming: A Clarification

    NARCIS (Netherlands)

    G.M.C. van den Hove d'Ertsenryck (Gauthier)

    2012-01-01

    htmlabstractWe show that the block concept, as it was introduced in ALGOL 60, and two of the three main techniques introduced by E. W. Dijkstra in his seminal article Recursive Programming to implement it, the so-called "static links" and "display", have been partly misunderstood. These

  6. Recursive heuristic classification

    Science.gov (United States)

    Wilkins, David C.

    1994-01-01

    The author will describe a new problem-solving approach called recursive heuristic classification, whereby a subproblem of heuristic classification is itself formulated and solved by heuristic classification. This allows the construction of more knowledge-intensive classification programs in a way that yields a clean organization. Further, standard knowledge acquisition and learning techniques for heuristic classification can be used to create, refine, and maintain the knowledge base associated with the recursively called classification expert system. The method of recursive heuristic classification was used in the Minerva blackboard shell for heuristic classification. Minerva recursively calls itself every problem-solving cycle to solve the important blackboard scheduler task, which involves assigning a desirability rating to alternative problem-solving actions. Knowing these ratings is critical to the use of an expert system as a component of a critiquing or apprenticeship tutoring system. One innovation of this research is a method called dynamic heuristic classification, which allows selection among dynamically generated classification categories instead of requiring them to be prenumerated.

  7. Recursive ultrasound imaging

    DEFF Research Database (Denmark)

    2000-01-01

    A method and an apparatus for recursive ultrasound imaging is presented. The method uses a Synthetic Transmit Aperture, but unlike previous approaches a new frame is created at every pulse emission. In receive, parallel beam forming is implemented. The beam formed RF data is added to the previously...

  8. 3. Procedures and Recursion

    Indian Academy of Sciences (India)

    Home; Journals; Resonance – Journal of Science Education; Volume 1; Issue 6. Algorithms Procedures and Recursion. R K Shyamasundar. Series Article Volume 1 ... Author Affiliations. R K Shyamasundar1. Computer Science Group, Tata Institute of Fundamental Research, Homi Bhabha Road Mumbai 400 005, India.

  9. Typing polymorphic recursion

    OpenAIRE

    Figueiredo, Lucília Camarão de; Camarão, Carlos

    2001-01-01

    This paper discusses some advantages of supporting polymorphic recursión in programming languages and describes a decidable type inference algorithm for typing polymorphic and possibly mutually recursive definitions, using Haskell to provide an executable high level specification of the algorithm.

  10. Recursion theory for metamathematics

    CERN Document Server

    Smullyan, Raymond M

    1993-01-01

    This work is a sequel to the author''s Godel''s Incompleteness Theorems, though it can be read independently by anyone familiar with Godel''s incompleteness theorem for Peano arithmetic. The book deals mainly with those aspects of recursion theory that have applications to the metamathematics of incompleteness, undecidability, and related topics. It is both an introduction to the theory and a presentation of new results in the field.

  11. Recursive Rational Choice.

    Science.gov (United States)

    1981-11-01

    402. Putnam , Hilary , [1973], "Recursive Functions and Hierarchies", American Mathematical Monthly, Vol.80, pp.6 8-8 6 . Rice, H.G., [1954...point the reader is also referred to Putnam [19731. The following are useful facts (cf. Kleene [1950]) that we will make reference to subsequently. The...Hierarchy (Cf. Putnam [19731, pp.77-80 and Hermes [1965] pp.192-202). The classification is made in terms of the structure of the definitions that

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

  13. Using histograms to introduce randomization in the generation of ensembles of decision trees

    Science.gov (United States)

    Kamath, Chandrika; Cantu-Paz, Erick; Littau, David

    2005-02-22

    A system for decision tree ensembles that includes a module to read the data, a module to create a histogram, a module to evaluate a potential split according to some criterion using the histogram, a module to select a split point randomly in an interval around the best split, a module to split the data, and a module to combine multiple decision trees in ensembles. The decision tree method includes the steps of reading the data; creating a histogram; evaluating a potential split according to some criterion using the histogram, selecting a split point randomly in an interval around the best split, splitting the data, and combining multiple decision trees in ensembles.

  14. BCFW recursion for TMD parton scattering

    Energy Technology Data Exchange (ETDEWEB)

    Hameren, Andreas van; Serino, Mirko [The H. Niewodniczański Institute of Nuclear Physics, Polisch Academy of Sciences,Radzikowskiego 152, 31-342, Cracow (Poland)

    2015-07-03

    We investigate the application of the BCFW recursion relation to scattering amplitudes with one off-shell particle in a Yang-Mills theory with fermions. We provide a set of conditions of applicability of the BCFW recursion, stressing some important differences with respect to the pure on-shell case. We show how the formulas for Maximally-Helicity-Violating (MHV) configurations with any number of partons, which are well known in the fully on-shell case, are generalized to this kinematic regime. We also derive analytic expressions for all the helicity configurations of the 5-point color-stripped tree-level amplitudes for any of the partons being off the mass shell.

  15. Ensemble of randomized soft decision trees for robust classification

    Indian Academy of Sciences (India)

    For classification, decision trees have become very popular because of its simplicity, interpret-ability and good performance. To induce a decision tree classifier for data having continuous valued attributes, the most common approach is, split the continuous attribute range into a hard (crisp) partition having two or more ...

  16. Sorting by Recursive Partitioning,

    Science.gov (United States)

    1983-12-01

    AD A141 583 SONTING BY RECURSIVE PARTTONINO U) STANFORD UNIV CA 1/1 D EPT 0F COMPUTER Sc JENCE 0 M C HAPI NO DE C83 ISTAN-CS-83-994 MDA903-83 _C-0335...Quicksort for sets of more than 150 elements. The algorithm is practical, works basically in place can be easily implemented and is particularly well...points. Then we prove that the algorithm works in expected time O(nlglgn) for uniform distributions. Next, we do a robust analysis in which we extend this

  17. Recursive Harmonic Numbers and Binomial Coefficients

    OpenAIRE

    Maw, Aung Phone; Kyaw, Aung

    2017-01-01

    We define recursive harmonic numbers as a generalization of harmonic numbers. The table of recursive harmonic numbers, which is like Pascal's triangle, is constructed. A formula for recursive harmonic numbers containing binomial coefficients is also presented.

  18. The ABCD of topological recursion

    DEFF Research Database (Denmark)

    Andersen, Jorgen Ellegaard; Borot, Gaëtan; Chekhov, Leonid O.

    2017-01-01

    Kontsevich and Soibelman reformulated and slightly generalised the topological recursion of math-ph/0702045, seeing it as a quantization of certain quadratic Lagrangians in T*V for some vector space V. KS topological recursion is a procedure which takes as initial data a quantum Airy structure - ...

  19. Absolutely Continuous Spectrum for Random Schrödinger Operators on the Fibonacci and Similar Tree-strips

    Energy Technology Data Exchange (ETDEWEB)

    Sadel, Christian, E-mail: Christian.Sadel@ist.ac.at [University of British Columbia, Mathematics Department (Canada)

    2014-12-15

    We consider cross products of finite graphs with a class of trees that have arbitrarily but finitely long line segments, such as the Fibonacci tree. Such cross products are called tree-strips. We prove that for small disorder random Schrödinger operators on such tree-strips have purely absolutely continuous spectrum in a certain set.

  20. Evaluation of geocast routing trees on random and actual networks

    NARCIS (Netherlands)

    Meijerink, Berend Jan; Baratchi, Mitra; Heijenk, Geert; Koucheryavy, Yevgeni; Mamatas, Lefteris; Matta, Ibrahim; Ometov, Aleksandr; Papadimitriou, Panagiotis

    2017-01-01

    Efficient geocast routing schemes are needed to transmit messages to mobile networked devices in geographically scoped areas. To design an efficient geocast routing algorithm a comprehensive evaluation of different routing tree approaches is needed. In this paper, we present an analytical study

  1. Assessing the relative importance of correlates of loneliness in later life: Gaining insight using recursive partitioning

    DEFF Research Database (Denmark)

    Ejlskov, Linda; Wulff, Jesper; Bøggild, Henrik

    2017-01-01

    study the MRC National Survey of Health and Development. RESULTS: Positive mental well-being, personal mastery, identifying the spouse as the closest confidant, being extrovert and informal social contact were the most important correlates of lower loneliness levels. Participation in organised groups...... and demographic correlates were poor identifiers of loneliness. The regression tree suggested that loneliness was not raised among those with poor mental wellbeing if they identified their partner as closest confidante and had frequent social contact. CONCLUSION: Recursive partitioning can identify which...... the characteristics and assessing the relative importance of correlates of loneliness in older adults. METHOD: Using exploratory regression trees and random forests, we examined combinations and the relative importance of 42 correlates in relation to loneliness at age 68 among 2453 participants from the birth cohort...

  2. Amplitudes, recursion relations and unitarity in the Abelian Higgs model

    Science.gov (United States)

    Kleiss, Ronald; Luna, Oscar Boher

    2017-12-01

    The Abelian Higgs model forms an essential part of the electroweak standard model: it is the sector containing only Z0 and Higgs bosons. We present a diagram-based proof of the tree-level unitarity of this model inside the unitary gauge, where only physical degrees of freedom occur. We derive combinatorial recursion relations for off-shell amplitudes in the massless approximation, which allows us to prove the cancellation of the first two orders in energy of unitarity-violating high-energy behaviour for any tree-level amplitude in this model. We describe a deformation of the amplitudes by extending the physical phase space to at least 7 spacetime dimensions, which leads to on-shell recursion relations à la BCFW. These lead to a simple proof that all on-shell tree amplitudes obey partial-wave unitarity.

  3. Features and Recursive Structure

    Directory of Open Access Journals (Sweden)

    Kuniya Nasukawa

    2015-01-01

    Full Text Available Based on the cross-linguistic tendency that weak vowels are realized with a central quality such as ə, ɨ, or ɯ, this paper attempts to account for this choice by proposing that the nucleus itself is one of the three monovalent vowel elements |A|, |I| and |U| which function as the building blocks of melodic structure. I claim that individual languages make a parametric choice to determine which of the three elements functions as the head of a nuclear expression. In addition, I show that elements can be freely concatenated to create melodic compounds. The resulting phonetic value of an element compound is determined by the specific elements it contains and by the head-dependency relations between those elements. This concatenation-based recursive mechanism of melodic structure can also be extended to levels above the segment, thus ultimately eliminating the need for syllabic constituents. This approach reinterprets the notion of minimalism in phonology by opposing the string-based flat structure.

  4. Random Access to Grammar-Compressed Strings and Trees

    DEFF Research Database (Denmark)

    Bille, Philip; Landau, Gad M.; Raman, Rajeev

    2015-01-01

    Grammar-based compression, where one replaces a long string by a small context-free grammar that generates the string, is a simple and powerful paradigm that captures (sometimes with slight reduction in efficiency) many of the popular compression schemes, including the Lempel-Ziv family, run...... and other operations on grammar-compressed ordered trees. All of the above bounds significantly improve the currently best known results. To achieve these bounds, we introduce several new techniques and data structures of independent interest, including a predecessor data structure, two “biased” weighted...

  5. Revisiting the impacts of non-random extinction on the tree-of-life.

    Science.gov (United States)

    Davies, T Jonathan; Yessoufou, Kowiyou

    2013-08-23

    The tree-of-life represents the diversity of living organisms. Species extinction and the concomitant loss of branches from the tree-of-life is therefore a major conservation concern. There is increasing evidence indicating that extinction is phylogenetically non-random, such that if one species is vulnerable to extinction so too are its close relatives. However, the impact of non-random extinctions on the tree-of-life has been a matter of recent debate. Here, we combine simulations with empirical data on extinction risk in mammals. We demonstrate that phylogenetically clustered extinction leads to a disproportionate loss of branches from the tree-of-life, but that the loss of their summed lengths is indistinguishable from random extinction. We argue that under a speciational model of evolution, the number of branches lost might be of equal or greater consequences than the loss of summed branch lengths. We therefore suggest that the impact of non-random extinction on the tree-of-life may have been underestimated.

  6. What contributes to perceived stress in later life? A recursive partitioning approach

    Science.gov (United States)

    Scott, Stacey B.; Jackson, Brenda R.; Bergeman, C. S.

    2011-01-01

    One possible explanation for the individual differences in outcomes of stress is the diversity of inputs that produce perceptions of being stressed. The current study examines how combinations of contextual features (e.g., social isolation, neighborhood quality, health problems, age discrimination, financial concerns, and recent life events) of later life contribute to overall feelings of stress. Recursive partitioning techniques (regression trees and random forests) were used to examine unique interrelations between predictors of perceived stress in a sample of 282 community-dwelling adults. Trees provided possible examples of equifinality (i.e., subsets of people with similar levels of perceived stress but different predictors) as well as for the identification both of contextual combinations that separated participants with very high and very low perceived stress. Random forest analyses aggregated across many trees based on permuted versions of the data and predictors; loneliness, financial strain, neighborhood strain, ageism, and to some extent life events emerged as important predictors. Interviews with a subsample of participants provided both thick description of the complex relationships identified in the trees, as well as additional risks not appearing in the survey results. Together, the analyses highlight what may be missed when stress is used as a simple unidimensional construct and can guide differential intervention efforts. PMID:21604885

  7. Recursive calculation of Hansen coefficients

    Science.gov (United States)

    Branham, Richard L., Jr.

    1990-06-01

    Hansen coefficients are used in expansions of the elliptic motion. Three methods for calculating the coefficients are studied: Tisserand's method, the Von Zeipel-Andoyer (VZA) method with explicit representation of the polynomials required to compute the Hansen coefficients, and the VZA method with the values of the polynomials calculated recursively. The VZA method with explicit polynomials is by far the most rapid, but the tabulation of the polynomials only extends to 12th order in powers of the eccentricity, and unless one has access to the polynomials in machine-readable form their entry is laborious and error-prone. The recursive calculation of the VZA polynomials, needed to compute the Hansen coefficients, while slower, is faster than the calculation of the Hansen coefficients by Tisserand's method, up to 10th order in the eccentricity and is still relatively efficient for higher orders. The main advantages of the recursive calculation are the simplicity of the program and one's being able to extend the expansions to any order of eccentricity with ease. Because FORTRAN does not implement recursive procedures, this paper used C for all of the calculations. The most important conclusion is recursion's genuine usefulness in scientific computing.

  8. Recursion Relations for Conformal Blocks

    CERN Document Server

    Penedones, João; Yamazaki, Masahito

    2016-09-12

    In the context of conformal field theories in general space-time dimension, we find all the possible singularities of the conformal blocks as functions of the scaling dimension $\\Delta$ of the exchanged operator. In particular, we argue, using representation theory of parabolic Verma modules, that in odd spacetime dimension the singularities are only simple poles. We discuss how to use this information to write recursion relations that determine the conformal blocks. We first recover the recursion relation introduced in 1307.6856 for conformal blocks of external scalar operators. We then generalize this recursion relation for the conformal blocks associated to the four point function of three scalar and one vector operator. Finally we specialize to the case in which the vector operator is a conserved current.

  9. Paradoxical intention and recursive anxiety.

    Science.gov (United States)

    Ascher, L M; Schotte, D E

    1999-06-01

    The present study was designed to investigate a possible relationship between "recursive anxiety" and paradoxical intention. Groups of subjects were chosen from among individuals with public speaking concerns. and for whom fear of fear or recursive anxiety clearly represented an important element, or was completely absent from the clinical profile. These subjects were offered a standard in vivo treatment program for public speaking phobia with inclusion or exclusion of paradoxical intention. A 2 x 2 factorial design was employed. Those whose public speaking anxiety was complicated by recursive anxiety experienced greater improvement when paradoxical intention was included in the treatment program than when it was not employed. In contrast, individuals reporting simple public speaking phobia demonstrated greater success with a treatment program in which paradoxical intention was absent. Wegner's hypothesis of "ironic" cognitive processing was used to explain the proposed relationship between paradoxical intention and fear of fear.

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

  11. Generalising tree traversals to DAGs

    DEFF Research Database (Denmark)

    Bahr, Patrick; Axelsson, Emil

    2015-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 and then apply it to compact graph representations of trees instead. The resulting graph traversals avoid...... is not sound. Therefore, we complement our implementation of the recursion scheme with a number of correspondence theorems that ensure soundness for various classes of traversals. We illustrate the practical applicability of the implementation as well as the complementing theory with a number of examples....

  12. A Classification of Viruses through Recursion Theorems

    OpenAIRE

    Bonfante, Guillaume; Kaczmarek, Matthieu; Marion, Jean-Yves

    2007-01-01

    The original publication is available at www.springerlink.com ; ISBN 978-3-540-73000-2 ; ISSN 0302-9743 (Print) 1611-3349 (Online); International audience; We study computer virology from an abstract point of view. Viruses and worms are self-replicating programs, whose definitions are based on Kleene's second recursion theorem. We introduce a notion of delayed recursion that we apply to both Kleene's second recursion theorem and Smullyan's double recursion theorem. This leads us to define fou...

  13. Recursive Approach in Sparse Matrix LU Factorization

    Directory of Open Access Journals (Sweden)

    Jack Dongarra

    2001-01-01

    Full Text Available This paper describes a recursive method for the LU factorization of sparse matrices. The recursive formulation of common linear algebra codes has been proven very successful in dense matrix computations. An extension of the recursive technique for sparse matrices is presented. Performance results given here show that the recursive approach may perform comparable to leading software packages for sparse matrix factorization in terms of execution time, memory usage, and error estimates of the solution.

  14. CP-Recursion in Danish

    DEFF Research Database (Denmark)

    Nyvad, Anne Mette; Christensen, Ken Ramshøj; Vikner, Sten

    2017-01-01

    Based on data from extraction, embedded V2, and complementizer stacking, this paper proposes a cP/CP-analysis of CP-recursion in Danish. Because extraction can be shown to be possible from relative clauses, wh-islands, and adverbial clauses, and given that long extraction is successive......-cyclic, an extra specifier position has to be available as an escape hatch. Consequently, such extractions require a CP-recursion analysis, as has been argued for embedded V2 and for complementizer stacking. Given that CP-recursion in embedded V2 clauses does not allow extraction, whereas other types of CP......-recursion do, we suggest that embedded V2 is fundamentally different, in that main clause V2 and embedded V2 involve a CP (“big CP”), whereas all other clausal projections above IP are instances of cP (“little cP”). The topmost “little” c° has an occurrence feature that enables extraction but bars spell...

  15. Recursive Ping-Pong Protocols

    DEFF Research Database (Denmark)

    Huttel, Hans; Srba, Jiri

    2004-01-01

    This paper introduces a process calculus with recursion which allows us to express an unbounded number of runs of the ping-pong protocols introduced by Dolev and Yao. We study the decidability issues associated with two common approaches to checking security properties, namely reachability analysis...

  16. Adding Recursive Constructs to Bialgebraic Semantics

    DEFF Research Database (Denmark)

    Klin, Bartek

    2004-01-01

    This paper aims at fitting a general class of recursive equations into the framework of ‘well-behaved' structural operational semantics, formalized as bialgebraic semantics by Turi and Plotkin. Rather than interpreting recursive constructs by means of operational rules, separate recursive equations...... as analyzed by Turi and Plotkin. This means that regular unfolding rules can be merged seamlessly with abstract operational rules....

  17. Random cascades on wavelet trees and their use in analyzing and modeling natural images

    Science.gov (United States)

    Wainwright, Martin J.; Simoncelli, Eero P.; Willsky, Alan S.

    2000-12-01

    We develop a new class of non-Gaussian multiscale stochastic processes defined by random cascades on trees of wavelet or other multiresolution coefficients. These cascades reproduce a rich semi-parametric class of random variables known as Gaussian scale mixtures. We demonstrate that this model class can accurately capture the remarkably regular and non- Gaussian features of natural images in a parsimonious fashion, involving only a small set of parameters. In addition, this model structure leads to efficient algorithms for image processing. In particular, we develop a Newton- like algorithm for MAP estimation that exploits very fast algorithm for linear-Gaussian estimation on trees, and hence is efficient. On the basis of this MAP estimator, we develop and illustrate a denoising technique that is based on a global prior model, and preserves the structure of natural images.

  18. Intelligent bidirectional rapidly-exploring random trees for optimal motion planning in complex cluttered environments

    OpenAIRE

    Qureshi, Ahmed Hussain; Ayaz, Yasar

    2017-01-01

    The sampling based motion planning algorithm known as Rapidly-exploring Random Trees (RRT) has gained the attention of many researchers due to their computational efficiency and effectiveness. Recently, a variant of RRT called RRT* has been proposed that ensures asymptotic optimality. Subsequently its bidirectional version has also been introduced in the literature known as Bidirectional-RRT* (B-RRT*). We introduce a new variant called Intelligent Bidirectional-RRT* (IB-RRT*) which is an impr...

  19. Constructing Binomial Trees Via Random Maps for Analysis of Financial Assets

    Directory of Open Access Journals (Sweden)

    Antonio Airton Carneiro de Freitas

    2010-04-01

    Full Text Available Random maps can be constructed from a priori knowledge of the financial assets. It is also addressed the reverse problem, i.e. from a function of an empirical stationary probability density function we set up a random map that naturally leads to an implied binomial tree, allowing the adjustment of models, including the ability to incorporate jumps. An applica- tion related to the options market is presented. It is emphasized that the quality of the model to incorporate a priori knowledge of the financial asset may be affected, for example, by the skewed vision of the analyst.

  20. Recursive generation of IPR fullerenes

    OpenAIRE

    Goedgebeur, Jan; McKay, Brendan D.

    2015-01-01

    We describe a new construction algorithm for the recursive generation of all non-isomorphic IPR fullerenes. Unlike previous algorithms, the new algorithm stays entirely within the class of IPR fullerenes, that is: every IPR fullerene is constructed by expanding a smaller IPR fullerene unless it belongs to limited class of irreducible IPR fullerenes that can easily be made separately. The class of irreducible IPR fullerenes consists of 36 fullerenes with up to 112 vertices and 4 infinite famil...

  1. Random forests and stochastic gradient boosting for predicting tree canopy cover: Comparing tuning processes and model performance

    Science.gov (United States)

    Elizabeth A. Freeman; Gretchen G. Moisen; John W. Coulston; Barry T. (Ty) Wilson

    2015-01-01

    As part of the development of the 2011 National Land Cover Database (NLCD) tree canopy cover layer, a pilot project was launched to test the use of high-resolution photography coupled with extensive ancillary data to map the distribution of tree canopy cover over four study regions in the conterminous US. Two stochastic modeling techniques, random forests (RF...

  2. Random walk hierarchy measure: What is more hierarchical, a chain, a tree or a star?

    CERN Document Server

    Czégel, Dániel

    2015-01-01

    Signs of hierarchy are prevalent in a wide range of systems in nature and society. One of the key problems is quantifying the importance of hierarchical organisation in the structure of the network representing the interactions or connections between the fundamental units of the studied system. Although a number of notable methods are already available, their vast majority is treating all directed acyclic graphs as already maximally hierarchical. Here we propose a hierarchy measure based on random walks on the network. The novelty of our approach is that directed trees corresponding to multi level pyramidal structures obtain higher hierarchy scores compared to directed chains and directed stars. Furthermore, in the thermodynamic limit the hierarchy measure of regular trees is converging to a well defined limit depending only on the branching number. When applied to real networks, our method is computationally very effective, as the result can be evaluated with arbitrary precision by subsequent multiplications...

  3. Classification of endomicroscopic images of the lung based on random subwindows and extra-trees.

    Science.gov (United States)

    Désir, Chesner; Petitjean, Caroline; Heutte, Laurent; Salaün, Mathieu; Thiberville, Luc

    2012-09-01

    Recently, the in vivo imaging of pulmonary alveoli was made possible thanks to confocal microscopy. For these images, we wish to aid the clinician by developing a computer-aided diagnosis system, able to discriminate between healthy and pathological subjects. The lack of expertise currently available on these images has first led us to choose a generic approach, based on pixel-value description of randomly extracted subwindows and decision tree ensemble for classification (extra-trees). In order to deal with the great complexity of our images, we adapt this method by introducing a texture-based description of the subwindows, based on local binary patterns. We show through our experimental protocol that this adaptation is a promising way to classify fibered confocal fluorescence microscopy images. In addition, we introduce a rejection mechanism on the classifier output to prevent nondetection errors.

  4. Trees

    Directory of Open Access Journals (Sweden)

    Henri Epstein

    2016-11-01

    Full Text Available An algebraic formalism, developed with V. Glaser and R. Stora for the study of the generalized retarded functions of quantum field theory, is used to prove a factorization theorem which provides a complete description of the generalized retarded functions associated with any tree graph. Integrating over the variables associated to internal vertices to obtain the perturbative generalized retarded functions for interacting fields arising from such graphs is shown to be possible for a large category of space–times.

  5. POROSIMETRY BY DOUBLE-RANDOM MULTIPLE TREE STRUCTURING IN VIRTUAL CONCRETE

    Directory of Open Access Journals (Sweden)

    Piet Stroeven

    2012-03-01

    Full Text Available Two different porosimetry methods are presented in two successive papers. Inspiration for the development came from the rapidly-exploring random tree (RRT approach used in robotics. The novel methods are applied to virtual cementitious materials produced by a modern concurrent algorithm-based discrete element modeling system, HADES. This would render possible realistically simulating all aspects of particulate matter that influence structure-sensitive features of the pore network structure in maturing concrete, namely size, shape and dispersion of aggregate and cement particles. Pore space is a complex tortuous entity. Practical methods conventionally applied for assessment of pore size distribution may fail or present biased information. Among them, mercury intrusion porosimetry and 2D quantitative image analysis are popular. The mathematical morphology operator “opening” can be applied to sections and even provide 3D information on pore size distribution, provided isotropy is guaranteed. Unfortunately, aggregate grain surfaces lead to pore anisotropy. The presented methods allow exploration of pore space in the virtual material, after which pore size distribution is derived from star volume measurements.  In addition to size of pores their continuity is of crucial importance for durability estimation. Double-random multiple tree structuring (DRaMuTS, presented herein, and random node structuring (RaNoS provide such information. The latter method will be introduced in a next issue of IA&S.

  6. Multi-Layer and Recursive Neural Networks for Metagenomic Classification.

    Science.gov (United States)

    Ditzler, Gregory; Polikar, Robi; Rosen, Gail

    2015-09-01

    Recent advances in machine learning, specifically in deep learning with neural networks, has made a profound impact on fields such as natural language processing, image classification, and language modeling; however, feasibility and potential benefits of the approaches to metagenomic data analysis has been largely under-explored. Deep learning exploits many layers of learning nonlinear feature representations, typically in an unsupervised fashion, and recent results have shown outstanding generalization performance on previously unseen data. Furthermore, some deep learning methods can also represent the structure in a data set. Consequently, deep learning and neural networks may prove to be an appropriate approach for metagenomic data. To determine whether such approaches are indeed appropriate for metagenomics, we experiment with two deep learning methods: i) a deep belief network, and ii) a recursive neural network, the latter of which provides a tree representing the structure of the data. We compare these approaches to the standard multi-layer perceptron, which has been well-established in the machine learning community as a powerful prediction algorithm, though its presence is largely missing in metagenomics literature. We find that traditional neural networks can be quite powerful classifiers on metagenomic data compared to baseline methods, such as random forests. On the other hand, while the deep learning approaches did not result in improvements to the classification accuracy, they do provide the ability to learn hierarchical representations of a data set that standard classification methods do not allow. Our goal in this effort is not to determine the best algorithm in terms accuracy-as that depends on the specific application-but rather to highlight the benefits and drawbacks of each of the approach we discuss and provide insight on how they can be improved for predictive metagenomic analysis.

  7. Recursion Removal as an Instructional Method to Enhance the Understanding of Recursion Tracing

    Science.gov (United States)

    Velázquez-Iturbide, J. Ángel; Castellanos, M. Eugenia; Hijón-Neira, Raquel

    2016-01-01

    Recursion is one of the most difficult programming topics for students. In this paper, an instructional method is proposed to enhance students' understanding of recursion tracing. The proposal is based on the use of rules to translate linear recursion algorithms into equivalent, iterative ones. The paper has two main contributions: the…

  8. Analysis of tree stand horizontal structure using random point field methods

    Directory of Open Access Journals (Sweden)

    O. P. Sekretenko

    2015-06-01

    Full Text Available This paper uses the model approach to analyze the horizontal structure of forest stands. The main types of models of random point fields and statistical procedures that can be used to analyze spatial patterns of trees of uneven and even-aged stands are described. We show how modern methods of spatial statistics can be used to address one of the objectives of forestry – to clarify the laws of natural thinning of forest stand and the corresponding changes in its spatial structure over time. Studying natural forest thinning, we describe the consecutive stages of modeling: selection of the appropriate parametric model, parameter estimation and generation of point patterns in accordance with the selected model, the selection of statistical functions to describe the horizontal structure of forest stands and testing of statistical hypotheses. We show the possibilities of a specialized software package, spatstat, which is designed to meet the challenges of spatial statistics and provides software support for modern methods of analysis of spatial data. We show that a model of stand thinning that does not consider inter-tree interaction can project the size distribution of the trees properly, but the spatial pattern of the modeled stand is not quite consistent with observed data. Using data of three even-aged pine forest stands of 25, 55, and 90-years old, we demonstrate that the spatial point process models are useful for combining measurements in the forest stands of different ages to study the forest stand natural thinning.

  9. On the covering of left recursive grammars

    NARCIS (Netherlands)

    Nijholt, Antinus; Aho, A.V.

    In this paper we show that some prevailing ideas on the elimination of left recursion in a context-free grammar are not valid. An algorithm and a proof are given to show that every proper context-free grammar is covered by a non-left-recursive grammar.

  10. Conjugate gradient algorithms using multiple recursions

    Energy Technology Data Exchange (ETDEWEB)

    Barth, T.; Manteuffel, T.

    1996-12-31

    Much is already known about when a conjugate gradient method can be implemented with short recursions for the direction vectors. The work done in 1984 by Faber and Manteuffel gave necessary and sufficient conditions on the iteration matrix A, in order for a conjugate gradient method to be implemented with a single recursion of a certain form. However, this form does not take into account all possible recursions. This became evident when Jagels and Reichel used an algorithm of Gragg for unitary matrices to demonstrate that the class of matrices for which a practical conjugate gradient algorithm exists can be extended to include unitary and shifted unitary matrices. The implementation uses short double recursions for the direction vectors. This motivates the study of multiple recursion algorithms.

  11. Bounded queries in recursion theory

    CERN Document Server

    Gasarch, William I

    1999-01-01

    One of the major concerns of theoretical computer science is the classifi­ cation of problems in terms of how hard they are. The natural measure of difficulty of a function is the amount of time needed to compute it (as a function of the length of the input). Other resources, such as space, have also been considered. In recursion theory, by contrast, a function is considered to be easy to compute if there exists some algorithm that computes it. We wish to classify functions that are hard, i.e., not computable, in a quantitative way. We cannot use time or space, since the functions are not even computable. We cannot use Turing degree, since this notion is not quantitative. Hence we need a new notion of complexity-much like time or spac~that is quantitative and yet in some way captures the level of difficulty (such as the Turing degree) of a function.

  12. Detecting treatment-subgroup interactions in clustered data with generalized linear mixed-effects model trees.

    Science.gov (United States)

    Fokkema, M; Smits, N; Zeileis, A; Hothorn, T; Kelderman, H

    2017-10-25

    Identification of subgroups of patients for whom treatment A is more effective than treatment B, and vice versa, is of key importance to the development of personalized medicine. Tree-based algorithms are helpful tools for the detection of such interactions, but none of the available algorithms allow for taking into account clustered or nested dataset structures, which are particularly common in psychological research. Therefore, we propose the generalized linear mixed-effects model tree (GLMM tree) algorithm, which allows for the detection of treatment-subgroup interactions, while accounting for the clustered structure of a dataset. The algorithm uses model-based recursive partitioning to detect treatment-subgroup interactions, and a GLMM to estimate the random-effects parameters. In a simulation study, GLMM trees show higher accuracy in recovering treatment-subgroup interactions, higher predictive accuracy, and lower type II error rates than linear-model-based recursive partitioning and mixed-effects regression trees. Also, GLMM trees show somewhat higher predictive accuracy than linear mixed-effects models with pre-specified interaction effects, on average. We illustrate the application of GLMM trees on an individual patient-level data meta-analysis on treatments for depression. We conclude that GLMM trees are a promising exploratory tool for the detection of treatment-subgroup interactions in clustered datasets.

  13. Discrimination of tree species using random forests from the Chinese high-resolution remote sensing satellite GF-1

    Science.gov (United States)

    Lv, Jie; Ma, Ting

    2016-10-01

    Tree species distribution is an important issue for sustainable forest resource management. However, the accuracy of tree species discrimination using remote-sensing data needs to be improved to support operational forestry-monitoring tasks. This study aimed to classify tree species in the Liangshui Nature Reserve of Heilongjiang Province, China using spectral and structural remote sensing information in an auto-mated Random Forest modelling approach. This study evaluates and compares the performance of two machine learning classifiers, random forests (RF), support vector machine (SVM) to classify the Chinese high-resolution remote sensing satellite GF-1 images. Texture factor was extracted from GF-1 image with grey-level co-occurrence matrix method. Normalized Difference Vegetation Index (NDVI), Ratio Vegetation Index (RVI), Enhanced Vegetation Index (EVI), Difference Vegetation Index (DVI) were calculated and coupled into the model. The result show that the Random Forest model yielded the highest classification accuracy and prediction success for the tree species with an overall classification accuracy of 81.07% and Kappa coefficient value of 0.77. The proposed random forests method was able to achieve highly satisfactory tree species discrimination results. And aerial LiDAR data should be further explored in future research activities.

  14. A Novel Path Planning for Robots Based on Rapidly-Exploring Random Tree and Particle Swarm Optimizer Algorithm

    Directory of Open Access Journals (Sweden)

    Zhou Feng

    2013-09-01

    Full Text Available A based on Rapidly-exploring Random Tree(RRT and Particle Swarm Optimizer (PSO for path planning of the robot is proposed.First the grid method is built to describe the working space of the mobile robot,then the Rapidly-exploring Random Tree algorithm is used to obtain the global navigation path,and the Particle Swarm Optimizer algorithm is adopted to get the better path.Computer experiment results demonstrate that this novel algorithm can plan an optimal path rapidly in a cluttered environment.The successful obstacle avoidance is achieved,and the model is robust and performs reliably.

  15. Combinations of Stressors in Midlife: Examining Role and Domain Stressors Using Regression Trees and Random Forests

    Science.gov (United States)

    2013-01-01

    Objectives. Global perceptions of stress (GPS) have major implications for mental and physical health, and stress in midlife may influence adaptation in later life. Thus, it is important to determine the unique and interactive effects of diverse influences of role stress (at work or in personal relationships), loneliness, life events, time pressure, caregiving, finances, discrimination, and neighborhood circumstances on these GPS. Method. Exploratory regression trees and random forests were used to examine complex interactions among myriad events and chronic stressors in middle-aged participants’ (N = 410; mean age = 52.12) GPS. Results. Different role and domain stressors were influential at high and low levels of loneliness. Varied combinations of these stressors resulting in similar levels of perceived stress are also outlined as examples of equifinality. Loneliness emerged as an important predictor across trees. Discussion. Exploring multiple stressors simultaneously provides insights into the diversity of stressor combinations across individuals—even those with similar levels of global perceived stress—and answers theoretical mandates to better understand the influence of stress by sampling from many domain and role stressors. Further, the unique influences of each predictor relative to the others inform theory and applied work. Finally, examples of equifinality and multifinality call for targeted interventions. PMID:23341437

  16. Non-abelian Z-theory: Berends-Giele recursion for the α{sup ′}-expansion of disk integrals

    Energy Technology Data Exchange (ETDEWEB)

    Mafra, Carlos R. [STAG Research Centre and Mathematical Sciences, University of Southampton,Southampton (United Kingdom); Institute for Advanced Study, School of Natural Sciences,Einstein Drive, Princeton, NJ 08540 (United States); Schlotterer, Oliver [Max-Planck-Institut für Gravitationsphysik, Albert-Einstein-Institut,Am Mühlenberg 1, 14476 Potsdam (Germany)

    2017-01-09

    We present a recursive method to calculate the α{sup ′}-expansion of disk integrals arising in tree-level scattering of open strings which resembles the approach of Berends and Giele to gluon amplitudes. Following an earlier interpretation of disk integrals as doubly partial amplitudes of an effective theory of scalars dubbed as Z-theory, we pinpoint the equation of motion of Z-theory from the Berends-Giele recursion for its tree amplitudes. A computer implementation of this method including explicit results for the recursion up to order α{sup ′7} is made available on the website repo.or.cz/BGap.git.

  17. Decidability and Expressiveness of Recursive Weighted Logic

    DEFF Research Database (Denmark)

    Xue, Bingtian; Larsen, Kim Guldstrand; Mardare, Radu Iulian

    2014-01-01

    Labelled weighted transition systems (LWSs) are transition systems labelled with actions and real numbers. The numbers represent the costs of the corresponding actions in terms of resources. RecursiveWeighted Logic (RWL) is a multimodal logic that expresses qualitative and quantitative properties...... of LWSs. It is endowed with simultaneous recursive equations, which specify the weakest properties satisfied by the recursive variables. We demonstrate that RWL is sufficiently expressive to characterize weighted-bisimilarity of LWSs. In addition, we prove that the logic is decidable, i...

  18. Infinitary Classical Logic: Recursive Equations and Interactive Semantics

    Directory of Open Access Journals (Sweden)

    Michele Basaldella

    2014-09-01

    Full Text Available In this paper, we present an interactive semantics for derivations in an infinitary extension of classical logic. The formulas of our language are possibly infinitary trees labeled by propositional variables and logical connectives. We show that in our setting every recursive formula equation has a unique solution. As for derivations, we use an infinitary variant of Tait-calculus to derive sequents. The interactive semantics for derivations that we introduce in this article is presented as a debate (interaction tree between a test > (derivation candidate, Proponent and an environment > (negation of a sequent, Opponent. We show a completeness theorem for derivations that we call interactive completeness theorem: the interaction between > (test and > (environment does not produce errors (i.e., Proponent wins just in case > comes from a syntactical derivation of >.

  19. Equivalence of recursive specifications in process algebra

    NARCIS (Netherlands)

    A.J. van der Poorten (Alf); Y.S. Usenko (Yaroslav)

    2001-01-01

    textabstractWe define an equivalence relation on recursive specifications in process algebra that is model-independent and does not involve an explicit notion of solution. Then we extend this equivalence to the specification language $mu$CRL.

  20. Recursive utility using the stochastic maximum principle

    National Research Council Canada - National Science Library

    Aase, Knut K

    2016-01-01

    .... We use the stochastic maximum principle to analyze the model. This method uses forward/backward stochastic differential equations, and works when the economy is not Markovian, which can be the case with recursive utility...

  1. Griffiths singularities in the random quantum Ising antiferromagnet: A tree tensor network renormalization group study

    Science.gov (United States)

    Lin, Yu-Ping; Kao, Ying-Jer; Chen, Pochung; Lin, Yu-Cheng

    2017-08-01

    The antiferromagnetic Ising chain in both transverse and longitudinal magnetic fields is one of the paradigmatic models of a quantum phase transition. The antiferromagnetic system exhibits a zero-temperature critical line separating an antiferromagnetic phase and a paramagnetic phase; the critical line connects an integrable quantum critical point at zero longitudinal field and a classical first-order transition point at zero transverse field. Using a strong-disorder renormalization group method formulated as a tree tensor network, we study the zero-temperature phase of the quantum Ising chain with bond randomness. We introduce a new matrix product operator representation of high-order moments, which provides an efficient and accurate tool for determining quantum phase transitions via the Binder cumulant of the order parameter. Our results demonstrate an infinite-randomness quantum critical point in zero longitudinal field accompanied by pronounced quantum Griffiths singularities, arising from rare ordered regions with anomalously slow fluctuations inside the paramagnetic phase. The strong Griffiths effects are signaled by a large dynamical exponent z >1 , which characterizes a power-law density of low-energy states of the localized rare regions and becomes infinite at the quantum critical point. Upon application of a longitudinal field, the quantum phase transition between the paramagnetic phase and the antiferromagnetic phase is completely destroyed. Furthermore, quantum Griffiths effects are suppressed, showing z <1 , when the dynamics of the rare regions is hampered by the longitudinal field.

  2. Method for implementation of recursive hierarchical segmentation on parallel computers

    Science.gov (United States)

    Tilton, James C. (Inventor)

    2005-01-01

    A method, computer readable storage, and apparatus for implementing a recursive hierarchical segmentation algorithm on a parallel computing platform. The method includes setting a bottom level of recursion that defines where a recursive division of an image into sections stops dividing, and setting an intermediate level of recursion where the recursive division changes from a parallel implementation into a serial implementation. The segmentation algorithm is implemented according to the set levels. The method can also include setting a convergence check level of recursion with which the first level of recursion communicates with when performing a convergence check.

  3. Lambda-Dropping: Transforming Recursive Equations into Programs with Block Structure

    DEFF Research Database (Denmark)

    Danvy, Olivier; Schultz, Ulrik Pagh

    1999-01-01

    Lambda-lifting a functional program transforms it into a set of recursive equations. We present the symmetric transformation: lambda-dropping. Lambda-dropping a set of recursive equations restores block structure and lexical scope.For lack of scope, recursive equations must carry around all...... to float (for lambda-lifting) or to sink (for lambda-dropping) along the vertices of the scope tree.We believe lambda-lifting and lambda-dropping are interesting per se, both in principle and in practice, but our prime application is partial evaluation: except for Malmkjær and Ø...... with dozens of parameters, which most compilers do not handle efficiently. Lambda-dropping in a post-processing phase restores their block structure and lexical scope thereby significantly reducing both the compile time and the run time of residual programs....

  4. On invariant measures of stochastic recursions in a critical case

    OpenAIRE

    Buraczewski, Dariusz

    2007-01-01

    We consider an autoregressive model on ℝ defined by the recurrence equation Xn=AnXn−1+Bn, where {(Bn, An)} are i.i.d. random variables valued in ℝ×ℝ+ and $\\mathbb{E}[\\log A_{1}]=0$ (critical case). It was proved by Babillot, Bougerol and Elie that there exists a unique invariant Radon measure of the process {Xn}. The aim of the paper is to investigate its behavior at infinity. We describe also stationary measures of two other stochastic recursions, including one arising in queuing theory....

  5. Continued development of recursive thinking in adolescence : Longitudinal analyses with a revised recursive thinking test

    NARCIS (Netherlands)

    van den Bos, E.; de Rooij, M.; Sumter, S.R.; Westenberg, P.M.

    2016-01-01

    The present study adds to the emerging literature on the development of social cognition in adolescence by investigating the development of recursive thinking (i.e., thinking about thinking). Previous studies have indicated that the development of recursive thinking is not completed during

  6. Denotational semantics of recursive types in synthetic guarded domain theory

    DEFF Research Database (Denmark)

    Møgelberg, Rasmus Ejlers; Paviotti, Marco

    2016-01-01

    -determinism and concurrency. Guarded recursion also offers a way of adding recursion to type theory while maintaining logical consistency. In previous work we initiated a programme of denotational semantics in type theory using guarded recursion, by constructing a computationally adequate model of the language PCF (simply......Guarded recursion is a form of recursion where recursive calls are guarded by delay modalities. Previous work has shown how guarded recursion is useful for reasoning operationally about programming languages with advanced features including general references, recursive types, countable non...... typed lambda calculus with fixed points). This model was intensional in that it could distinguish between computations computing the same result using a different number of fixed point unfoldings. In this work we show how also programming languages with recursive types can be given denotational...

  7. On semantics and applications of guarded recursion

    DEFF Research Database (Denmark)

    Bizjak, Aleš

    2016-01-01

    In this dissertation we study applications and semantics of guarded recursion, which is a method for ensuring that self-referential descriptions of objects define a unique object. The first two chapters are devoted to applications. We use guarded recursion, first in the form of explicit step......-indexing and then in the form of the internal language of particular sheaf topos, to construct logical relations for reasoning about contextual approximation of probabilistic and nondeterministic programs. These logical relations are sound and complete and useful for showing a range of example equivalences. In the third...... chapter we study a simply typed calculus with additional "later" and "constant" modalities and a guarded fixed-point combinator. These are used for encoding and working with guarded recursive and coinductive types in a modular way. We develop a normalising operational semantics, provide an adequate...

  8. Updating Recursive XML Views of Relations

    DEFF Research Database (Denmark)

    Choi, Byron; Cong, Gao; Fan, Wenfei

    2009-01-01

    This paper investigates the view update problem for XML views published from relational data. We consider XML views defined in terms of mappings directed by possibly recursive DTDs compressed into DAGs and stored in relations. We provide new techniques to efficiently support XML view updates...... specified in terms of XPath expressions with recursion and complex filters. The interaction between XPath recursion and DAG compression of XML views makes the analysis of the XML view update problem rather intriguing. Furthermore, many issues are still open even for relational view updates, and need...... to be explored. In response to these, on the XML side, we revise the notion of side effects and update semantics based on the semantics of XML views, and present effecient algorithms to translate XML updates to relational view updates. On the relational side, we propose a mild condition on SPJ views, and show...

  9. Recursive technique for inverting the lidar equation

    Science.gov (United States)

    Gonzalez, Raul

    1988-07-01

    A method for extracting the extinction coefficient from lidar signals is presented. The method assumes the backscatter and extinction coefficient to be related by a power law and consists of approximating the integral in the lidar equation by a Riemann sum of the extinction coefficients. This approximation allows the development of two recursion formulas for extracting the extinction coefficient as a function of range. One formula is a forward recursion, and the other is a backward recursion in the sense that solutions are generated for r greater than or equal to r(0) and for r less than or equal to r(m), respectively, where r(0) is a near-end range and r(m) is a far-end reference range.

  10. Nonparametric Binary Recursive Partitioning for Deterioration Prediction of Infrastructure Elements

    Directory of Open Access Journals (Sweden)

    Mariza Pittou

    2009-01-01

    Full Text Available This paper introduces binary recursive partitioning (BRP as a method for estimating bridge deck deterioration and treats it as a classification and decision problem. The proposed BRP method is applied to the Indiana bridge inventory database containing 25 years of detailed information on approximately 5,500 bridges on state-maintained highways. Classification trees are separately created for 4 and 2 prediction classes and relatively high degrees of success are achieved for deck condition prediction. The significant variables identified as the most influential include current deck condition and deck age. The proposed method offers an alternative nonparametric approach for bridge deck condition prediction and could be used for cross comparisons of models calibrated using the widely applied parametric approaches.

  11. Parametric and non-parametric masking of randomness in sequence alignments can be improved and leads to better resolved trees

    Directory of Open Access Journals (Sweden)

    von Reumont Björn M

    2010-03-01

    Full Text Available Abstract Background Methods of alignment masking, which refers to the technique of excluding alignment blocks prior to tree reconstructions, have been successful in improving the signal-to-noise ratio in sequence alignments. However, the lack of formally well defined methods to identify randomness in sequence alignments has prevented a routine application of alignment masking. In this study, we compared the effects on tree reconstructions of the most commonly used profiling method (GBLOCKS which uses a predefined set of rules in combination with alignment masking, with a new profiling approach (ALISCORE based on Monte Carlo resampling within a sliding window, using different data sets and alignment methods. While the GBLOCKS approach excludes variable sections above a certain threshold which choice is left arbitrary, the ALISCORE algorithm is free of a priori rating of parameter space and therefore more objective. Results ALISCORE was successfully extended to amino acids using a proportional model and empirical substitution matrices to score randomness in multiple sequence alignments. A complex bootstrap resampling leads to an even distribution of scores of randomly similar sequences to assess randomness of the observed sequence similarity. Testing performance on real data, both masking methods, GBLOCKS and ALISCORE, helped to improve tree resolution. The sliding window approach was less sensitive to different alignments of identical data sets and performed equally well on all data sets. Concurrently, ALISCORE is capable of dealing with different substitution patterns and heterogeneous base composition. ALISCORE and the most relaxed GBLOCKS gap parameter setting performed best on all data sets. Correspondingly, Neighbor-Net analyses showed the most decrease in conflict. Conclusions Alignment masking improves signal-to-noise ratio in multiple sequence alignments prior to phylogenetic reconstruction. Given the robust performance of alignment

  12. Adaptable Iterative and Recursive Kalman Filter Schemes

    Science.gov (United States)

    Zanetti, Renato

    2014-01-01

    Nonlinear filters are often very computationally expensive and usually not suitable for real-time applications. Real-time navigation algorithms are typically based on linear estimators, such as the extended Kalman filter (EKF) and, to a much lesser extent, the unscented Kalman filter. The Iterated Kalman filter (IKF) and the Recursive Update Filter (RUF) are two algorithms that reduce the consequences of the linearization assumption of the EKF by performing N updates for each new measurement, where N is the number of recursions, a tuning parameter. This paper introduces an adaptable RUF algorithm to calculate N on the go, a similar technique can be used for the IKF as well.

  13. Recursive Estimation for Dynamical Systems with Different Delay Rates Sensor Network and Autocorrelated Process Noises

    Directory of Open Access Journals (Sweden)

    Jianxin Feng

    2014-01-01

    Full Text Available The recursive estimation problem is studied for a class of uncertain dynamical systems with different delay rates sensor network and autocorrelated process noises. The process noises are assumed to be autocorrelated across time and the autocorrelation property is described by the covariances between different time instants. The system model under consideration is subject to multiplicative noises or stochastic uncertainties. The sensor delay phenomenon occurs in a random way and each sensor in the sensor network has an individual delay rate which is characterized by a binary switching sequence obeying a conditional probability distribution. By using the orthogonal projection theorem and an innovation analysis approach, the desired recursive robust estimators including recursive robust filter, predictor, and smoother are obtained. Simulation results are provided to demonstrate the effectiveness of the proposed approaches.

  14. Analysis of litter size and average litter weight in pigs using a recursive model

    DEFF Research Database (Denmark)

    Varona, Luis; Sorensen, Daniel; Thompson, Robin

    2007-01-01

    An analysis of litter size and average piglet weight at birth in Landrace and Yorkshire using a standard two-trait mixed model (SMM) and a recursive mixed model (RMM) is presented. The RMM establishes a one-way link from litter size to average piglet weight. It is shown that there is a one......-to-one correspondence between the parameters of SMM and RMM and that they generate equivalent likelihoods. As parameterized in this work, the RMM tests for the presence of a recursive relationship between additive genetic values, permanent environmental effects, and specific environmental effects of litter size......, on average piglet weight. The equivalent standard mixed model tests whether or not the covariance matrices of the random effects have a diagonal structure. In Landrace, posterior predictive model checking supports a model without any form of recursion or, alternatively, a SMM with diagonal covariance...

  15. Algebraic Optimization of Recursive Database Queries

    DEFF Research Database (Denmark)

    Hansen, Michael Reichhardt

    1988-01-01

    a generalization of Aho and Ullman, (1979). The result is interpreted in function free logic database terms as a transformation of the recursively defined predicate involving: (a) elimination of an argument, and (b) propagation of selections (instantiations) to the extensionally defined predicates. A collection...

  16. Recursive Delay Calculation Unit for Parametric Beamformer

    DEFF Research Database (Denmark)

    Nikolov, Svetoslav; Jensen, Jørgen Arendt; Tomov, Borislav Gueorguiev

    2006-01-01

    This paper presents a recursive approach for parametric delay calculations for a beamformer. The suggested calculation procedure is capable of calculating the delays for any image line defined by an origin and arbitrary direction. It involves only add and shift operations making it suitable...

  17. Recursive unsupervised learning of finite mixture models

    NARCIS (Netherlands)

    Zivkovic, Z.; van der Heijden, Ferdinand

    2004-01-01

    There are two open problems when finite mixture densities are used to model multivariate data: the selection of the number of components and the initialization. In this paper, we propose an online (recursive) algorithm that estimates the parameters of the mixture and that simultaneously selects the

  18. New machine learning tools for predictive vegetation mapping after climate change: Bagging and Random Forest perform better than Regression Tree Analysis

    Science.gov (United States)

    L.R. Iverson; A.M. Prasad; A. Liaw

    2004-01-01

    More and better machine learning tools are becoming available for landscape ecologists to aid in understanding species-environment relationships and to map probable species occurrence now and potentially into the future. To thal end, we evaluated three statistical models: Regression Tree Analybib (RTA), Bagging Trees (BT) and Random Forest (RF) for their utility in...

  19. A Survey on Teaching and Learning Recursive Programming

    Science.gov (United States)

    Rinderknecht, Christian

    2014-01-01

    We survey the literature about the teaching and learning of recursive programming. After a short history of the advent of recursion in programming languages and its adoption by programmers, we present curricular approaches to recursion, including a review of textbooks and some programming methodology, as well as the functional and imperative…

  20. Effect of Tree Nuts on Glycemic Control in Diabetes: A Systematic Review and Meta-Analysis of Randomized Controlled Dietary Trials

    OpenAIRE

    Effie Viguiliouk; Kendall, Cyril W. C.; Sonia Blanco Mejia; Cozma, Adrian I.; Vanessa Ha; Arash Mirrahimi; Viranda H Jayalath; Augustin, Livia S A; Laura Chiavaroli; Leiter, Lawrence A; de Souza, Russell J.; Jenkins, David J.A.; John L Sievenpiper

    2014-01-01

    Background Tree nut consumption has been associated with reduced diabetes risk, however, results from randomized trials on glycemic control have been inconsistent. Objective To provide better evidence for diabetes guidelines development, we conducted a systematic review and meta-analysis of randomized controlled trials to assess the effects of tree nuts on markers of glycemic control in individuals with diabetes. Data Sources MEDLINE, EMBASE, CINAHL, and Cochrane databases through 6 April 201...

  1. Variances in the projections, resulting from CLIMEX, Boosted Regression Trees and Random Forests techniques

    Science.gov (United States)

    Shabani, Farzin; Kumar, Lalit; Solhjouy-fard, Samaneh

    2017-08-01

    The aim of this study was to have a comparative investigation and evaluation of the capabilities of correlative and mechanistic modeling processes, applied to the projection of future distributions of date palm in novel environments and to establish a method of minimizing uncertainty in the projections of differing techniques. The location of this study on a global scale is in Middle Eastern Countries. We compared the mechanistic model CLIMEX (CL) with the correlative models MaxEnt (MX), Boosted Regression Trees (BRT), and Random Forests (RF) to project current and future distributions of date palm ( Phoenix dactylifera L.). The Global Climate Model (GCM), the CSIRO-Mk3.0 (CS) using the A2 emissions scenario, was selected for making projections. Both indigenous and alien distribution data of the species were utilized in the modeling process. The common areas predicted by MX, BRT, RF, and CL from the CS GCM were extracted and compared to ascertain projection uncertainty levels of each individual technique. The common areas identified by all four modeling techniques were used to produce a map indicating suitable and unsuitable areas for date palm cultivation for Middle Eastern countries, for the present and the year 2100. The four different modeling approaches predict fairly different distributions. Projections from CL were more conservative than from MX. The BRT and RF were the most conservative methods in terms of projections for the current time. The combination of the final CL and MX projections for the present and 2100 provide higher certainty concerning those areas that will become highly suitable for future date palm cultivation. According to the four models, cold, hot, and wet stress, with differences on a regional basis, appears to be the major restrictions on future date palm distribution. The results demonstrate variances in the projections, resulting from different techniques. The assessment and interpretation of model projections requires reservations

  2. Maximizing the Diversity of Ensemble Random Forests for Tree Genera Classification Using High Density LiDAR Data

    Directory of Open Access Journals (Sweden)

    Connie Ko

    2016-08-01

    Full Text Available Recent research into improving the effectiveness of forest inventory management using airborne LiDAR data has focused on developing advanced theories in data analytics. Furthermore, supervised learning as a predictive model for classifying tree genera (and species, where possible has been gaining popularity in order to minimize this labor-intensive task. However, bottlenecks remain that hinder the immediate adoption of supervised learning methods. With supervised classification, training samples are required for learning the parameters that govern the performance of a classifier, yet the selection of training data is often subjective and the quality of such samples is critically important. For LiDAR scanning in forest environments, the quantification of data quality is somewhat abstract, normally referring to some metric related to the completeness of individual tree crowns; however, this is not an issue that has received much attention in the literature. Intuitively the choice of training samples having varying quality will affect classification accuracy. In this paper a Diversity Index (DI is proposed that characterizes the diversity of data quality (Qi among selected training samples required for constructing a classification model of tree genera. The training sample is diversified in terms of data quality as opposed to the number of samples per class. The diversified training sample allows the classifier to better learn the positive and negative instances and; therefore; has a higher classification accuracy in discriminating the “unknown” class samples from the “known” samples. Our algorithm is implemented within the Random Forests base classifiers with six derived geometric features from LiDAR data. The training sample contains three tree genera (pine; poplar; and maple and the validation samples contains four labels (pine; poplar; maple; and “unknown”. Classification accuracy improved from 72.8%; when training samples were

  3. Decision tree approach for classification of remotely sensed satellite ...

    Indian Academy of Sciences (India)

    DTC) algorithm for classification of remotely sensed satellite data (Landsat TM) using open source support. The decision tree is constructed by recursively partitioning the spectral distribution of the training dataset using WEKA, open source ...

  4. The recursion relation in Lagrangian perturbation theory

    Energy Technology Data Exchange (ETDEWEB)

    Rampf, Cornelius, E-mail: rampf@physik.rwth-aachen.de [Institut für Theoretische Teilchenphysik und Kosmologie, RWTH Aachen, D-52056 Aachen (Germany)

    2012-12-01

    We derive a recursion relation in the framework of Lagrangian perturbation theory, appropriate for studying the inhomogeneities of the large scale structure of the universe. We use the fact that the perturbative expansion of the matter density contrast is in one-to-one correspondence with standard perturbation theory (SPT) at any order. This correspondence has been recently shown to be valid up to fourth order for a non-relativistic, irrotational and dust-like component. Assuming it to be valid at arbitrary (higher) order, we express the Lagrangian displacement field in terms of the perturbative kernels of SPT, which are itself given by their own and well-known recursion relation. We argue that the Lagrangian solution always contains more non-linear information in comparison with the SPT solution, (mainly) if the non-perturbative density contrast is restored after the displacement field is obtained.

  5. FRPA: A Framework for Recursive Parallel Algorithms

    Science.gov (United States)

    2015-05-01

    over naïve scheduling . Our Framework for Recursive Parallel Algorithms (FRPA) allows for the separation of an algorithm’s implemen- tation from its...parallelism, and Cilk Plus handles task scheduling and load balancing. Additionally, FRPA uses OpenTuner [7] to tune the BFS/DFS interleaving and all...system for data- flow task programming on heterogeneous architectures, supports multi-CPU and multi- GPU architectures. This framework consists of a

  6. Recursion vs. Replication in Simple Cryptographic Protocols

    DEFF Research Database (Denmark)

    Huttel, Hans; Srba, Jiri

    2005-01-01

    's spectrum, become undecidable for a very simple recursive extension of the protocol. The result holds even if no nondeterministic choice operator is allowed. We also show that the extended calculus is capable of an implicit description of the active intruder, including full analysis and synthesis...... of messages in the sense of Amadio, Lugiez and Vanackere. We conclude by showing that reachability analysis for a replicative variant of the protocol becomes decidable....

  7. QCD amplitudes with 2 initial spacelike legs via generalised BCFW recursion

    Energy Technology Data Exchange (ETDEWEB)

    Kutak, Krzysztof; Hameren, Andreas van; Serino, Mirko [The H. Niewodniczański Institute of Nuclear Physics, Polish Academy of Sciences, ul. Radzikowskiego 152, 31-342, Cracow (Poland)

    2017-02-02

    We complete the generalisation of the BCFW recursion relation to the off-shell case, allowing for the computation of tree level scattering amplitudes for full High Energy Factorisation (HEF), i.e. with both incoming partons having a non-vanishing transverse momentum. We provide explicit results for color-ordered amplitudes with two off-shell legs in massless QCD up to 4 point, continuing the program begun in two previous papers. For the 4-fermion amplitudes, which are not BCFW-recursible, we perform a diagrammatic computation, so as to offer a complete set of expressions. We explicitly show and discuss some plots of the squared 2→2 matrix elements as functions of the differences in rapidity and azimuthal angle of the final state particles.

  8. Large deviations for random trees and the branching of RNA secondary structures.

    Science.gov (United States)

    Bakhtin, Yuri; Heitsch, Christine E

    2009-01-01

    We give a Large Deviation Principle (LDP) with explicit rate function for the distribution of vertex degrees in plane trees, a combinatorial model of RNA secondary structures. We calculate the typical degree distributions based on nearest neighbor free energies, and compare our results with the branching configurations found in two sets of large RNA secondary structures. We find substantial agreement overall, with some interesting deviations which merit further study.

  9. Imitation learning of car driving skills with decision trees and random forests

    Directory of Open Access Journals (Sweden)

    Cichosz Paweł

    2014-09-01

    Full Text Available Machine learning is an appealing and useful approach to creating vehicle control algorithms, both for simulated and real vehicles. One common learning scenario that is often possible to apply is learning by imitation, in which the behavior of an exemplary driver provides training instances for a supervised learning algorithm. This article follows this approach in the domain of simulated car racing, using the TORCS simulator. In contrast to most prior work on imitation learning, a symbolic decision tree knowledge representation is adopted, which combines potentially high accuracy with human readability, an advantage that can be important in many applications. Decision trees are demonstrated to be capable of representing high quality control models, reaching the performance level of sophisticated pre-designed algorithms. This is achieved by enhancing the basic imitation learning scenario to include active retraining, automatically triggered on control failures. It is also demonstrated how better stability and generalization can be achieved by sacrificing human-readability and using decision tree model ensembles. The methodology for learning control models contributed by this article can be hopefully applied to solve real-world control tasks, as well as to develop video game bots

  10. Improved Undecidability Results for Reachability Games on Recursive Timed Automata

    Directory of Open Access Journals (Sweden)

    Shankara Narayanan Krishna

    2014-08-01

    Full Text Available We study reachability games on recursive timed automata (RTA that generalize Alur-Dill timed automata with recursive procedure invocation mechanism similar to recursive state machines. It is known that deciding the winner in reachability games on RTA is undecidable for automata with two or more clocks, while the problem is decidable for automata with only one clock. Ouaknine and Worrell recently proposed a time-bounded theory of real-time verification by claiming that restriction to bounded-time recovers decidability for several key decision problem related to real-time verification. We revisited games on recursive timed automata with time-bounded restriction in the hope of recovering decidability. However, we found that the problem still remains undecidable for recursive timed automata with three or more clocks. Using similar proof techniques we characterize a decidability frontier for a generalization of RTA to recursive stopwatch automata.

  11. Edge-Disjoint Fibonacci Trees in Hypercube

    Directory of Open Access Journals (Sweden)

    Indhumathi Raman

    2014-01-01

    Full Text Available The Fibonacci tree is a rooted binary tree whose number of vertices admit a recursive definition similar to the Fibonacci numbers. In this paper, we prove that a hypercube of dimension h admits two edge-disjoint Fibonacci trees of height h, two edge-disjoint Fibonacci trees of height h-2, two edge-disjoint Fibonacci trees of height h-4 and so on, as subgraphs. The result shows that an algorithm with Fibonacci trees as underlying data structure can be implemented concurrently on a hypercube network with no communication latency.

  12. Repeated measurements of blood lactate concentration as a prognostic marker in horses with acute colitis evaluated with classification and regression trees (CART) and random forest analysis

    DEFF Research Database (Denmark)

    Petersen, Mette Bisgaard; Tolver, Anders; Husted, Louise

    2016-01-01

    -off value of 7 mmol/L had a sensitivity of 0.66 and a specificity of 0.92 in predicting survival. In independent test data, the sensitivity was 0.69 and the specificity was 0.76. At the observed survival rate (38%), the optimal decision tree identified horses as non-survivors when the Lac at admission...... admitted with acute colitis (trees, as well as random...

  13. A model of guarded recursion with clock synchronisation

    DEFF Research Database (Denmark)

    Bizjak, Aleš; Møgelberg, Rasmus Ejlers

    2015-01-01

    Guarded recursion is an approach to solving recursive type equations where the type variable appears guarded by a modality to be thought of as a delay for one time step. Atkey and McBride proposed a calculus in which guarded recursion can be used when programming with coinductive data, allowing p...... by removing freshness restrictions from typing rules, and is a necessary step towards defining rewrite semantics, and ultimately implementing the calculus....

  14. Recursive definition of global cellular-automata mappings

    DEFF Research Database (Denmark)

    Feldberg, Rasmus; Knudsen, Carsten; Rasmussen, Steen

    1994-01-01

    A method for a recursive definition of global cellular-automata mappings is presented. The method is based on a graphical representation of global cellular-automata mappings. For a given cellular-automaton rule the recursive algorithm defines the change of the global cellular-automaton mapping...... as the number of lattice sites is incremented. A proof of lattice size invariance of global cellular-automata mappings is derived from an approximation to the exact recursive definition. The recursive definitions are applied to calculate the fractal dimension of the set of reachable states and of the set...... of fixed points of cellular automata on an infinite lattice....

  15. Rates of Convergence of Recursively Defined Sequences

    DEFF Research Database (Denmark)

    Lambov, Branimir Zdravkov

    2005-01-01

    This paper gives a generalization of a result by Matiyasevich which gives explicit rates of convergence for monotone recursively defined sequences. The generalization is motivated by recent developments in fixed point theory and the search for applications of proof mining to the field. It relaxes...... the requirement for monotonicity to the form xn+1 ≤ (1+an)xn+bn where the parameter sequences have to be bounded in sum, and also provides means to treat computational errors. The paper also gives an example result, an application of proof mining to fixed point theory, that can be achieved by the means discussed...

  16. Syntactic Recursion Facilitates and Working Memory Predicts Recursive Theory of Mind

    NARCIS (Netherlands)

    Arslan, Burcu; Hohenberger, Annette; Verbrugge, Rineke

    2017-01-01

    In this study, we focus on the possible roles of second-order syntactic recursion and working memory in terms of simple and complex span tasks in the development of second-order false belief reasoning. We tested 89 Turkish children in two age groups, one younger (4;6-6;5 years) and one older

  17. Spatial prediction of landslides using a hybrid machine learning approach based on Random Subspace and Classification and Regression Trees

    Science.gov (United States)

    Pham, Binh Thai; Prakash, Indra; Tien Bui, Dieu

    2018-02-01

    A hybrid machine learning approach of Random Subspace (RSS) and Classification And Regression Trees (CART) is proposed to develop a model named RSSCART for spatial prediction of landslides. This model is a combination of the RSS method which is known as an efficient ensemble technique and the CART which is a state of the art classifier. The Luc Yen district of Yen Bai province, a prominent landslide prone area of Viet Nam, was selected for the model development. Performance of the RSSCART model was evaluated through the Receiver Operating Characteristic (ROC) curve, statistical analysis methods, and the Chi Square test. Results were compared with other benchmark landslide models namely Support Vector Machines (SVM), single CART, Naïve Bayes Trees (NBT), and Logistic Regression (LR). In the development of model, ten important landslide affecting factors related with geomorphology, geology and geo-environment were considered namely slope angles, elevation, slope aspect, curvature, lithology, distance to faults, distance to rivers, distance to roads, and rainfall. Performance of the RSSCART model (AUC = 0.841) is the best compared with other popular landslide models namely SVM (0.835), single CART (0.822), NBT (0.821), and LR (0.723). These results indicate that performance of the RSSCART is a promising method for spatial landslide prediction.

  18. Quantitative Structure Activity Relationship study of the Anti-Hepatitis Peptides employing Random Forests and Extra-trees regressors.

    Science.gov (United States)

    Mishra, Gunjan; Sehgal, Deepak; Valadi, Jayaraman K

    2017-01-01

    Antimicrobial peptides are host defense peptides being viewed as replacement to broad-spectrum antibiotics due to varied advantages. Hepatitis is the commonest infectious disease of liver, affecting 500 million globally with reported adverse side effects in treatment therapy. Antimicrobial peptides active against hepatitis are called as anti-hepatitis peptides (AHP). In current work, we present Extratrees and Random Forests based Quantitative Structure Activity Relationship (QSAR) regression modeling using extracted sequence based descriptors for prediction of the anti-hepatitis activity. The Extra-trees regression model yielded a very high performance in terms coefficient of determination (R2) as 0.95 for test set and 0.7 for the independent dataset. We hypothesize that the developed model can further be used to identify potentially active anti-hepatitis peptides with a high level of reliability.

  19. A heuristic reference recursive recipe for adaptively tuning the ...

    Indian Academy of Sciences (India)

    Keywords. Adaptive EKF; longitudinal and lateral flight dynamics; recursive parameter estimation; Cramer Rao bound. Abstract. In part-1 of this paper an adaptive filtering based on a reference recursive recipe (RRR) was developed and tested on a simulated dynamics of a spring, mass and damper with a weak nonlinear ...

  20. Empirical results and formal approaches to recursion in acquisition.

    NARCIS (Netherlands)

    Hollebrandse, Bartjan; Roeper, Thomas; Speas, Margareth; Roeper, Thomas

    2014-01-01

    We argue that the move from Direct recursion with conjunctive interpretation to Indirect recursion, where the Strong Minimalist Thesis requires that, at Phase boundaries, a semantic interpretation is necessary, provides the blueprint for the acquisition path. We provide an overview of experimental

  1. Recursive smoothers for hidden discrete-time Markov chains

    Directory of Open Access Journals (Sweden)

    Lakhdar Aggoun

    2005-01-01

    Full Text Available We consider a discrete-time Markov chain observed through another Markov chain. The proposed model extends models discussed by Elliott et al. (1995. We propose improved recursive formulae to update smoothed estimates of processes related to the model. These recursive estimates are used to update the parameter of the model via the expectation maximization (EM algorithm.

  2. A recursive approach to mortality-linked derivative pricing

    NARCIS (Netherlands)

    Shang, Z.; Goovaerts, M.; Dhaene, J.

    2011-01-01

    In this paper, we develop a recursive method to derive an exact numerical and nearly analytical representation of the Laplace transform of the transition density function with respect to the time variable for time-homogeneous diffusion processes. We further apply this recursion algorithm to the

  3. The types and categories of Old English recursive compounding

    Directory of Open Access Journals (Sweden)

    Carmen Novo Urraca

    2017-07-01

    Full Text Available This article deals with the recursive compounding of Old English nouns, adjectives, verbs and adverbs. It addresses the question of the textual occurrences of the compounds of Old English by means of a corpus analysis based on the Dictionary of Old English Corpus. The data of qualitative analysis have been retrieved from the lexical database of Old English Nerthus. The analysis shows that the nominal, adjectival and adverbial compounds of Old English can be recursive. Nominal compounding allows double recursivity, whereas adjectival and adverbial compounding do not. The conclusion is reached that both the type and token frequencies of recursive compounds are very low; and recursive compounds from the adjectival class are more exocentric as regards categorisation.

  4. Effect of tree nuts on glycemic control in diabetes: a systematic review and meta-analysis of randomized controlled dietary trials.

    Directory of Open Access Journals (Sweden)

    Effie Viguiliouk

    Full Text Available Tree nut consumption has been associated with reduced diabetes risk, however, results from randomized trials on glycemic control have been inconsistent.To provide better evidence for diabetes guidelines development, we conducted a systematic review and meta-analysis of randomized controlled trials to assess the effects of tree nuts on markers of glycemic control in individuals with diabetes.MEDLINE, EMBASE, CINAHL, and Cochrane databases through 6 April 2014.Randomized controlled trials ≥3 weeks conducted in individuals with diabetes that compare the effect of diets emphasizing tree nuts to isocaloric diets without tree nuts on HbA1c, fasting glucose, fasting insulin, and HOMA-IR.Two independent reviewer's extracted relevant data and assessed study quality and risk of bias. Data were pooled by the generic inverse variance method and expressed as mean differences (MD with 95% CI's. Heterogeneity was assessed (Cochran Q-statistic and quantified (I2.Twelve trials (n = 450 were included. Diets emphasizing tree nuts at a median dose of 56 g/d significantly lowered HbA1c (MD = -0.07% [95% CI:-0.10, -0.03%]; P = 0.0003 and fasting glucose (MD = -0.15 mmol/L [95% CI: -0.27, -0.02 mmol/L]; P = 0.03 compared with control diets. No significant treatment effects were observed for fasting insulin and HOMA-IR, however the direction of effect favoured tree nuts.Majority of trials were of short duration and poor quality.Pooled analyses show that tree nuts improve glycemic control in individuals with type 2 diabetes, supporting their inclusion in a healthy diet. Owing to the uncertainties in our analyses there is a need for longer, higher quality trials with a focus on using nuts to displace high-glycemic index carbohydrates.ClinicalTrials.gov NCT01630980.

  5. Recursive recovery of Markov transition probabilities from boundary value data

    Energy Technology Data Exchange (ETDEWEB)

    Patch, Sarah Kathyrn [Univ. of California, Berkeley, CA (United States)

    1994-04-01

    In an effort to mathematically describe the anisotropic diffusion of infrared radiation in biological tissue Gruenbaum posed an anisotropic diffusion boundary value problem in 1989. In order to accommodate anisotropy, he discretized the temporal as well as the spatial domain. The probabilistic interpretation of the diffusion equation is retained; radiation is assumed to travel according to a random walk (of sorts). In this random walk the probabilities with which photons change direction depend upon their previous as well as present location. The forward problem gives boundary value data as a function of the Markov transition probabilities. The inverse problem requires finding the transition probabilities from boundary value data. Problems in the plane are studied carefully in this thesis. Consistency conditions amongst the data are derived. These conditions have two effects: they prohibit inversion of the forward map but permit smoothing of noisy data. Next, a recursive algorithm which yields a family of solutions to the inverse problem is detailed. This algorithm takes advantage of all independent data and generates a system of highly nonlinear algebraic equations. Pluecker-Grassmann relations are instrumental in simplifying the equations. The algorithm is used to solve the 4 x 4 problem. Finally, the smallest nontrivial problem in three dimensions, the 2 x 2 x 2 problem, is solved.

  6. A step-indexed Kripke model of hidden state via recursive properties on recursively defined metric spaces

    DEFF Research Database (Denmark)

    Birkedal, Lars; Schwinghammer, Jan; Støvring, Kristian

    2010-01-01

    for Chargu´eraud and Pottier’s type and capability system including frame and anti-frame rules, based on the operational semantics and step-indexed heap relations. The worlds are constructed as a recursively defined predicate on a recursively defined metric space, which provides a considerably simpler...

  7. A step-indexed Kripke model of hidden state via recursive properties on recursively defined metric spaces

    DEFF Research Database (Denmark)

    Schwinghammer, Jan; Birkedal, Lars; Støvring, Kristian

    2011-01-01

    ´eraud and Pottier’s type and capability system including both frame and anti-frame rules. The model is a possible worlds model based on the operational semantics and step-indexed heap relations, and the worlds are constructed as a recursively defined predicate on a recursively defined metric space. We also extend...

  8. Recursion Versus Replication in Simple Cryptographic Protocols

    DEFF Research Database (Denmark)

    Hüttel, Hans; Srba, Jiri

    2005-01-01

    's spectrum, become undecidable for a very simple recursive extension of the protocol. The result holds even if no nondeterministic choice operator is allowed. We also show that the extended calculus is capable of an implicit description of the active intruder, including full analysis and synthesis...... of messages in the sense of Amadio, Lugiez and Vanackere. We conclude by showing that reachability analysis for a replicative variant of the protocol becomes decidable.......We use some very recent techniques from process algebra to draw interesting conclusions about the well studied class of ping-pong protocols introduced by Dolev and Yao. In particular we show that all nontrivial properties, including reachability and equivalence checking wrt. the whole van Glabbeek...

  9. Detecting recursive and nonrecursive filters using chaos.

    Science.gov (United States)

    Carroll, T L

    2010-03-01

    Filtering a chaotic signal through a recursive [or infinite impulse response (IIR)] filter has been shown to increase the dimension of chaos under certain conditions. Filtering with a nonrecursive [or finite impulse response (FIR)] filter should not increase dimension, but it has been shown that if the FIR filter has a long tail, measurements of actual signals may appear to show a dimension increase. I simulate IIR and FIR filters that correspond to naturally occurring resonant objects, and I show that using dimension measurements, I can distinguish the filter type. These measurements could be used to detect resonances using radar, sonar, or laser signals, or to determine if a resonance is due to an IIR or an FIR filter.

  10. A recursive approach to prony parameter estimation

    Science.gov (United States)

    Davies, P.

    1983-08-01

    The Prony series method of fitting a series of complex exponentials to a time series can be applied to many acoustic and vibration signals. For example, in the analysis of a structure's response to transient excitation the Prony series method can be used to find the natural frequencies, damping ratios, amplitudes and relative phases of the modes of the structure. One of the main problems with this method is the need to calculate and invert matrices. In this paper an algorithm that combines the Prony series method with the recursive least squares algorithm is described. This eliminates the need to invert any matrices and also requires only part of the data to be available at one particular time. The method is applied to analyze a simulated structure's response and also to analyze the response of a beam to transient excitation.

  11. Online damage detection using recursive principal component analysis and recursive condition indicators

    Science.gov (United States)

    Krishnan, M.; Bhowmik, B.; Tiwari, A. K.; Hazra, B.

    2017-08-01

    In this paper, a novel baseline free approach for continuous online damage detection of multi degree of freedom vibrating structures using recursive principal component analysis (RPCA) in conjunction with online damage indicators is proposed. In this method, the acceleration data is used to obtain recursive proper orthogonal modes in online using the rank-one perturbation method, and subsequently utilized to detect the change in the dynamic behavior of the vibrating system from its pristine state to contiguous linear/nonlinear-states that indicate damage. The RPCA algorithm iterates the eigenvector and eigenvalue estimates for sample covariance matrices and new data point at each successive time instants, using the rank-one perturbation method. An online condition indicator (CI) based on the L2 norm of the error between actual response and the response projected using recursive eigenvector matrix updates over successive iterations is proposed. This eliminates the need for offline post processing and facilitates online damage detection especially when applied to streaming data. The proposed CI, named recursive residual error, is also adopted for simultaneous spatio-temporal damage detection. Numerical simulations performed on five-degree of freedom nonlinear system under white noise and El Centro excitations, with different levels of nonlinearity simulating the damage scenarios, demonstrate the robustness of the proposed algorithm. Successful results obtained from practical case studies involving experiments performed on a cantilever beam subjected to earthquake excitation, for full sensors and underdetermined cases; and data from recorded responses of the UCLA Factor building (full data and its subset) demonstrate the efficacy of the proposed methodology as an ideal candidate for real-time, reference free structural health monitoring.

  12. Syntactic Recursion Facilitates and Working Memory Predicts Recursive Theory of Mind.

    Directory of Open Access Journals (Sweden)

    Burcu Arslan

    Full Text Available In this study, we focus on the possible roles of second-order syntactic recursion and working memory in terms of simple and complex span tasks in the development of second-order false belief reasoning. We tested 89 Turkish children in two age groups, one younger (4;6-6;5 years and one older (6;7-8;10 years. Although second-order syntactic recursion is significantly correlated with the second-order false belief task, results of ordinal logistic regressions revealed that the main predictor of second-order false belief reasoning is complex working memory span. Unlike simple working memory and second-order syntactic recursion tasks, the complex working memory task required processing information serially with additional reasoning demands that require complex working memory strategies. Based on our results, we propose that children's second-order theory of mind develops when they have efficient reasoning rules to process embedded beliefs serially, thus overcoming a possible serial processing bottleneck.

  13. Syntactic Recursion Facilitates and Working Memory Predicts Recursive Theory of Mind

    Science.gov (United States)

    Arslan, Burcu; Hohenberger, Annette; Verbrugge, Rineke

    2017-01-01

    In this study, we focus on the possible roles of second-order syntactic recursion and working memory in terms of simple and complex span tasks in the development of second-order false belief reasoning. We tested 89 Turkish children in two age groups, one younger (4;6–6;5 years) and one older (6;7–8;10 years). Although second-order syntactic recursion is significantly correlated with the second-order false belief task, results of ordinal logistic regressions revealed that the main predictor of second-order false belief reasoning is complex working memory span. Unlike simple working memory and second-order syntactic recursion tasks, the complex working memory task required processing information serially with additional reasoning demands that require complex working memory strategies. Based on our results, we propose that children’s second-order theory of mind develops when they have efficient reasoning rules to process embedded beliefs serially, thus overcoming a possible serial processing bottleneck. PMID:28072823

  14. Seeing the forest for the trees: utilizing modified random forests imputation of forest plot data for landscape-level analyses

    Science.gov (United States)

    Karin L. Riley; Isaac C. Grenfell; Mark A. Finney

    2015-01-01

    Mapping the number, size, and species of trees in forests across the western United States has utility for a number of research endeavors, ranging from estimation of terrestrial carbon resources to tree mortality following wildfires. For landscape fire and forest simulations that use the Forest Vegetation Simulator (FVS), a tree-level dataset, or “tree list”, is a...

  15. On the symmetries of some classes of recursive circulant graphs

    Directory of Open Access Journals (Sweden)

    Seyed Morteza Mirafzal

    2014-03-01

    Full Text Available A recursive-circulant $G(n; d$ is defined to be acirculant graph with $n$ vertices and jumps of powers of $d$.$G(n; d$ is vertex-transitive, and has some strong hamiltonianproperties. $G(n; d$ has a recursive structure when $n = cd^m$,$1 leq c < d $ [10]. In this paper, we will find the automorphismgroup of some classes of recursive-circulant graphs. In particular, wewill find that the automorphism group of $G(2^m; 4$ is isomorphicwith the group $D_{2 cdot 2^m}$, the dihedral group of order $2^{m+1}

  16. Spin-orbit coupling a recursion method approach

    CERN Document Server

    Huda, A U; Mookerjee, A; Paudyal, D

    2003-01-01

    Relativistic effects play a significant role in alloys of the heavier elements. The majority of earlier works on alloys had included the scalar relativistic corrections. We present here a methodology to take into account the spin-orbit coupling using the recursion method. The basis used for the representation of the Hamiltonian is the TB-LMTO, since its sparseness is an essential requirement for recursion. The recursion technique can then be extended to augmented space to deal with disordered alloys or rough surfaces.

  17. TREAT (TREe-based Association Test)

    Science.gov (United States)

    TREAT is an R package for detecting complex joint effects in case-control studies. The test statistic is derived from a tree-structure model by recursive partitioning the data. Ultra-fast algorithm is designed to evaluate the significance of association be

  18. Genetic dissection of new genotypes of drumstick tree (Moringa oleifera Lam.) using random amplified polymorphic DNA marker.

    Science.gov (United States)

    Rufai, Shamsuddeen; Hanafi, M M; Rafii, M Y; Ahmad, S; Arolu, I W; Ferdous, Jannatul

    2013-01-01

    The knowledge of genetic diversity of tree crop is very important for breeding and improvement program for the purpose of improving the yield and quality of its produce. Genetic diversity study and analysis of genetic relationship among 20 Moringa oleifera were carried out with the aid of twelve primers from, random amplified polymorphic DNA marker. The seeds of twenty M. oleifera genotypes from various origins were collected and germinated and raised in nursery before transplanting to the field at University Agricultural Park (TPU). Genetic diversity parameter, such as Shannon's information index and expected heterozygosity, revealed the presence of high genetic divergence with value of 1.80 and 0.13 for Malaysian population and 0.30 and 0.19 for the international population, respectively. Mean of Nei's gene diversity index for the two populations was estimated to be 0.20. In addition, a dendrogram constructed, using UPGMA cluster analysis based on Nei's genetic distance, grouped the twenty M. oleifera into five distinct clusters. The study revealed a great extent of variation which is essential for successful breeding and improvement program. From this study, M. oleifera genotypes of wide genetic origin, such as T-01, T-06, M-01, and M-02, are recommended to be used as parent in future breeding program.

  19. Genetic Dissection of New Genotypes of Drumstick Tree (Moringa oleifera Lam. Using Random Amplified Polymorphic DNA Marker

    Directory of Open Access Journals (Sweden)

    Shamsuddeen Rufai

    2013-01-01

    Full Text Available The knowledge of genetic diversity of tree crop is very important for breeding and improvement program for the purpose of improving the yield and quality of its produce. Genetic diversity study and analysis of genetic relationship among 20 Moringa oleifera were carried out with the aid of twelve primers from, random amplified polymorphic DNA marker. The seeds of twenty M. oleifera genotypes from various origins were collected and germinated and raised in nursery before transplanting to the field at University Agricultural Park (TPU. Genetic diversity parameter, such as Shannon's information index and expected heterozygosity, revealed the presence of high genetic divergence with value of 1.80 and 0.13 for Malaysian population and 0.30 and 0.19 for the international population, respectively. Mean of Nei's gene diversity index for the two populations was estimated to be 0.20. In addition, a dendrogram constructed, using UPGMA cluster analysis based on Nei's genetic distance, grouped the twenty M. oleifera into five distinct clusters. The study revealed a great extent of variation which is essential for successful breeding and improvement program. From this study, M. oleifera genotypes of wide genetic origin, such as T-01, T-06, M-01, and M-02, are recommended to be used as parent in future breeding program.

  20. A Recursive Receding Horizon Planning for Unmanned Vehicles

    Data.gov (United States)

    National Aeronautics and Space Administration — This paper proposes a recursive receding horizon path planning algorithm for unmanned vehicles in nonuniform environments. In the proposed algorithm, the map is...

  1. Explicit neural representations, recursive neural networks and conscious visual perception

    National Research Council Canada - National Science Library

    Pollen, Daniel A

    2003-01-01

    ... network remains unresolved. We inquire as to whether recursive processing-by which we mean the combined flow and integrated outcome of afferent and recurrent activity across a series of cortical areas-is essential...

  2. Recursive Formulas for the Characteristic Numbers of Rational Plane Curves

    OpenAIRE

    Ernström, Lars; Kennedy, Gary

    1996-01-01

    We derive recursive equations for the characteristic numbers of rational nodal plane curves with at most one cusp, subject to point conditions, tangent conditions and flag conditions, developing techniques akin to quantum cohomology on a moduli space of stable lifts.

  3. RECURSIVE CONVEYOR PROCESSES - THE MAIN PROPERTIES AND CHARACTERISTICS

    Directory of Open Access Journals (Sweden)

    Boris V. Kupriyanov

    2015-01-01

    Full Text Available In the article the formal model of recursive conveyor processes is considered. The main properties and characteristics ofthis type of processes are described andillustrated. Based on these properties splitting processes into classes is carried out.

  4. Recursion Operators for CBC system with reductions. Geometric theory

    Science.gov (United States)

    Yanovski, A.; Vilasi, G.

    2016-09-01

    We discuss some recent developments of the geometric theory of the Recursion Operators (Generating Operators) for Caudrey-Beals-Coifman systems (CBC systems) on semisimple Lie algebras. As is well known the essence of this interpretation is that the Recursion Operators could be considered as adjoint to Nijenhuis tensors on certain infinite-dimensional manifolds. In particular, we discuss the case when there are Zp reductions of Mikhailov type.

  5. Extended Recursion-Based Formalization of Virus Mutation

    OpenAIRE

    Beaucamps, Philippe

    2008-01-01

    International audience; Computer viruses are programs that can replicate themselves by infecting other programs in a system. Bonfante, Kaczmarek and Marion have recently proposed a classification of viruses which relies on the recursion theory and its recursion theorems. We propose an extension of their formalism to consider in a more practical way the mutation of viruses. In particular, we are interested in modelling any depth of mutation, not just the first two levels. We show that this for...

  6. Using tree diagrams without numerical values in addition to relative numbers improves students' numeracy skills: a randomized study in medical education.

    Science.gov (United States)

    Friederichs, Hendrik; Ligges, Sandra; Weissenstein, Anne

    2014-02-01

    Physicians and medical students may lack sufficient numeracy skills to make treatment decisions, interpret test results, and practice evidence-based medicine. We evaluated whether the use of a tree diagram without numerical values as an aid for numerical processing might improve students' test results when dealing with percentages. A prospective randomized study was carried out with 102 third-year students. Participants received 3 diagnostic test problems and were asked to determine positive predictive values. The information in these tests was expressed either in (1) natural frequencies, (2) conditional probabilities, or (3) conditional probabilities with a tree diagram without numbers. Ninety-eight (96.1%) complete data sets could be obtained. The group working with natural frequencies achieved significantly higher test results (n = 29, mean score: 1.1, P = 0.045) than the group working with conditional probabilities (n = 34, mean score: 0.56). The students who were given a tree diagram in addition to conditional probabilities (n = 35, mean score: 1.26) also achieved significantly better scores than the group with conditional probabilities alone (P = 0.008). The difference between the group who had received natural frequencies and the group working with conditional probabilities and the tree diagram was not significant. We suggest the use of a tree diagram as a visual aid when dealing with diagnostic tests expressed in conditional probabilities.

  7. Recursion to food plants by free-ranging Bornean elephant

    Directory of Open Access Journals (Sweden)

    Megan English

    2015-08-01

    Full Text Available Plant recovery rates after herbivory are thought to be a key factor driving recursion by herbivores to sites and plants to optimise resource-use but have not been investigated as an explanation for recursion in large herbivores. We investigated the relationship between plant recovery and recursion by elephants (Elephas maximus borneensis in the Lower Kinabatangan Wildlife Sanctuary, Sabah. We identified 182 recently eaten food plants, from 30 species, along 14 × 50 m transects and measured their recovery growth each month over nine months or until they were re-browsed by elephants. The monthly growth in leaf and branch or shoot length for each plant was used to calculate the time required (months for each species to recover to its pre-eaten length. Elephant returned to all but two transects with 10 eaten plants, a further 26 plants died leaving 146 plants that could be re-eaten. Recursion occurred to 58% of all plants and 12 of the 30 species. Seventy-seven percent of the re-eaten plants were grasses. Recovery times to all plants varied from two to twenty months depending on the species. Recursion to all grasses coincided with plant recovery whereas recursion to most browsed plants occurred four to twelve months before they had recovered to their previous length. The small sample size of many browsed plants that received recursion and uneven plant species distribution across transects limits our ability to generalise for most browsed species but a prominent pattern in plant-scale recursion did emerge. Plant recovery time was a good predictor of time to recursion but varied as a function of growth form (grass, ginger, palm, liana and woody and differences between sites. Time to plant recursion coincided with plant recovery time for the elephant’s preferred food, grasses, and perhaps also gingers, but not the other browsed species. Elephants are bulk feeders so it is likely that they time their returns to bulk feed on these grass species when

  8. Parallel Recursive State Compression for Free

    NARCIS (Netherlands)

    Laarman, Alfons; van de Pol, Jan Cornelis; Weber, M.

    2011-01-01

    This paper focuses on reducing memory usage in enumerative model checking, while maintaining the multi-core scalability obtained in earlier work. We present a tree-based multi-core compression method, which works by leveraging sharing among sub-vectors of state vectors. An algorithmic analysis of

  9. Effect of Tree Nuts on Glycemic Control in Diabetes: A Systematic Review and Meta-Analysis of Randomized Controlled Dietary Trials

    Science.gov (United States)

    Viguiliouk, Effie; Kendall, Cyril W. C.; Blanco Mejia, Sonia; Cozma, Adrian I.; Ha, Vanessa; Mirrahimi, Arash; Jayalath, Viranda H.; Augustin, Livia S. A.; Chiavaroli, Laura; Leiter, Lawrence A.; de Souza, Russell J.; Jenkins, David J. A.; Sievenpiper, John L.

    2014-01-01

    Background Tree nut consumption has been associated with reduced diabetes risk, however, results from randomized trials on glycemic control have been inconsistent. Objective To provide better evidence for diabetes guidelines development, we conducted a systematic review and meta-analysis of randomized controlled trials to assess the effects of tree nuts on markers of glycemic control in individuals with diabetes. Data Sources MEDLINE, EMBASE, CINAHL, and Cochrane databases through 6 April 2014. Study Selection Randomized controlled trials ≥3 weeks conducted in individuals with diabetes that compare the effect of diets emphasizing tree nuts to isocaloric diets without tree nuts on HbA1c, fasting glucose, fasting insulin, and HOMA-IR. Data Extraction and Synthesis Two independent reviewer’s extracted relevant data and assessed study quality and risk of bias. Data were pooled by the generic inverse variance method and expressed as mean differences (MD) with 95% CI’s. Heterogeneity was assessed (Cochran Q-statistic) and quantified (I2). Results Twelve trials (n = 450) were included. Diets emphasizing tree nuts at a median dose of 56 g/d significantly lowered HbA1c (MD = −0.07% [95% CI:−0.10, −0.03%]; P = 0.0003) and fasting glucose (MD = −0.15 mmol/L [95% CI: −0.27, −0.02 mmol/L]; P = 0.03) compared with control diets. No significant treatment effects were observed for fasting insulin and HOMA-IR, however the direction of effect favoured tree nuts. Limitations Majority of trials were of short duration and poor quality. Conclusions Pooled analyses show that tree nuts improve glycemic control in individuals with type 2 diabetes, supporting their inclusion in a healthy diet. Owing to the uncertainties in our analyses there is a need for longer, higher quality trials with a focus on using nuts to displace high-glycemic index carbohydrates. Trial Registration ClinicalTrials.gov NCT01630980 PMID:25076495

  10. Recursive framework for joint inpainting and de-noising of photographic films.

    Science.gov (United States)

    Subrahmanyam, G R K S; Rajagopalan, A N; Aravind, R

    2010-05-01

    We address the problem of inpainting noisy photographs. We present a recursive image recovery scheme based on the unscented Kalman filter (UKF) to simultaneously inpaint identified damaged portions in an image and suppress film-grain noise. Inpainting of the missing observations is guided by a mask-dependent reconstruction of the image edges. Prediction within the UKF is based on a discontinuity-adaptive Markov random field prior that attempts to preserve edges while achieving noise reduction in uniform regions. We demonstrate the capability of the proposed method with many examples.

  11. The redundancy of recursion and infinity for natural language.

    Science.gov (United States)

    Luuk, Erkki; Luuk, Hendrik

    2011-02-01

    An influential line of thought claims that natural language and arithmetic processing require recursion, a putative hallmark of human cognitive processing (Chomsky in Evolution of human language: biolinguistic perspectives. Cambridge University Press, Cambridge, pp 45-61, 2010; Fitch et al. in Cognition 97(2):179-210, 2005; Hauser et al. in Science 298(5598):1569-1579, 2002). First, we question the need for recursion in human cognitive processing by arguing that a generally simpler and less resource demanding process--iteration--is sufficient to account for human natural language and arithmetic performance. We argue that the only motivation for recursion, the infinity in natural language and arithmetic competence, is equally approachable by iteration and recursion. Second, we submit that the infinity in natural language and arithmetic competence reduces to imagining infinite embedding or concatenation, which is completely independent from the ability to implement infinite processing, and thus, independent from both recursion and iteration. Furthermore, we claim that a property of natural language is physically uncountable finity and not discrete infinity.

  12. A Recursive Solution for Power-Transmission Loss in DC-Powered Networks

    Directory of Open Access Journals (Sweden)

    Sehwan Kim

    2014-11-01

    Full Text Available This article presents a recursive solution to the power-transmission loss in DC-powered networks. In such a network, the load cannot be modeled as a fixed equivalent resistance value, since the switching regulator may draw more or less current based on the actual supply voltage to meet the power demand. Although the power-transmission loss itself is simply I2 RL, I, in turn, depends on the load’s supply voltage, which, in turn, depends on I, making it impossible to derive a closed-form solution by classical resistive network analysis in general. The proposed approach is to first derive a closed-form solution to I in the one-node topology using the quadratic formula. Next, we extend our solution to a locally daisy-chained (LDC network, where the network is readily decomposable into stages, such that the solution combines the closed-form formula for the current stage with the recursive solution for the subsequent stages. We then generalize the LDC topology to trees. In practice, the solution converges quickly after a small number of iterations. It has been validated on real-life networks, such as power over controller area network (PoCAN.

  13. Enumeration of Ancestral Configurations for Matching Gene Trees and Species Trees.

    Science.gov (United States)

    Disanto, Filippo; Rosenberg, Noah A

    2017-09-01

    Given a gene tree and a species tree, ancestral configurations represent the combinatorially distinct sets of gene lineages that can reach a given node of the species tree. They have been introduced as a data structure for use in the recursive computation of the conditional probability under the multispecies coalescent model of a gene tree topology given a species tree, the cost of this computation being affected by the number of ancestral configurations of the gene tree in the species tree. For matching gene trees and species trees, we obtain enumerative results on ancestral configurations. We study ancestral configurations in balanced and unbalanced families of trees determined by a given seed tree, showing that for seed trees with more than one taxon, the number of ancestral configurations increases for both families exponentially in the number of taxa n. For fixed n, the maximal number of ancestral configurations tabulated at the species tree root node and the largest number of labeled histories possible for a labeled topology occur for trees with precisely the same unlabeled shape. For ancestral configurations at the root, the maximum increases with [Formula: see text], where [Formula: see text] is a quadratic recurrence constant. Under a uniform distribution over the set of labeled trees of given size, the mean number of root ancestral configurations grows with [Formula: see text] and the variance with ∼[Formula: see text]. The results provide a contribution to the combinatorial study of gene trees and species trees.

  14. Robust recursive impedance estimation for automotive lithium-ion batteries

    Science.gov (United States)

    Fridholm, Björn; Wik, Torsten; Nilsson, Magnus

    2016-02-01

    Recursive algorithms, such as recursive least squares (RLS) or Kalman filters, are commonly used in battery management systems to estimate the electrical impedance of the battery cell. However, these algorithms can in some cases run into problems with bias and even divergence of the estimates. This article illuminates problems that can arise in the online estimation using recursive methods, and lists modifications to handle these issues. An algorithm is also proposed that estimates the impedance by separating the problem in two parts; one estimating the ohmic resistance with an RLS approach, and another one where the dynamic effects are estimated using an adaptive Kalman filter (AKF) that is novel in the battery field. The algorithm produces robust estimates of ohmic resistance and time constant of the battery cell in closed loop with SoC estimation, as demonstrated by both in simulations and with experimental data from a lithium-ion battery cell.

  15. Recursive modular modelling methodology for lumped-parameter dynamic systems

    Science.gov (United States)

    Orsino, Renato Maia Matarazzo

    2017-08-01

    This paper proposes a novel approach to the modelling of lumped-parameter dynamic systems, based on representing them by hierarchies of mathematical models of increasing complexity instead of a single (complex) model. Exploring the multilevel modularity that these systems typically exhibit, a general recursive modelling methodology is proposed, in order to conciliate the use of the already existing modelling techniques. The general algorithm is based on a fundamental theorem that states the conditions for computing projection operators recursively. Three procedures for these computations are discussed: orthonormalization, use of orthogonal complements and use of generalized inverses. The novel methodology is also applied for the development of a recursive algorithm based on the Udwadia-Kalaba equation, which proves to be identical to the one of a Kalman filter for estimating the state of a static process, given a sequence of noiseless measurements representing the constraints that must be satisfied by the system.

  16. InfoVis Interaction Techniques in Animation of Recursive Programs

    Directory of Open Access Journals (Sweden)

    Antonio Pérez-Carrasco

    2010-02-01

    Full Text Available Algorithm animations typically assist in educational tasks aimed simply at achieving understanding. Potentially, animations could assist in higher levels of cognition, such as the analysis level, but they usually fail in providing this support because they are not flexible or comprehensive enough. In particular, animations of recursion provided by educational systems hardly support the analysis of recursive algorithms. Here we show how to provide full support to the analysis of recursive algorithms. From a technical point of view, animations are enriched with interaction techniques inspired by the information visualization (InfoVis field. Interaction tasks are presented in seven categories, and deal with both static visualizations and dynamic animations. All of these features are implemented in the SRec system, and visualizations generated by SRec are used to illustrate the article.

  17. Parameter Uncertainty for Aircraft Aerodynamic Modeling using Recursive Least Squares

    Science.gov (United States)

    Grauer, Jared A.; Morelli, Eugene A.

    2016-01-01

    A real-time method was demonstrated for determining accurate uncertainty levels of stability and control derivatives estimated using recursive least squares and time-domain data. The method uses a recursive formulation of the residual autocorrelation to account for colored residuals, which are routinely encountered in aircraft parameter estimation and change the predicted uncertainties. Simulation data and flight test data for a subscale jet transport aircraft were used to demonstrate the approach. Results showed that the corrected uncertainties matched the observed scatter in the parameter estimates, and did so more accurately than conventional uncertainty estimates that assume white residuals. Only small differences were observed between batch estimates and recursive estimates at the end of the maneuver. It was also demonstrated that the autocorrelation could be reduced to a small number of lags to minimize computation and memory storage requirements without significantly degrading the accuracy of predicted uncertainty levels.

  18. Pseudocode Interpreter (Pseudocode Integrated Development Environment with Lexical Analyzer and Syntax Analyzer using Recursive Descent Parsing Algorithm

    Directory of Open Access Journals (Sweden)

    Christian Lester D. Gimeno

    2017-11-01

    Full Text Available –This research study focused on the development of a software that helps students design, write, validate and run their pseudocode in a semi Integrated Development Environment (IDE instead of manually writing it on a piece of paper.Specifically, the study aimed to develop lexical analyzer or lexer, syntax analyzer or parser using recursive descent parsing algorithm and an interpreter. The lexical analyzer reads pseudocodesource in a sequence of symbols or characters as lexemes.The lexemes are then analyzed by the lexer that matches a pattern for valid tokens and passes to the syntax analyzer or parser. The syntax analyzer or parser takes those valid tokens and builds meaningful commands using recursive descent parsing algorithm in a form of an abstract syntax tree. The generation of an abstract syntax tree is based on the specified grammar rule created by the researcher expressed in Extended Backus-Naur Form. The Interpreter takes the generated abstract syntax tree and starts the evaluation or interpretation to produce pseudocode output. The software was evaluated using white-box testing by several ICT professionals and black-box testing by several computer science students based on the International Organization for Standardization (ISO 9126 software quality standards. The overall results of the evaluation both for white-box and black-box were described as “Excellent in terms of functionality, reliability, usability, efficiency, maintainability and portability”.

  19. Recursion relations and branching rules for simple Lie algebras

    CERN Document Server

    Lyakhovsky, V D

    1995-01-01

    The branching rules between simple Lie algebras and its regular (maximal) simple subalgebras are studied. Two types of recursion relations for anomalous relative multiplicities are obtained. One of them is proved to be the factorized version of the other. The factorization property is based on the existence of the set of weights \\Gamma specific for each injection. The structure of \\Gamma is easily deduced from the correspondence between the root systems of algebra and subalgebra. The recursion relations thus obtained give rise to simple and effective algorithm for branching rules. The details are exposed by performing the explicit decomposition procedure for A_{3} \\oplus u(1) \\rightarrow B_{4} injection.

  20. A Decidable Recursive Logic for Weighted Transition Systems

    DEFF Research Database (Denmark)

    Xue, Bingtian; Larsen, Kim Guldstrand; Mardare, Radu Iulian

    2014-01-01

    In this paper we develop and study the Recursive Weighted Logic (RWL), a multi-modal logic that expresses qualitative and quantitative properties of labelled weighted transition systems (LWSs). LWSs are transition systems labelled with actions and real-valued quantities representing the costs...... satisfied by the recursive variables. We prove that unlike in the case of the timed logics, the satisfiability problem for RWL is decidable. The proof uses a variant of the region construction technique used in literature with timed automata, which we adapt to the specific settings of RWL. This paper...

  1. A decoupled recursive approach for constrained flexible multibody system dynamics

    Science.gov (United States)

    Lai, Hao-Jan; Kim, Sung-Soo; Haug, Edward J.; Bae, Dae-Sung

    1989-01-01

    A variational-vector calculus approach is employed to derive a recursive formulation for dynamic analysis of flexible multibody systems. Kinematic relationships for adjacent flexible bodies are derived in a companion paper, using a state vector notation that represents translational and rotational components simultaneously. Cartesian generalized coordinates are assigned for all body and joint reference frames, to explicitly formulate deformation kinematics under small deformation kinematics and an efficient flexible dynamics recursive algorithm is developed. Dynamic analysis of a closed loop robot is performed to illustrate efficiency of the algorithm.

  2. Predicting depression outcome in mental health treatment: a recursive partitioning analysis.

    Science.gov (United States)

    Berman, Margit I; Hegel, Mark T

    2014-01-01

    Recursive partitioning was applied to a longitudinal dataset of outpatient mental health clinic patients to identify empirically factors and interactions among factors that best predicted clinical improvement and deterioration in symptoms of depression across treatment. Sixty-two variables drawn from an initial patient survey and from chart review were included as covariates in the analysis, representing nearly all of the demographic, treatment, symptom, diagnostic, and social history information obtained from patients at their initial evaluations. Trees estimated the probability of participants' having depression at their last assessment, improving to a clinically significant degree during treatment, or developing a new onset of significant depressive symptoms during treatment. Initial pain, the presence of anxiety, and a history of multiple types of abuse were risk factors for poorer outcome, even among patients who did not initially have significant depressive symptoms. By examining multiple-related outcomes, we were able to create a series of overlapping models that revealed important predictors across trees. Limitations of the study included the lack of cross-validation of the trees and the exploratory nature of the analysis.

  3. Real-time recursive hyperspectral sample and band processing algorithm architecture and implementation

    CERN Document Server

    Chang, Chein-I

    2017-01-01

    This book explores recursive architectures in designing progressive hyperspectral imaging algorithms. In particular, it makes progressive imaging algorithms recursive by introducing the concept of Kalman filtering in algorithm design so that hyperspectral imagery can be processed not only progressively sample by sample or band by band but also recursively via recursive equations. This book can be considered a companion book of author’s books, Real-Time Progressive Hyperspectral Image Processing, published by Springer in 2016. Explores recursive structures in algorithm architecture Implements algorithmic recursive architecture in conjunction with progressive sample and band processing Derives Recursive Hyperspectral Sample Processing (RHSP) techniques according to Band-Interleaved Sample/Pixel (BIS/BIP) acquisition format Develops Recursive Hyperspectral Band Processing (RHBP) techniques according to Band SeQuential (BSQ) acquisition format for hyperspectral data.

  4. On the Number of Non-equivalent Ancestral Configurations for Matching Gene Trees and Species Trees.

    Science.gov (United States)

    Disanto, Filippo; Rosenberg, Noah A

    2017-09-14

    An ancestral configuration is one of the combinatorially distinct sets of gene lineages that, for a given gene tree, can reach a given node of a specified species tree. Ancestral configurations have appeared in recursive algebraic computations of the conditional probability that a gene tree topology is produced under the multispecies coalescent model for a given species tree. For matching gene trees and species trees, we study the number of ancestral configurations, considered up to an equivalence relation introduced by Wu (Evolution 66:763-775, 2012) to reduce the complexity of the recursive probability computation. We examine the largest number of non-equivalent ancestral configurations possible for a given tree size n. Whereas the smallest number of non-equivalent ancestral configurations increases polynomially with n, we show that the largest number increases with [Formula: see text], where k is a constant that satisfies [Formula: see text]. Under a uniform distribution on the set of binary labeled trees with a given size n, the mean number of non-equivalent ancestral configurations grows exponentially with n. The results refine an earlier analysis of the number of ancestral configurations considered without applying the equivalence relation, showing that use of the equivalence relation does not alter the exponential nature of the increase with tree size.

  5. Metric pomset semantics for a concurrent language with recursion

    NARCIS (Netherlands)

    J.W. de Bakker (Jaco); J.H.A. Warmerdam

    1990-01-01

    textabstractWe study the semantics of a simple language with concurrency and recursion. Our semantic domain consists of (sets of) finite and infinite partially ordered multisets (pomsets) in order to model true concurrency (i.e. noninterleaved parallel execution). It will be shown that the set of

  6. Recursion relations for Hylleraas three-electron integral

    OpenAIRE

    Pachucki, Krzysztof; Puchalski, Mariusz; Remiddi, Ettore

    2004-01-01

    Recursion relations for Hylleraas three-electron integral are obtained in a closed form by using integration by parts identities. Numerically fast and well stable algorithm for the calculation of the integral with high powers of inter-electronic coordinates is presented.

  7. Structure preserving transformations on non-left-recursive grammars

    NARCIS (Netherlands)

    Maurer, H.A.; Nijholt, Antinus

    We will be concerned with grammar covers, The first part of this paper presents a general framework for covers. The second part introduces a transformation from nonleft-recursive grammars to grammars in Greibach normal form. An investigation of the structure preserving properties of this

  8. Normal form in DI-algebra with recursion

    NARCIS (Netherlands)

    Lucassen, PG; Polak, [No Value; Udding, JT

    1997-01-01

    DI-algebra is a process algebra for delay-insensitive processes. Like in most process algebras, a normal form for finite expressions can be defined. Unlike most process algebras, however we show that we can also define a normal form for recursive expressions. This is done by first eliminating

  9. Efficient Integrity Checking for Databases with Recursive Views

    DEFF Research Database (Denmark)

    Martinenghi, Davide; Christiansen, Henning

    2005-01-01

    into incremental and optimized tests specialized for given update patterns. These tests may involve the introduction of new views, but for relevant cases of recursion, simplified integrity constraints are obtained that can be checked more efficiently than the original ones and without auxiliary views. Notably...

  10. Aggressive periodontitis defined by recursive partitioning analysis of immunologic factors

    NARCIS (Netherlands)

    Papantonopoulos, G.H.; Takahashi, K.; Bountis, T.; Loos, B.G.

    2013-01-01

    Background: The present study aims to extend recent findings of a non-linear model of the progression of periodontitis supporting the notion that aggressive periodontitis (AgP) and chronic periodontitis (CP) are distinct clinical entities. This approach is based on the implementation of recursive

  11. Safe Recursion on Notation into a Light Logic by Levels

    Directory of Open Access Journals (Sweden)

    Luca Roversi

    2010-05-01

    Full Text Available We embed Safe Recursion on Notation (SRN into Light Affine Logic by Levels (LALL, derived from the logic L4. LALL is an intuitionistic deductive system, with a polynomial time cut elimination strategy. The embedding allows to represent every term t of SRN as a family of proof nets |t|^l in LALL. Every proof net |t|^l in the family simulates t on arguments whose bit length is bounded by the integer l. The embedding is based on two crucial features. One is the recursive type in LALL that encodes Scott binary numerals, i.e. Scott words, as proof nets. Scott words represent the arguments of t in place of the more standard Church binary numerals. Also, the embedding exploits the "fuzzy" borders of paragraph boxes that LALL inherits from L4 to "freely" duplicate the arguments, especially the safe ones, of t. Finally, the type of |t|^l depends on the number of composition and recursion schemes used to define t, namely the structural complexity of t. Moreover, the size of |t|^l is a polynomial in l, whose degree depends on the structural complexity of t. So, this work makes closer both the predicative recursive theoretic principles SRN relies on, and the proof theoretic one, called /stratification/, at the base of Light Linear Logic.

  12. Symbolic Reachability for Process Algebras with Recursive Data Types

    NARCIS (Netherlands)

    Blom, Stefan; van de Pol, Jan Cornelis; Fitzgerald, J.S.; Haxthausen, A.E.; Yenigun, H.

    2008-01-01

    In this paper, we present a symbolic reachability algorithm for process algebras with recursive data types. Like the various saturation based algorithms of Ciardo et al, the algorithm is based on partitioning of the transition relation into events whose influence is local. As new features, our

  13. Recursive Frame Analysis: A Practitioner's Tool for Mapping Therapeutic Conversation

    Science.gov (United States)

    Keeney, Hillary; Keeney, Bradford; Chenail, Ronald J.

    2012-01-01

    Recursive frame analysis (RFA), both a practical therapeutic tool and an advanced qualitative research method that maps the structure of therapeutic conversation, is introduced with a clinical case vignette. We present and illustrate a means of mapping metaphorical themes that contextualize the performance taking place in the room, recursively…

  14. 3D - RECURSIVELY SCANS IMAGING SYSTEM WITH COMPUTER MATHEMATICS

    Directory of Open Access Journals (Sweden)

    I. Lazurchak

    2013-08-01

    Full Text Available In this paper the algorithm for constructing the N-dimensional recursive Peano scans. Driven by their two-dimensional and three-dimensional realization of a system of computer mathematics Mathematica 7.0. We are discussing the issue of reduction of the multidimensional space to one-dimensional in the calculation of multiple integrals.

  15. Recursions for characteristic numbers of genus one plane curves

    OpenAIRE

    Vakil, Ravi

    2001-01-01

    Characteristic numbers of families of maps of nodal curves to P2 are defined as intersection of natural divisor classes. (This definition agrees with the usual definition for families of plane curves.) Simple recursions for characteristic numbers of genus one plane curves of all degrees are computed.

  16. Gromov-Witten theory and spectral curve topological recursion

    NARCIS (Netherlands)

    Dunin-Barkovskiy, P.

    2015-01-01

    Gromov-Witten theory and spectral curve topological recursion are important parts of modern algebraic geometry and mathematical physics. In my thesis I study relations between these theories and some important new aspects and applications of them. In particular, a construction for a local spectral

  17. Step-indexed Kripke models over recursive worlds

    DEFF Research Database (Denmark)

    Birkedal, Lars; Reus, Bernhard; Schwinghammer, Jan

    2011-01-01

    worlds that are recursively defined in a category of metric spaces. In this paper, we broaden the scope of this technique from the original domain-theoretic setting to an elementary, operational one based on step indexing. The resulting method is widely applicable and leads to simple, succinct models...

  18. EVALUATION OF SOME PRODUCTION CHARACTERISTICS OF RECURSIVE CONVEYOR

    Directory of Open Access Journals (Sweden)

    Boris V. Kupriyanov

    2016-01-01

    Full Text Available We consider the two objectives of direct relevance to operational planning based on the model of recursive conveyor process. Calculate the Critical Operation of the conveyor and calculate the Load Factor of the equipment of the conveyor. 

  19. A metric model of lambda calculus with guarded recursion

    DEFF Research Database (Denmark)

    Birkedal, Lars; Schwinghammer, Jan; Støvring, Kristian

    2010-01-01

    We give a model for Nakano’s typed lambda calculus with guarded recursive definitions in a category of metric spaces. By proving a computational adequacy result that relates the interpretation with the operational semantics, we show that the model can be used to reason about contextual equivalence....

  20. A recursive construction of noiseless subsystem for qudits

    Science.gov (United States)

    Güngördü, Utkan; Li, Chi-Kwong; Nakahara, Mikio; Poon, Yiu-Tung; Sze, Nung-Sing

    2014-03-01

    The noiseless subsystem is a method of using the inherent permutation symmetry of the noise to protect a subsystem against errors. Its construction becomes a formidable task with the growing number of qudits. In this work, we describe a recursive way of constructing noiseless subsystem for qudits, that is robust against collective noise of the form W⊗n, where n is the number of qudits and W is the Kraus operator acting on a single site. This kind of error appears when the wavelength of an environmental disturbance is much larger than the size of the quantum system, which makes it natural to assume all the qubits in the register suffer from the same error operator. The presented recursive scheme is a direct generalization of the recursive scheme described in Phys. Rev. A,84, (2011) 044301 for qubits. We show that the quantum error correction rate, i.e., the ratio of correctable qudits and the number of transmitted qudits, approaches 1 / d as n goes to infinity in this recursive scheme. UG is grateful to JSPS (Japan Society for the Promotion of Science) for partial support from Grant-in-Aid for Scientifc Research (Grant Nos. 23540470 and 24320008). UG acknowledges the financial support of the MEXT.

  1. Theory of Mind, linguistic recursion and autism spectrum disorder

    DEFF Research Database (Denmark)

    Polyanskaya, Irina; Blackburn, Patrick Rowan; Braüner, Torben

    2017-01-01

    In this paper we give the motivation for and discuss the design of an experiment investigating whether the acquisition of linguistic recur-sion helps children with Autism Spectrum Disorder (ASD) develop second-order false belief skills. We first present the relevant psycho-logical concepts (in...

  2. Clustering, Randomness, and Regularity: Spatial Distributions and Human Performance on the Traveling Salesperson Problem and Minimum Spanning Tree Problem

    Science.gov (United States)

    Dry, Matthew J.; Preiss, Kym; Wagemans, Johan

    2012-01-01

    We investigated human performance on the Euclidean Traveling Salesperson Problem (TSP) and Euclidean Minimum Spanning Tree Problem (MST-P) in regards to a factor that has previously received little attention within the literature: the spatial distributions of TSP and MST-P stimuli. First, we describe a method for quantifying the relative degree of…

  3. A note on the multiple-recursive matrix method for generating pseudorandom vectors

    OpenAIRE

    Bishoi, Susil Kumar; Haran, Himanshu Kumar; Hasan, Sartaj Ul

    2016-01-01

    The multiple-recursive matrix method for generating pseudorandom vectors was introduced by Niederreiter (Linear Algebra Appl. 192 (1993), 301-328). We propose an algorithm for finding an efficient primitive multiple-recursive matrix method. Moreover, for improving the linear complexity, we introduce a tweak on the contents of the primitive multiple-recursive matrix method.

  4. A Robust Recursive Filter for Nonlinear Systems with Correlated Noises, Packet Losses, and Multiplicative Noises

    Directory of Open Access Journals (Sweden)

    Hua-Ming Qian

    2014-01-01

    Full Text Available A robust filtering problem is formulated and investigated for a class of nonlinear systems with correlated noises, packet losses, and multiplicative noises. The packet losses are assumed to be independent Bernoulli random variables. The multiplicative noises are described as random variables with bounded variance. Different from the traditional robust filter based on the assumption that the process noises are uncorrelated with the measurement noises, the objective of the addressed robust filtering problem is to design a recursive filter such that, for packet losses and multiplicative noises, the state prediction and filtering covariance matrices have the optimized upper bounds in the case that there are correlated process and measurement noises. Two examples are used to illustrate the effectiveness of the proposed filter.

  5. An investigation of a manipulative simulation in the learning of recursive programming

    Science.gov (United States)

    Bower, Randall Wayne

    Recursion is a fundamentally important topic in computer science. Even so, it is often omitted in introductory courses, or discussed only briefly. This is likely due, at least in part, to the fact that teaching recursion has been difficult. Perhaps the biggest problem in teaching recursion is that there are few, if any, naturally existing examples of recursion in our lives. However, successful simulations have shown that the computer may hold the key to solving this problem. A simulation of recursion presented to students before formal classroom instruction can provide a foundation of concrete experiences to build upon. The challenge is to develop an appropriate simulation and lesson plan for introducing recursion to students early in their programming experience. This research reviews previous attempts at teaching recursion, including detailed lesson plans, mental models of recursion, and other simulations. Then, a new simulation and lesson plan for its use are described. The effectiveness of the simulation is studied using two groups of students enrolled in a college-level, introductory programming course. Results indicate that students who used the simulation as their first exposure to recursion gained a deeper understanding of recursion than students receiving a lecture-based introduction to recursion. Specifically, students who used the simulation required fewer attempts to complete a set of recursive programming exercises and performed better on a follow-up exam given six weeks after the experiment. This research concludes with a discussion of two important questions: How should students think about recursion and how do they think about recursion. The simulation's strengths and shortcomings in fostering effective ways of thinking about recursion are also discussed.

  6. Time-Bounded Reachability in Tree-Structured QBDs by Abstraction

    NARCIS (Netherlands)

    Klink, Daniel; Remke, Anne Katharina Ingrid; Haverkort, Boudewijn R.H.M.; Katoen, Joost P.

    This paper studies quantitative model checking of infinite tree-like (continuous-time) Markov chains. These tree-structured quasi-birth death processes are equivalent to probabilistic pushdown automata and recursive Markov chains and are widely used in the field of performance evaluation. We

  7. Time-bounded reachability in tree-structured QBDs by abstraction

    NARCIS (Netherlands)

    Klink, Daniel; Remke, Anne Katharina Ingrid; Haverkort, Boudewijn R.H.M.; Katoen, Joost P.

    This paper studies quantitative model checking of infinite tree-like (continuous-time) Markov chains. These tree-structured quasi-birth death processes are equivalent to probabilistic pushdown automata and recursive Markov chains and are widely used in the field of performance evaluation. We

  8. RMSE-ELM: Recursive Model Based Selective Ensemble of Extreme Learning Machines for Robustness Improvement

    Directory of Open Access Journals (Sweden)

    Bo Han

    2014-01-01

    Full Text Available For blended data, the robustness of extreme learning machine (ELM is so weak because the coefficients (weights and biases of hidden nodes are set randomly and the noisy data exert a negative effect. To solve this problem, a new framework called “RMSE-ELM” is proposed in this paper. It is a two-layer recursive model. In the first layer, the framework trains lots of ELMs in different ensemble groups concurrently and then employs selective ensemble approach to pick out an optimal set of ELMs in each group, which can be merged into a large group of ELMs called candidate pool. In the second layer, selective ensemble approach is recursively used on candidate pool to acquire the final ensemble. In the experiments, we apply UCI blended datasets to confirm the robustness of our new approach in two key aspects (mean square error and standard deviation. The space complexity of our method is increased to some degree, but the result has shown that RMSE-ELM significantly improves robustness with a rapid learning speed compared to representative methods (ELM, OP-ELM, GASEN-ELM, GASEN-BP, and E-GASEN. It becomes a potential framework to solve robustness issue of ELM for high-dimensional blended data in the future.

  9. Explaining computation of predictive values: 2 × 2 table versus frequency tree. A randomized controlled trial [ISRCTN74278823

    Directory of Open Access Journals (Sweden)

    Berger Jürgen

    2004-08-01

    Full Text Available Abstract Background Involving patients in decision making on diagnostic procedures requires a basic level of statistical thinking. However, innumeracy is prevalent even among physicians. In medical teaching the 2 × 2 table is widely used as a visual help for computations whereas in psychology the frequency tree is favoured. We assumed that the 2 × 2 table is more suitable to support computations of predictive values. Methods 184 students without prior statistical training were randomised either to a step-by-step self-learning tutorial using the 2 × 2 table (n = 94 or the frequency tree (n = 90. During the training session students were instructed by two sample tasks and a total of five positive predictive values had to be computed. During a follow-up session 4 weeks later participants had to compute 5 different tasks of comparable degree of difficulty without having the tutorial instructions at their disposal. The primary outcome was the correct solution of the tasks. Results There were no statistically significant differences between the two groups. About 58% achieved correct solutions in 4–5 tasks following the training session and 26% in the follow-up examination. Conclusions These findings do not support the hypothesis that the 2 × 2 table is more valuable to facilitate the calculation of positive predictive values than the frequency tree.

  10. Explaining computation of predictive values: 2 x 2 table versus frequency tree. A randomized controlled trial [ISRCTN74278823].

    Science.gov (United States)

    Steckelberg, Anke; Balgenorth, Andrea; Berger, Jürgen; Mühlhauser, Ingrid

    2004-08-10

    Involving patients in decision making on diagnostic procedures requires a basic level of statistical thinking. However, innumeracy is prevalent even among physicians. In medical teaching the 2 x 2 table is widely used as a visual help for computations whereas in psychology the frequency tree is favoured. We assumed that the 2 x 2 table is more suitable to support computations of predictive values. 184 students without prior statistical training were randomised either to a step-by-step self-learning tutorial using the 2 x 2 table (n = 94) or the frequency tree (n = 90). During the training session students were instructed by two sample tasks and a total of five positive predictive values had to be computed. During a follow-up session 4 weeks later participants had to compute 5 different tasks of comparable degree of difficulty without having the tutorial instructions at their disposal. The primary outcome was the correct solution of the tasks. There were no statistically significant differences between the two groups. About 58% achieved correct solutions in 4-5 tasks following the training session and 26% in the follow-up examination. These findings do not support the hypothesis that the 2 x 2 table is more valuable to facilitate the calculation of positive predictive values than the frequency tree.

  11. Intensional type theory with guarded recursive types qua fixed points on universes

    DEFF Research Database (Denmark)

    Møgelberg, Rasmus Ejlers; Birkedal, Lars

    2013-01-01

    points of guarded recursive functions. Guarded recursive types can be formed simply by taking fixed points of guarded recursive functions on the universe of types. Moreover, we present a general model construction for constructing models of the intensional type theory with guarded recursive functions...... and types. When applied to the groupoid model of intensional type theory with the universe of small discrete groupoids, the construction gives a model of guarded recursion for which there is a one-to-one correspondence between fixed points of functions on the universe of types and fixed points of (suitable...

  12. Intensional Type Theory with Guarded Recursive Types qua Fixed Points on Universes

    DEFF Research Database (Denmark)

    Birkedal, Lars; Mogelberg, R.E.

    2013-01-01

    points of guarded recursive functions. Guarded recursive types can be formed simply by taking fixed points of guarded recursive functions on the universe of types. Moreover, we present a general model construction for constructing models of the intensional type theory with guarded recursive functions...... and types. When applied to the groupoid model of intensional type theory with the universe of small discrete groupoids, the construction gives a model of guarded recursion for which there is a one-to-one correspondence between fixed points of functions on the universe of types and fixed points of (suitable...

  13. Teaching and learning recursive programming: a review of the research literature

    Science.gov (United States)

    McCauley, Renée; Grissom, Scott; Fitzgerald, Sue; Murphy, Laurie

    2015-01-01

    Hundreds of articles have been published on the topics of teaching and learning recursion, yet fewer than 50 of them have published research results. This article surveys the computing education research literature and presents findings on challenges students encounter in learning recursion, mental models students develop as they learn recursion, and best practices in introducing recursion. Effective strategies for introducing the topic include using different contexts such as recurrence relations, programming examples, fractal images, and a description of how recursive methods are processed using a call stack. Several studies compared the efficacy of introducing iteration before recursion and vice versa. The paper concludes with suggestions for future research into how students learn and understand recursion, including a look at the possible impact of instructor attitude and newer pedagogies.

  14. ETHICS AND KNOWLEDGE OF RECURSIVITY IN PSYCHOLOGISTS TRAINING

    Directory of Open Access Journals (Sweden)

    Ramón Sanz Ferramola

    2008-07-01

    Full Text Available This work deals with the characterization of psychology as a science and profession. Thisfeature is part of the Argentine academic tradition which goes from the origins of psychology as an undergraduate program by the end of the 1950s to the present day. In relation to this topic, four issues are analysed: a the knowledges of psychology showing the necessity of two epistemic dimensions closely related, namely the discursivity and recursivity, or knowledge and metaknowledge, b the role of psychology as a profession within the praxis, rather than in the poiesis, according to the Greek distinction between the implications of these two modalities of the “doing”, c the concurrence and difference of ethics and deontology, their roles, bounds and potentialities within the psychological field in general, and that of scientific-professional morality in particular, and d the definition and characterization of ethics and epistemology as knowledge of recursivity in psychologists’ training.

  15. On a (2,2-rational recursive sequence

    Directory of Open Access Journals (Sweden)

    Azza K. Khalifa

    2005-09-01

    Full Text Available We investigate the asymptotic behavior of the recursive difference equation yn+1=(α+βyn/(1+yn−1 when the parameters α<0 and β∈ℝ. In particular, we establish the boundedness and the global stability of solutions for different ranges of the parameters α and β. We also give a summary of results and open questions on the more general recursive sequences yn+1=(a+byn/(A+Byn−1, when the parameters a,b,A,B∈ℝ and abAB≠0.

  16. EEG and MEG source localization using recursively applied (RAP) MUSIC

    Energy Technology Data Exchange (ETDEWEB)

    Mosher, J.C. [Los Alamos National Lab., NM (United States); Leahy, R.M. [University of Southern California, Los Angeles, CA (United States). Signal and Image Processing Inst.

    1996-12-31

    The multiple signal characterization (MUSIC) algorithm locates multiple asynchronous dipolar sources from electroencephalography (EEG) and magnetoencephalography (MEG) data. A signal subspace is estimated from the data, then the algorithm scans a single dipole model through a three-dimensional head volume and computes projections onto this subspace. To locate the sources, the user must search the head volume for local peaks in the projection metric. Here we describe a novel extension of this approach which we refer to as RAP (Recursively APplied) MUSIC. This new procedure automatically extracts the locations of the sources through a recursive use of subspace projections, which uses the metric of principal correlations as a multidimensional form of correlation analysis between the model subspace and the data subspace. The dipolar orientations, a form of `diverse polarization,` are easily extracted using the associated principal vectors.

  17. BPSK Receiver Based on Recursive Adaptive Filter with Remodulation

    Directory of Open Access Journals (Sweden)

    N. Milosevic

    2011-12-01

    Full Text Available This paper proposes a new binary phase shift keying (BPSK signal receiver intended for reception under conditions of significant carrier frequency offsets. The recursive adaptive filter with least mean squares (LMS adaptation is used. The proposed receiver has a constant, defining the balance between the recursive and the nonrecursive part of the filter, whose proper choice allows a simple construction of the receiver. The correct choice of this parameter could result in unitary length of the filter. The proposed receiver has performance very close to the performance of the BPSK receiver with perfect frequency synchronization, in a wide range of frequency offsets (plus/minus quarter of the signal bandwidth. The results obtained by the software simulation are confirmed by the experimental results measured on the receiver realized with the universal software radio peripheral (USRP, with the baseband signal processing at personal computer (PC.

  18. Recursive Bayesian recurrent neural networks for time-series modeling.

    Science.gov (United States)

    Mirikitani, Derrick T; Nikolaev, Nikolay

    2010-02-01

    This paper develops a probabilistic approach to recursive second-order training of recurrent neural networks (RNNs) for improved time-series modeling. A general recursive Bayesian Levenberg-Marquardt algorithm is derived to sequentially update the weights and the covariance (Hessian) matrix. The main strengths of the approach are a principled handling of the regularization hyperparameters that leads to better generalization, and stable numerical performance. The framework involves the adaptation of a noise hyperparameter and local weight prior hyperparameters, which represent the noise in the data and the uncertainties in the model parameters. Experimental investigations using artificial and real-world data sets show that RNNs equipped with the proposed approach outperform standard real-time recurrent learning and extended Kalman training algorithms for recurrent networks, as well as other contemporary nonlinear neural models, on time-series modeling.

  19. Recursive utility in a Markov environment with stochastic growth.

    Science.gov (United States)

    Hansen, Lars Peter; Scheinkman, José A

    2012-07-24

    Recursive utility models that feature investor concerns about the intertemporal composition of risk are used extensively in applied research in macroeconomics and asset pricing. These models represent preferences as the solution to a nonlinear forward-looking difference equation with a terminal condition. In this paper we study infinite-horizon specifications of this difference equation in the context of a Markov environment. We establish a connection between the solution to this equation and to an arguably simpler Perron-Frobenius eigenvalue equation of the type that occurs in the study of large deviations for Markov processes. By exploiting this connection, we establish existence and uniqueness results. Moreover, we explore a substantive link between large deviation bounds for tail events for stochastic consumption growth and preferences induced by recursive utility.

  20. Adaptive recursive algorithm for optimal weighted suprathreshold stochastic resonance

    Science.gov (United States)

    Xu, Liyan; Duan, Fabing; Gao, Xiao; Abbott, Derek; McDonnell, Mark D.

    2017-09-01

    Suprathreshold stochastic resonance (SSR) is a distinct form of stochastic resonance, which occurs in multilevel parallel threshold arrays with no requirements on signal strength. In the generic SSR model, an optimal weighted decoding scheme shows its superiority in minimizing the mean square error (MSE). In this study, we extend the proposed optimal weighted decoding scheme to more general input characteristics by combining a Kalman filter and a least mean square (LMS) recursive algorithm, wherein the weighted coefficients can be adaptively adjusted so as to minimize the MSE without complete knowledge of input statistics. We demonstrate that the optimal weighted decoding scheme based on the Kalman-LMS recursive algorithm is able to robustly decode the outputs from the system in which SSR is observed, even for complex situations where the signal and noise vary over time.

  1. Chebyshev recursion methods: Kernel polynomials and maximum entropy

    Energy Technology Data Exchange (ETDEWEB)

    Silver, R.N.; Roeder, H.; Voter, A.F.; Kress, J.D. [Los Alamos National Lab., NM (United States). Theoretical Div.

    1995-10-01

    The authors describe two Chebyshev recursion methods for calculations with very large sparse Hamiltonians, the kernel polynomial method (KPM) and the maximum entropy method (MEM). They are especially applicable to physical properties involving large numbers of eigenstates, which include densities of states, spectral functions, thermodynamics, total energies, as well as forces for molecular dynamics and Monte Carlo simulations. The authors apply Chebyshev methods to the electronic structure of Si, the thermodynamics of Heisenberg antiferromagnets, and a polaron problem.

  2. Recursive Robot-Arm Dynamics via Filtering and Smoothing

    Science.gov (United States)

    Rodriguez, Guillermo

    1987-01-01

    Forward and inverse dynamics solved using Kalman filtering and Bryson-Frazier smoothing. Dynamics of serial-link robot arm solved by using recursive techniques from linear filtering and smoothing theory. Solutions of dynamical equations give forces, moments, and accelerations at joints between links, and multilink inertia matrix and its inverse. Theoretical developments lay foundation for use of filtering and smoothing techniques in design of robot controls.

  3. A fast recursive algorithm for molecular dynamics simulation

    Science.gov (United States)

    Jain, A.; Vaidehi, N.; Rodriguez, G.

    1993-01-01

    The present recursive algorithm for solving molecular systems' dynamical equations of motion employs internal variable models that reduce such simulations' computation time by an order of magnitude, relative to Cartesian models. Extensive use is made of spatial operator methods recently developed for analysis and simulation of the dynamics of multibody systems. A factor-of-450 speedup over the conventional O(N-cubed) algorithm is demonstrated for the case of a polypeptide molecule with 400 residues.

  4. Recursive regularization step for high-order lattice Boltzmann methods

    Science.gov (United States)

    Coreixas, Christophe; Wissocq, Gauthier; Puigt, Guillaume; Boussuge, Jean-François; Sagaut, Pierre

    2017-09-01

    A lattice Boltzmann method (LBM) with enhanced stability and accuracy is presented for various Hermite tensor-based lattice structures. The collision operator relies on a regularization step, which is here improved through a recursive computation of nonequilibrium Hermite polynomial coefficients. In addition to the reduced computational cost of this procedure with respect to the standard one, the recursive step allows to considerably enhance the stability and accuracy of the numerical scheme by properly filtering out second- (and higher-) order nonhydrodynamic contributions in under-resolved conditions. This is first shown in the isothermal case where the simulation of the doubly periodic shear layer is performed with a Reynolds number ranging from 104 to 106, and where a thorough analysis of the case at Re=3 ×104 is conducted. In the latter, results obtained using both regularization steps are compared against the Bhatnagar-Gross-Krook LBM for standard (D2Q9) and high-order (D2V17 and D2V37) lattice structures, confirming the tremendous increase of stability range of the proposed approach. Further comparisons on thermal and fully compressible flows, using the general extension of this procedure, are then conducted through the numerical simulation of Sod shock tubes with the D2V37 lattice. They confirm the stability increase induced by the recursive approach as compared with the standard one.

  5. Recursive linear optical networks for realizing quantum algorithms

    Science.gov (United States)

    Tabia, Gelo Noel

    Linear optics has played a leading role in the development of practical quantum technologies. In recent years, advances in integrated quantum photonics have significantly improved the functionality and scalability of linear optical devices. In this talk, I present recursive schemes for implementing quantum Fourier transforms and inversion about the mean in Grover's algorithm with photonic integrated circuits. By recursive, I mean that two copies of a d-dimensional unitary operation is used to build the corresponding unitary operation on 2 d modes. The linear optical networks operate on path-encoded qudits and realize d-dimensional unitary operations using O (d2) elements. To demonstrate that the recursive circuits are viable in practice, I conducted simulations of proof-of-principle experiments using a fabrication model of realistic errors in silicon-based photonic integrated devices. The results indicate high-fidelity performance in the circuits for 2-qubit and 3-qubit quantum Fourier transforms, and for quantum search on 4-item and 8-item databases. This work was funded by institutional research grant IUT2-1 from the Estonian Research Council and by the European Union through the European Regional Development Fund.

  6. Parallelizable approximate solvers for recursions arising in preconditioning

    Energy Technology Data Exchange (ETDEWEB)

    Shapira, Y. [Israel Inst. of Technology, Haifa (Israel)

    1996-12-31

    For the recursions used in the Modified Incomplete LU (MILU) preconditioner, namely, the incomplete decomposition, forward elimination and back substitution processes, a parallelizable approximate solver is presented. The present analysis shows that the solutions of the recursions depend only weakly on their initial conditions and may be interpreted to indicate that the inexact solution is close, in some sense, to the exact one. The method is based on a domain decomposition approach, suitable for parallel implementations with message passing architectures. It requires a fixed number of communication steps per preconditioned iteration, independently of the number of subdomains or the size of the problem. The overlapping subdomains are either cubes (suitable for mesh-connected arrays of processors) or constructed by the data-flow rule of the recursions (suitable for line-connected arrays with possibly SIMD or vector processors). Numerical examples show that, in both cases, the overhead in the number of iterations required for convergence of the preconditioned iteration is small relatively to the speed-up gained.

  7. Recursive linearization of multibody dynamics equations of motion

    Science.gov (United States)

    Lin, Tsung-Chieh; Yae, K. Harold

    1989-01-01

    The equations of motion of a multibody system are nonlinear in nature, and thus pose a difficult problem in linear control design. One approach is to have a first-order approximation through the numerical perturbations at a given configuration, and to design a control law based on the linearized model. Here, a linearized model is generated analytically by following the footsteps of the recursive derivation of the equations of motion. The equations of motion are first written in a Newton-Euler form, which is systematic and easy to construct; then, they are transformed into a relative coordinate representation, which is more efficient in computation. A new computational method for linearization is obtained by applying a series of first-order analytical approximations to the recursive kinematic relationships. The method has proved to be computationally more efficient because of its recursive nature. It has also turned out to be more accurate because of the fact that analytical perturbation circumvents numerical differentiation and other associated numerical operations that may accumulate computational error, thus requiring only analytical operations of matrices and vectors. The power of the proposed linearization algorithm is demonstrated, in comparison to a numerical perturbation method, with a two-link manipulator and a seven degrees of freedom robotic manipulator. Its application to control design is also demonstrated.

  8. Recursion Of Binary Space As A Foundation Of Repeatable Programs

    Directory of Open Access Journals (Sweden)

    Jeremy Horne

    2006-10-01

    Full Text Available Every computation, including recursion, is based on natural philosophy. Our world may be expressed in terms of a binary logical space that contains functions that act simultaneously as objects and processes (operands and operators. This paper presents an outline of the results of research about that space and suggests routes for further inquiry. Binary logical space is generated sequentially from an origin in a standard coordinate system. At least one method exists to show that each of the resulting 16 functions repeats itself by repeatedly forward-feeding outputs of a function operating over two others as new operands of the original function until the original function appears as an output, thus behaving as an apparent homeostatic automaton. As any space of any dimension is composed of one or more of these functions, so the space is recursive, as well. Semantics gives meaning to recursive structures, computer programs and fundamental constituents of our universe being two examples. Such thoughts open inquiry into larger philosophical issues as free will and determinism.

  9. A Comparison of Evolutionary Algorithms for Tracking Time-Varying Recursive Systems

    Directory of Open Access Journals (Sweden)

    White Michael S

    2003-01-01

    Full Text Available A comparison is made of the behaviour of some evolutionary algorithms in time-varying adaptive recursive filter systems. Simulations show that an algorithm including random immigrants outperforms a more conventional algorithm using the breeder genetic algorithm as the mutation operator when the time variation is discontinuous, but neither algorithm performs well when the time variation is rapid but smooth. To meet this deficit, a new hybrid algorithm which uses a hill climber as an additional genetic operator, applied for several steps at each generation, is introduced. A comparison is made of the effect of applying the hill climbing operator a few times to all members of the population or a larger number of times solely to the best individual; it is found that applying to the whole population yields the better results, substantially improved compared with those obtained using earlier methods.

  10. Categorial Compositionality III: F-(co)algebras and the Systematicity of Recursive Capacities in Human Cognition

    Science.gov (United States)

    Phillips, Steven; Wilson, William H.

    2012-01-01

    Human cognitive capacity includes recursively definable concepts, which are prevalent in domains involving lists, numbers, and languages. Cognitive science currently lacks a satisfactory explanation for the systematic nature of such capacities (i.e., why the capacity for some recursive cognitive abilities–e.g., finding the smallest number in a list–implies the capacity for certain others–finding the largest number, given knowledge of number order). The category-theoretic constructs of initial F-algebra, catamorphism, and their duals, final coalgebra and anamorphism provide a formal, systematic treatment of recursion in computer science. Here, we use this formalism to explain the systematicity of recursive cognitive capacities without ad hoc assumptions (i.e., to the same explanatory standard used in our account of systematicity for non-recursive capacities). The presence of an initial algebra/final coalgebra explains systematicity because all recursive cognitive capacities, in the domain of interest, factor through (are composed of) the same component process. Moreover, this factorization is unique, hence no further (ad hoc) assumptions are required to establish the intrinsic connection between members of a group of systematically-related capacities. This formulation also provides a new perspective on the relationship between recursive cognitive capacities. In particular, the link between number and language does not depend on recursion, as such, but on the underlying functor on which the group of recursive capacities is based. Thus, many species (and infants) can employ recursive processes without having a full-blown capacity for number and language. PMID:22514704

  11. Direct evaluation of fault trees using object-oriented programming techniques

    Science.gov (United States)

    Patterson-Hine, F. A.; Koen, B. V.

    1989-01-01

    Object-oriented programming techniques are used in an algorithm for the direct evaluation of fault trees. The algorithm combines a simple bottom-up procedure for trees without repeated events with a top-down recursive procedure for trees with repeated events. The object-oriented approach results in a dynamic modularization of the tree at each step in the reduction process. The algorithm reduces the number of recursive calls required to solve trees with repeated events and calculates intermediate results as well as the solution of the top event. The intermediate results can be reused if part of the tree is modified. An example is presented in which the results of the algorithm implemented with conventional techniques are compared to those of the object-oriented approach.

  12. Discovery of a Recursive Principle: An Artificial Grammar Investigation of Human Learning of a Counting Recursion Language.

    Science.gov (United States)

    Cho, Pyeong Whan; Szkudlarek, Emily; Tabor, Whitney

    2016-01-01

    Learning is typically understood as a process in which the behavior of an organism is progressively shaped until it closely approximates a target form. It is easy to comprehend how a motor skill or a vocabulary can be progressively learned-in each case, one can conceptualize a series of intermediate steps which lead to the formation of a proficient behavior. With grammar, it is more difficult to think in these terms. For example, center embedding recursive structures seem to involve a complex interplay between multiple symbolic rules which have to be in place simultaneously for the system to work at all, so it is not obvious how the mechanism could gradually come into being. Here, we offer empirical evidence from a new artificial language (or "artificial grammar") learning paradigm, Locus Prediction, that, despite the conceptual conundrum, recursion acquisition occurs gradually, at least for a simple formal language. In particular, we focus on a variant of the simplest recursive language, a (n) b (n) , and find evidence that (i) participants trained on two levels of structure (essentially ab and aabb) generalize to the next higher level (aaabbb) more readily than participants trained on one level of structure (ab) combined with a filler sentence; nevertheless, they do not generalize immediately; (ii) participants trained up to three levels (ab, aabb, aaabbb) generalize more readily to four levels than participants trained on two levels generalize to three; (iii) when we present the levels in succession, starting with the lower levels and including more and more of the higher levels, participants show evidence of transitioning between the levels gradually, exhibiting intermediate patterns of behavior on which they were not trained; (iv) the intermediate patterns of behavior are associated with perturbations of an attractor in the sense of dynamical systems theory. We argue that all of these behaviors indicate a theory of mental representation in which recursive

  13. Cavity tree selection by red-cockaded woodpeckers in relation to tree age

    Science.gov (United States)

    D. Craig Rudolph; Richard N. Conner

    1991-01-01

    We aged over 1350 Red-cockaded Woodpecker (Picoides borealis) cavity trees and a comparable number of randomly selected trees. Resulting data strongly support the hypothesis that Red-cockaded Woodpeckers preferentially select older trees. Ages of recently initiated cavity trees in the Texas study areas generally were similar to those of cavity trees...

  14. Discrete probability models and methods probability on graphs and trees, Markov chains and random fields, entropy and coding

    CERN Document Server

    Brémaud, Pierre

    2017-01-01

    The emphasis in this book is placed on general models (Markov chains, random fields, random graphs), universal methods (the probabilistic method, the coupling method, the Stein-Chen method, martingale methods, the method of types) and versatile tools (Chernoff's bound, Hoeffding's inequality, Holley's inequality) whose domain of application extends far beyond the present text. Although the examples treated in the book relate to the possible applications, in the communication and computing sciences, in operations research and in physics, this book is in the first instance concerned with theory. The level of the book is that of a beginning graduate course. It is self-contained, the prerequisites consisting merely of basic calculus (series) and basic linear algebra (matrices). The reader is not assumed to be trained in probability since the first chapters give in considerable detail the background necessary to understand the rest of the book. .

  15. A Proof-Theoretic Account of Primitive Recursion and Primitive Iteration

    Directory of Open Access Journals (Sweden)

    Luca Chiarabini

    2011-01-01

    Full Text Available We revisit both the usual ``going-up'' induction principle and Manna and Waldinger's ``going-down'' induction principle for primitive recursion,`a la Goedel, and primitive iteration, `a la Church. We use 'Kleene's trick' to show that primitive recursion and primitive iteration are as expressive as the other, even in the presence of accumulators. As a result, we can directly extract a variety of recursive and iterative functional programs of the kind usually written or optimized by hand.

  16. Recursion: what is it, who has it, and how did it evolve?

    Science.gov (United States)

    Coolidge, Frederick L; Overmann, Karenleigh A; Wynn, Thomas

    2011-09-01

    Recursion is a topic of considerable controversy in linguistics, which stems from its varying definitions and its key features, such as its universality, uniqueness to human language, and evolution. Currently, there appear to be at least two common senses of recursion: (1) embeddedness of phrases within other phrases, which entails keeping track of long-distance dependencies among phrases and (2) the specification of the computed output string itself, including meta-recursion, where recursion is both the recipe for an utterance and the overarching process that creates and executes the recipes. There are also at least two evolutionary scenarios for the adaptive value of recursion in human language. The gradualist position posits precursors, such as animal communication and protolanguages, and holds that the selective purpose of recursion was for communication. The saltationist position assumes no gradual development of recursion and posits that it evolved for reasons other than communication. In the latter view, some heritable event associated with a cognitive prerequisite of language, such as Theory of Mind or working memory capacity, allowed recursive utterances. Evolutionary adaptive reasons for recursive thoughts were also proffered, including diplomatic speech, perlocutionary acts, and prospective cognitions. WIREs Cogni Sci 2011 2 547-554 DOI: 10.1002/wcs.131 For further resources related to this article, please visit the WIREs website. Copyright © 2010 John Wiley & Sons, Ltd.

  17. Recursive inter-generational utility in global climate risk modeling

    Energy Technology Data Exchange (ETDEWEB)

    Minh, Ha-Duong [Centre International de Recherche sur l' Environnement et le Developpement (CIRED-CNRS), 75 - Paris (France); Treich, N. [Institut National de Recherches Agronomiques (INRA-LEERNA), 31 - Toulouse (France)

    2003-07-01

    This paper distinguishes relative risk aversion and resistance to inter-temporal substitution in climate risk modeling. Stochastic recursive preferences are introduced in a stylized numeric climate-economy model using preliminary IPCC 1998 scenarios. It shows that higher risk aversion increases the optimal carbon tax. Higher resistance to inter-temporal substitution alone has the same effect as increasing the discount rate, provided that the risk is not too large. We discuss implications of these findings for the debate upon discounting and sustainability under uncertainty. (author)

  18. Fast recursive algorithm for broadband APFs using complex cepstrums.

    Science.gov (United States)

    Phua, P B; Ippen, E

    2004-10-04

    Integrated-optical All-Pass Filters are of interest for their potential compactness and economy of production. For broadband applications, the number of APFs involved can be as large as 50. To find optima for all the large number of parameters involved, we need a fast and efficient algorithm based on recursive equations. APF design algorithms based on complex cepstrum are proposed in digital signal processing. In this paper, we enhance these algorithms to efficiently fit the differential phase profile required for in-line broadband Polarization Mode Dispersion and Polarization Dependent Loss compensation.

  19. Consumption-Portfolio Optimization with Recursive Utility in Incomplete Markets

    DEFF Research Database (Denmark)

    Kraft, Holger; Seifried, Frank Thomas; Steffensen, Mogens

    2013-01-01

    In an incomplete market, we study the optimal consumption-portfolio decision of an investor with recursive preferences of Epstein–Zin type. Applying a classical dynamic programming approach, we formulate the associated Hamilton–Jacobi–Bellman equation and provide a suitable verification theorem......–Zin preferences in an incomplete market for non-unit elasticity of intertemporal substitution (EIS) and apply our verification result to prove that they solve the consumption-investment problem. We also compare our exact solutions to the Campbell–Shiller approximation and assess its accuracy....

  20. Linear Phase Second Order Recursive Digital Integrators and Differentiators

    Directory of Open Access Journals (Sweden)

    M. Jain

    2012-06-01

    Full Text Available In this paper, design of linear phase second order recursive digital integrators and differentiators is discussed. New second order integrators have been designed by using Genetic Algorithm (GA optimization method. Thereafter, by modifying the transfer function of these integrators appropriately, new digital differentiators have been obtained. The proposed digital integrators and differentiators accurately approximate the ideal ones and have linear phase response over almost entire Nyquist frequency range. The proposed operators also outperform the existing operators in terms of both magnitude and phase response.

  1. Resin from the mukul myrrh tree, guggul, can it be used for treating hypercholesterolemia? A randomized, controlled study.

    Science.gov (United States)

    Nohr, Lise Anett; Rasmussen, Lars Bjørn; Straand, Jørund

    2009-01-01

    Guggul, herbal extract from resin of the Commiphora mukul tree, is widely used in Asia as a cholesterol-lowering agent based on Indian Ayurvedic medicine. Its popularity for this use is increasing in the US and Western Europe. Guggulsterones, the presumed bioactive compounds of guggul, may antagonise two nuclear hormone receptors involved in cholesterol metabolism, which is a possible explanation for hypolipidemic effects of these extracts. However, publications of efficacy data on the use of guggul extracts in Western populations are scarce. To study the efficacy of a guggul-based formulation (short: guggul) on blood lipids in healthy adults with moderately increased cholesterol. Double-blind, randomised, placebo controlled trial in Norwegian general practice. 43 women and men, age 27-70, with moderately increased cholesterol, randomised to use 2160mg guggul (4 capsules) daily, or placebo for 12 weeks. Mean change in total cholesterol, low-density lipoprotein cholesterol (LDL-C), triglycerides, high-density lipoprotein cholesterol (HDL-C) and total cholesterol/HDL-C ratio compared with baseline. Lipids were analysed at baseline, and at 6 and 12 weeks. In addition, unexpected events and adverse effects were recorded. Two dropouts, one withdrawal, and incomplete lab results for six persons left 34 participants to accomplish the trial (18-guggul, 16-placebo) with complete lab test data. After 12 weeks, mean levels of total cholesterol and HDL-C in the active group were significantly reduced compared with the placebo group. However, the mean levels of LDL-C, triglycerides, and total cholesterol/HDL-C ratio between the two groups did not change significantly. Ten guggul users (vs. four in the placebo group) reported side effects: mild gastrointestinal discomfort (n=7), possible thyroid problems (n=2), and generalized skin rash (n=1). The latter resulted in withdrawal from trial. Even if total cholesterol and HDL-C were significantly reduced, the clinical magnitude of

  2. Modeling relationships between calving traits: a comparison between standard and recursive mixed models.

    Science.gov (United States)

    de Maturana, Evangelina López; de los Campos, Gustavo; Wu, Xiao-Lin; Gianola, Daniel; Weigel, Kent A; Rosa, Guilherme J M

    2010-01-25

    The use of structural equation models for the analysis of recursive and simultaneous relationships between phenotypes has become more popular recently. The aim of this paper is to illustrate how these models can be applied in animal breeding to achieve parameterizations of different levels of complexity and, more specifically, to model phenotypic recursion between three calving traits: gestation length (GL), calving difficulty (CD) and stillbirth (SB). All recursive models considered here postulate heterogeneous recursive relationships between GL and liabilities to CD and SB, and between liability to CD and liability to SB, depending on categories of GL phenotype. Four models were compared in terms of goodness of fit and predictive ability: 1) standard mixed model (SMM), a model with unstructured (co)variance matrices; 2) recursive mixed model 1 (RMM1), assuming that residual correlations are due to the recursive relationships between phenotypes; 3) RMM2, assuming that correlations between residuals and contemporary groups are due to recursive relationships between phenotypes; and 4) RMM3, postulating that the correlations between genetic effects, contemporary groups and residuals are due to recursive relationships between phenotypes. For all the RMM considered, the estimates of the structural coefficients were similar. Results revealed a nonlinear relationship between GL and the liabilities both to CD and to SB, and a linear relationship between the liabilities to CD and SB.Differences in terms of goodness of fit and predictive ability of the models considered were negligible, suggesting that RMM3 is plausible. The applications examined in this study suggest the plausibility of a nonlinear recursive effect from GL onto CD and SB. Also, the fact that the most restrictive model RMM3, which assumes that the only cause of correlation is phenotypic recursion, performs as well as the others indicates that the phenotypic recursion may be an important cause of the

  3. Recursions of Symmetry Orbits and Reduction without Reduction

    Directory of Open Access Journals (Sweden)

    Andrei A. Malykh

    2011-04-01

    Full Text Available We consider a four-dimensional PDE possessing partner symmetries mainly on the example of complex Monge-Ampère equation (CMA. We use simultaneously two pairs of symmetries related by a recursion relation, which are mutually complex conjugate for CMA. For both pairs of partner symmetries, using Lie equations, we introduce explicitly group parameters as additional variables, replacing symmetry characteristics and their complex conjugates by derivatives of the unknown with respect to group parameters. We study the resulting system of six equations in the eight-dimensional space, that includes CMA, four equations of the recursion between partner symmetries and one integrability condition of this system. We use point symmetries of this extended system for performing its symmetry reduction with respect to group parameters that facilitates solving the extended system. This procedure does not imply a reduction in the number of physical variables and hence we end up with orbits of non-invariant solutions of CMA, generated by one partner symmetry, not used in the reduction. These solutions are determined by six linear equations with constant coefficients in the five-dimensional space which are obtained by a three-dimensional Legendre transformation of the reduced extended system. We present algebraic and exponential examples of such solutions that govern Legendre-transformed Ricci-flat Kähler metrics with no Killing vectors. A similar procedure is briefly outlined for Husain equation.

  4. Exploiting fine-grain parallelism in recursive LU factorization

    KAUST Repository

    Dongarra, Jack

    2012-01-01

    The LU factorization is an important numerical algorithm for solving system of linear equations. This paper proposes a novel approach for computing the LU factorization in parallel on multicore architectures. It improves the overall performance and also achieves the numerical quality of the standard LU factorization with partial pivoting. While the update of the trailing submatrix is computationally intensive and highly parallel, the inherently problematic portion of the LU factorization is the panel factorization due to its memory-bound characteristic and the atomicity of selecting the appropriate pivots. We remedy this in our new approach to LU factorization of (narrow and tall) panel submatrices. We use a parallel fine-grained recursive formulation of the factorization. It is based on conflict-free partitioning of the data and lock-less synchronization mechanisms. Our implementation lets the overall computation naturally flow with limited contention. Our recursive panel factorization provides the necessary performance increase for the inherently problematic portion of the LU factorization of square matrices. A large panel width results in larger Amdahl\\'s fraction as our experiments have revealed which is consistent with related efforts. The performance results of our implementation reveal superlinear speedup and far exceed what can be achieved with equivalent MKL and/or LAPACK routines. © 2012 The authors and IOS Press. All rights reserved.

  5. Recursive cosmopolitization: Argentina and the global Human Rights Regime.

    Science.gov (United States)

    Levy, Daniel

    2010-09-01

    This paper illustrates how varieties of cosmopolitanism are shaped through a mutually constitutive set of cultural dispositions and institutional practices that emerge at the interstices of global human right norms and local legal practices. Converging pressures of 'cosmopolitan imperatives' and the multiplicity of particularized manifestations are co-evolving in the context of intercrossings during which distinctive cosmopolitanisms are established. This complex relationship of global normative expectations and their local appropriations is elucidated through the dynamic of recursive cosmopolitization. Suggesting that, local problems are resolved with recourse to global prescriptions while local solutions are inscribed in international institutions consolidating the global Human Rights Regime. The Argentinean case carries conceptual and empirical weight as it underscores the recursivity of cosmopolitization by calibrating the tensions of universalism and particularism at the intersection of global, national and regional scales. Argentina is a paradigmatic instantiation for how cosmopolitanism can emanate in the periphery as local problems are globalized. This, in turn, has resulted in the institutionalization of a global Human Rights Regime which exercises normative and political-legal pressures on how states legitimately deal with human rights abuses. It is this cosmopolitan balance, rather than presuppositions of universalistic exogenous pressures or particularistic national exceptions, which is shaping the cultural and political relevance of human rights norms. © London School of Economics and Political Science 2010.

  6. Implicit Artificial Syntax Processing: Genes, Preference, and Bounded Recursion

    Directory of Open Access Journals (Sweden)

    Vasiliki Folia

    2011-06-01

    Full Text Available The first objective of this study was to compare the brain network engaged by preference classification and the standard grammaticality classification after implicit artificial syntax acquisition by re-analyzing previously reported event-related fMRI data. The results show that preference and grammaticality classification engage virtually identical brain networks, including Broca’s region, consistent with previous behavioral findings. Moreover, the results showed that the effects related to artificial syntax in Broca’s region were essentially the same when masked with variability related to natural syntax processing in the same participants. The second objective was to explore CNTNAP2-related effects in implicit artificial syntax learning by analyzing behavioral and event-related fMRI data from a subsample. The CNTNAP2 gene has been linked to specific language impairment and is con-trolled by the FOXP2 transcription factor. CNTNAP2 is expressed in language related brain networks in the developing human brain and the FOXP2–CNTNAP2 pathway provides a mechanistic link between clinically distinct syndromes involving disrupted language. Finally, we discuss the implication of taking natural language to be a neurobiological system in terms of bounded recursion and suggest that the left inferior frontal region is a generic on-line sequence processor that unifies information from various sources in an incremental and recursive manner.

  7. Optimal Recursive Digital Filters for Active Bending Stabilization

    Science.gov (United States)

    Orr, Jeb S.

    2013-01-01

    In the design of flight control systems for large flexible boosters, it is common practice to utilize active feedback control of the first lateral structural bending mode so as to suppress transients and reduce gust loading. Typically, active stabilization or phase stabilization is achieved by carefully shaping the loop transfer function in the frequency domain via the use of compensating filters combined with the frequency response characteristics of the nozzle/actuator system. In this paper we present a new approach for parameterizing and determining optimal low-order recursive linear digital filters so as to satisfy phase shaping constraints for bending and sloshing dynamics while simultaneously maximizing attenuation in other frequency bands of interest, e.g. near higher frequency parasitic structural modes. By parameterizing the filter directly in the z-plane with certain restrictions, the search space of candidate filter designs that satisfy the constraints is restricted to stable, minimum phase recursive low-pass filters with well-conditioned coefficients. Combined with optimal output feedback blending from multiple rate gyros, the present approach enables rapid and robust parametrization of autopilot bending filters to attain flight control performance objectives. Numerical results are presented that illustrate the application of the present technique to the development of rate gyro filters for an exploration-class multi-engined space launch vehicle.

  8. Recursive mentalizing and common knowledge in the bystander effect.

    Science.gov (United States)

    Thomas, Kyle A; De Freitas, Julian; DeScioli, Peter; Pinker, Steven

    2016-05-01

    The more potential helpers there are, the less likely any individual is to help. A traditional explanation for this bystander effect is that responsibility diffuses across the multiple bystanders, diluting the responsibility of each. We investigate an alternative, which combines the volunteer's dilemma (each bystander is best off if another responds) with recursive theory of mind (each infers what the others know about what he knows) to predict that actors will strategically shirk when they think others feel compelled to help. In 3 experiments, participants responded to a (fictional) person who needed help from at least 1 volunteer. Participants were in groups of 2 or 5 and had varying information about whether other group members knew that help was needed. As predicted, people's decision to help zigzagged with the depth of their asymmetric, recursive knowledge (e.g., "John knows that Michael knows that John knows help is needed"), and replicated the classic bystander effect when they had common knowledge (everyone knowing what everyone knows). The results demonstrate that the bystander effect may result not from a mere diffusion of responsibility but specifically from actors' strategic computations. (c) 2016 APA, all rights reserved).

  9. Recursion relations for multi-gluon off-shell amplitudes on the light-front and Wilson lines

    Directory of Open Access Journals (Sweden)

    C. Cruz-Santiago

    2015-06-01

    Full Text Available We analyze the off-shell scattering amplitudes in the framework of the light-front perturbation theory. It is shown that the previously derived recursion relation between tree level off-shell amplitudes in this formalism actually resums whole classes of graphs into a Wilson line. More precisely, we establish a correspondence between the light-front methods for the computation of the off-shell amplitudes and the approach which makes use of the matrix elements of straight infinite Wilson lines, which are manifestly gauge invariant objects. Furthermore, since it is needed to explicitly verify the gauge invariance of light-front amplitudes, it is demonstrated that the Ward identities in this framework need additional instantaneous terms in the light-front graphs.

  10. Flowering Trees

    Indian Academy of Sciences (India)

    Flowering Trees. Dolichandrone atrovirens (Roth) K. Schum. (Spathe Trumpet Tree) of Bignoniaceae is a medium-sized handsome tree with a straight bole that branches at the top. Leaves are once pinnate, with two to three pairs of leaflets. Young parts of the tree are velvety. Inflorescence is a branched raceme borne at the ...

  11. A recursive Formulation of the Inversion of symmetric positive defite matrices in packed storage data format

    DEFF Research Database (Denmark)

    Andersen, Bjarne Stig; Gunnels, John A.; Gustavson, Fred

    2002-01-01

    A new Recursive Packed Inverse Calculation Algorithm for symmetric positive definite matrices has been developed. The new Recursive Inverse Calculation algorithm uses minimal storage, \\$n(n+1)/2\\$, and has nearly the same performance as the LAPACK full storage algorithm using \\$n\\^2\\$ memory word...

  12. Cognitive representation of "musical fractals": Processing hierarchy and recursion in the auditory domain.

    Science.gov (United States)

    Martins, Mauricio Dias; Gingras, Bruno; Puig-Waldmueller, Estela; Fitch, W Tecumseh

    2017-04-01

    The human ability to process hierarchical structures has been a longstanding research topic. However, the nature of the cognitive machinery underlying this faculty remains controversial. Recursion, the ability to embed structures within structures of the same kind, has been proposed as a key component of our ability to parse and generate complex hierarchies. Here, we investigated the cognitive representation of both recursive and iterative processes in the auditory domain. The experiment used a two-alternative forced-choice paradigm: participants were exposed to three-step processes in which pure-tone sequences were built either through recursive or iterative processes, and had to choose the correct completion. Foils were constructed according to generative processes that did not match the previous steps. Both musicians and non-musicians were able to represent recursion in the auditory domain, although musicians performed better. We also observed that general 'musical' aptitudes played a role in both recursion and iteration, although the influence of musical training was somehow independent from melodic memory. Moreover, unlike iteration, recursion in audition was well correlated with its non-auditory (recursive) analogues in the visual and action sequencing domains. These results suggest that the cognitive machinery involved in establishing recursive representations is domain-general, even though this machinery requires access to information resulting from domain-specific processes. Copyright © 2017 The Authors. Published by Elsevier B.V. All rights reserved.

  13. Recursive Fact-finding: A Streaming Approach to Truth Estimation in Crowdsourcing Applications

    Science.gov (United States)

    2013-07-01

    recursive EM algorithm to optimize sensor deployment and adaptively estimate the boundary of sensor locations [11]. Frenkel et al. applied the...systems, SenSys ’07, pages 87–101, New York, NY, USA, 2007. ACM. [9] L. Frenkel and M. Feder. Recursive expectation-maximization (em) algorithms for

  14. Time-area efficient multiplier-free recursive filter architectures for FPGA implementation

    DEFF Research Database (Denmark)

    Shajaan, Mohammad; Sørensen, John Aasted

    1996-01-01

    Simultaneous design of multiplier-free recursive filters (IIR filters) and their hardware implementation in Xilinx field programmable gate array (XC4000) is presented. The hardware design methodology leads to high performance recursive filters with sampling frequencies in the interval 15-21 MHz (...

  15. The Tree Theme Method® (TTM), an occupational therapy intervention for treating depression and anxiety: study protocol of a randomized controlled trial.

    Science.gov (United States)

    Gunnarsson, A Birgitta; Wagman, Petra; Håkansson, Carita; Hedin, Katarina

    2015-11-09

    Depression and anxiety disorders are increasing among the general population in the Western world. Individuals may need several kinds of treatment in order to maintain health, such as cognitive behavioural therapy (CBT) and drug treatment. However, having an everyday life that "works" is also important, suggesting a need for interventions based on activities that facilitate a satisfying everyday life. There is still lack of such evidence-based interventions. The Tree Theme Method(®) (TTM) is an occupational therapy intervention designed for a client-centred context in which an individual develops strategies to become an actor in his or her everyday life. Previous studies of the TTM have focused on process evaluation; therefore, further studies are needed to evaluate the method's effects. The aim of this paper is to outline an intervention that can evaluate the effects of the TTM in terms of psychological symptoms, as well as everyday occupations and well-being, in patients suffering from depression and anxiety. This randomized clinical trial includes patients from three Swedish counties randomized to either intervention or treatment as usual. Men and women aged 18-65 years who have been diagnosed with either depression or anxiety are eligible for inclusion. Data collection is carried out at baseline, and outcomes are assessed at the end of intervention, as well as at 3 months and 12 months after intervention ends. The outcomes measured are psychological symptoms, everyday activities, and health-related factors. Depression and anxiety may create difficulties for individuals in the activities of their everyday lives to the extent that they require diagnosis and intervention. Despite this reality, evidence-based interventions that focus on everyday activities are lacking. Therefore, it would be useful to design a specific method for occupational therapy intervention that does precisely that. This study provides insight into the effects of the TTM, comparing it to

  16. Using a mega-phylogeny of seed plants to test for non-random patterns of areal-types across the Chinese tree of life

    Directory of Open Access Journals (Sweden)

    Rong Li

    2016-12-01

    Full Text Available The species composition of plant assemblages can in large part be explained by a long history of biogeographic and evolutionary events. Over the past decade, botanists and plant ecologists have increasingly sought to quantify phylogenetic signal in ecological traits to help inform their inferences regarding the mechanisms driving plant assemblages. However, most studies with a test of phylogenetic signal in the ecological traits have focused on a local scale, while comparatively few studies have been carried out on a regional scale. In this study, I presented a family-level phylogeny and a genus-level phylogeny that included all families and genera of extant seed plants in China, and use both phylogenies to examine whether areal-types or distribution patterns of families and genera of seed plants are non-randomly distributed across the Chinese tree of life. My study shows that the areal-types of families and genera of seed plants exhibit significant phylogenetic signal across the family- or genus-level phylogeny of seed plants in China.

  17. Predicting forest attributes from climate data using a recursive partitioning and regression tree algorithm

    Science.gov (United States)

    Greg C. Liknes; Christopher W. Woodall; Charles H. Perry

    2009-01-01

    Climate information frequently is included in geospatial modeling efforts to improve the predictive capability of other data sources. The selection of an appropriate climate data source requires consideration given the number of choices available. With regard to climate data, there are a variety of parameters (e.g., temperature, humidity, precipitation), time intervals...

  18. Organization of the state space of a simple recurrent network before and after training on recursive linguistic structures.

    Science.gov (United States)

    Cernanský, Michal; Makula, Matej; Benusková, Lubica

    2007-03-01

    Recurrent neural networks are often employed in the cognitive science community to process symbol sequences that represent various natural language structures. The aim is to study possible neural mechanisms of language processing and aid in development of artificial language processing systems. We used data sets containing recursive linguistic structures and trained the Elman simple recurrent network (SRN) for the next-symbol prediction task. Concentrating on neuron activation clusters in the recurrent layer of SRN we investigate the network state space organization before and after training. Given a SRN and a training stream, we construct predictive models, called neural prediction machines, that directly employ the state space dynamics of the network. We demonstrate two important properties of representations of recursive symbol series in the SRN. First, the clusters of recurrent activations emerging before training are meaningful and correspond to Markov prediction contexts. We show that prediction states that naturally arise in the SRN initialized with small random weights approximately correspond to states of Variable Memory Length Markov Models (VLMM) based on individual symbols (i.e. words). Second, we demonstrate that during training, the SRN reorganizes its state space according to word categories and their grammatical subcategories, and the next-symbol prediction is again based on the VLMM strategy. However, after training, the prediction is based on word categories and their grammatical subcategories rather than individual words. Our conclusion holds for small depths of recursions that are comparable to human performances. The methods of SRN training and analysis of its state space introduced in this paper are of a general nature and can be used for investigation of processing of any other symbol time series by means of SRN.

  19. Flame Propagation Through Swirling Eddys, A Recursive Pattern

    CERN Document Server

    Ashurst, W T

    1993-01-01

    Abstract: Computed flame motion through and between swirling eddys exhibits a maximum advancement rate which is related to the time duration of flame motion between eddys. This eddy spatial structure effect upon the apparent turbulent flame speed appears to be similar to the square-root dependence observed in wrinkled flamelet data. The rate-limiting behavior at one eddy length-scale can be removed by inclusion of smaller eddys which reside between the larger eddys. This large-eddy, small-eddy concept yields a recursion relation and repeated functional iteration can be done to approximate a desired flame speed relation. As an example, an iteration to produce $S_T Currently, the iteration process is a post-diction of flame speed, but if a universality can be developed, then a predictive theory of turbulent flame propagation might be achieved.

  20. Step-Indexed Normalization for a Language with General Recursion

    Directory of Open Access Journals (Sweden)

    Chris Casinghino

    2012-02-01

    Full Text Available The Trellys project has produced several designs for practical dependently typed languages. These languages are broken into two fragments—a _logical_ fragment where every term normalizes and which is consistent when interpreted as a logic, and a _programmatic_ fragment with general recursion and other convenient but unsound features. In this paper, we present a small example language in this style. Our design allows the programmer to explicitly mention and pass information between the two fragments. We show that this feature substantially complicates the metatheory and present a new technique, combining the traditional Girard-Tait method with step-indexed logical relations, which we use to show normalization for the logical fragment.

  1. Applying recursive numerical integration techniques for solving high dimensional integrals

    Energy Technology Data Exchange (ETDEWEB)

    Ammon, Andreas [IVU Traffic Technologies AG, Berlin (Germany); Genz, Alan [Washington State Univ., Pullman, WA (United States). Dept. of Mathematics; Hartung, Tobias [King' s College, London (United Kingdom). Dept. of Mathematics; Jansen, Karl; Volmer, Julia [Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany). John von Neumann-Inst. fuer Computing NIC; Leoevey, Hernan [Humboldt Univ. Berlin (Germany). Inst. fuer Mathematik

    2016-11-15

    The error scaling for Markov-Chain Monte Carlo techniques (MCMC) with N samples behaves like 1/√(N). This scaling makes it often very time intensive to reduce the error of computed observables, in particular for applications in lattice QCD. It is therefore highly desirable to have alternative methods at hand which show an improved error scaling. One candidate for such an alternative integration technique is the method of recursive numerical integration (RNI). The basic idea of this method is to use an efficient low-dimensional quadrature rule (usually of Gaussian type) and apply it iteratively to integrate over high-dimensional observables and Boltzmann weights. We present the application of such an algorithm to the topological rotor and the anharmonic oscillator and compare the error scaling to MCMC results. In particular, we demonstrate that the RNI technique shows an error scaling in the number of integration points m that is at least exponential.

  2. A Recursive Fuzzy System for Efficient Digital Image Stabilization

    Directory of Open Access Journals (Sweden)

    Nikolaos Kyriakoulis

    2008-01-01

    Full Text Available A novel digital image stabilization technique is proposed in this paper. It is based on a fuzzy Kalman compensation of the global motion vector (GMV, which is estimated in the log-polar plane. The GMV is extracted using four local motion vectors (LMVs computed on respective subimages in the logpolar plane. The fuzzy Kalman system consists of a fuzzy system with the Kalman filter's discrete time-invariant definition. Due to this inherited recursiveness, the output results into smoothed image sequences. The proposed stabilization system aims to compensate any oscillations of the frame absolute positions, based on the motion estimation in the log-polar domain, filtered by the fuzzy Kalman system, and thus the advantages of both the fuzzy Kalman system and the log-polar transformation are exploited. The described technique produces optimal results in terms of the output quality and the level of compensation.

  3. Negative Group Delay Circuit Based on Microwave Recursive Filters

    Directory of Open Access Journals (Sweden)

    Mohammad Ashraf Ali

    2015-01-01

    Full Text Available This work presents a novel approach to design a maximally flat negative group delay (NGD circuit based on microwave recursive filters. The proposed NGD circuit is realized by cascading N stages of quarter-wavelength stepped-impedance transformer. It is shown that the given circuit can be designed to have any prescribed group delay by changing the characteristic impedance of the quarter-wave transformers (QWTs cascaded with each other. The proposed approach provides a systematic method to synthesize NGD of arbitrary amount without including any discrete lumped component. For various prescribed NGD, the characteristic impedance of QWT has been tabulated for two and three stages of the circuit. The widths and lengths of microstrip transmission lines can be obtained from characteristic impedance and the frequency of operation of the transmission line. The results are verified in both simulation and measurement, showing a good agreement.

  4. Source localization using recursively applied and projected (RAP) MUSIC

    Energy Technology Data Exchange (ETDEWEB)

    Mosher, J.C. [Los Alamos National Lab., NM (United States); Leahy, R.M. [Univ. of Southern California, Los Angeles, CA (United States). Signal and Image Processing Inst.

    1998-03-01

    A new method for source localization is described that is based on a modification of the well known multiple signal classification (MUSIC) algorithm. In classical MUSIC, the array manifold vector is projected onto an estimate of the signal subspace, but errors in the estimate can make location of multiple sources difficult. Recursively applied and projected (RAP) MUSIC uses each successively located source to form an intermediate array gain matrix, and projects both the array manifold and the signal subspace estimate into its orthogonal complement. The MUSIC projection is then performed in this reduced subspace. Using the metric of principal angles, the authors describe a general form of the RAP-MUSIC algorithm for the case of diversely polarized sources. Through a uniform linear array simulation, the authors demonstrate the improved Monte Carlo performance of RAP-MUSIC relative to MUSIC and two other sequential subspace methods, S and IES-MUSIC.

  5. Lossless image compression based on recursive nonlinear interpolation

    Science.gov (United States)

    Aiazzi, Bruno; Alparone, Luciano; Baronti, Stefano; Lotti, Franco

    1997-10-01

    The generalized recursive interpolation (GRINT) algorithm was recently proposed and shown to be the most effective progressive technique for decorrelation of still image. A nonlinear version of GRINT (MRINT) employs median filtering in a nonseparable fashion on a quincunx grid. The main advantage of both these schemes is that interpolation is performed from all error-free values, thereby reducing the variance of interpolation errors. MRINT is embedded in a simplified version of the context-based encoder by Said and Pearlman. Coding performances of the novel context-based coder are evaluated by comparisons with GRINT, and a variety of other multiresolution lossless methods, including the original scheme by Said and Pearlman. The modified scheme outperforms all the other algorithms, including the latter, especially when dealing with medical images.

  6. Virasoro constraints and polynomial recursion for the linear Hodge integrals

    Science.gov (United States)

    Guo, Shuai; Wang, Gehao

    2017-04-01

    The Hodge tau-function is a generating function for the linear Hodge integrals. It is also a tau-function of the KP hierarchy. In this paper, we first present the Virasoro constraints for the Hodge tau-function in the explicit form of the Virasoro equations. The expression of our Virasoro constraints is simply a linear combination of the Virasoro operators, where the coefficients are restored from a power series for the Lambert W function. Then, using this result, we deduce a simple version of the Virasoro constraints for the linear Hodge partition function, where the coefficients are restored from the Gamma function. Finally, we establish the equivalence relation between the Virasoro constraints and polynomial recursion formula for the linear Hodge integrals.

  7. Toward An Ontology of Mutual Recursion: Models, Mind and Media

    Directory of Open Access Journals (Sweden)

    Mat Wall-Smith

    2008-01-01

    Full Text Available In Parables for the Virtual Massumi describes 'The Autonomy of Affect' in our ecology of thought (Massumi 2002 : 35. The object of Stiegler's Technics and Time is 'technics apprehended as the horizon of all possibility to come and all possibility of a future' (Stiegler 1998 : ix. The ecological dynamic described by the recursion between this 'affective autonomy' and a 'technical horizon of possibility' describes a metamodel of the relation between body and world, between perception and expression. I argue that this metamodel allows for the technical architectures that enshrine media processes and models as both the manifestation and modulation of the 'industry' or vitality of mind. I argue that these technical architectures are crucial to the creation and maintenance of dynamic ecologies of living.

  8. A nested recursive logit model for route choice analysis

    DEFF Research Database (Denmark)

    Mai, Tien; Frejinger, Emma; Fosgerau, Mogens

    2015-01-01

    We propose a route choice model that relaxes the independence from irrelevant alternatives property of the logit model by allowing scale parameters to be link specific. Similar to the recursive logit (RL) model proposed by Fosgerau et al. (2013), the choice of path is modeled as a sequence of link...... choices and the model does not require any sampling of choice sets. Furthermore, the model can be consistently estimated and efficiently used for prediction.A key challenge lies in the computation of the value functions, i.e. the expected maximum utility from any position in the network to a destination....... The value functions are the solution to a system of non-linear equations. We propose an iterative method with dynamic accuracy that allows to efficiently solve these systems.We report estimation results and a cross-validation study for a real network. The results show that the NRL model yields sensible...

  9. An algebraic approach to analysis of recursive and concurrent programs

    DEFF Research Database (Denmark)

    Terepeta, Michal Tomasz

    This thesis focuses on formal techniques based on static program analysis, model checking and abstract interpretation that offer means for reasoning about software, verification of its properties and discovering potential bugs. First, we investigate an algebraic approach to static analysis...... the soundness or completeness results. Moreover, we present a new application of pushdown systems in the context of an aspect-oriented process calculus. The addition of aspect-oriented features makes it possible for a process to exhibit a recursive structure. We show how one can faithfully model and analyze...... such a language. We also introduce an abstract domain that symbolically represents the messages sent between the concurrently executing processes. It stores prefixes or suffixes of communication traces including various constraints imposed on the messages. Since the problem has exponential complexity, we also...

  10. Stochastic Recursive Algorithms for Optimization Simultaneous Perturbation Methods

    CERN Document Server

    Bhatnagar, S; Prashanth, L A

    2013-01-01

    Stochastic Recursive Algorithms for Optimization presents algorithms for constrained and unconstrained optimization and for reinforcement learning. Efficient perturbation approaches form a thread unifying all the algorithms considered. Simultaneous perturbation stochastic approximation and smooth fractional estimators for gradient- and Hessian-based methods are presented. These algorithms: • are easily implemented; • do not require an explicit system model; and • work with real or simulated data. Chapters on their application in service systems, vehicular traffic control and communications networks illustrate this point. The book is self-contained with necessary mathematical results placed in an appendix. The text provides easy-to-use, off-the-shelf algorithms that are given detailed mathematical treatment so the material presented will be of significant interest to practitioners, academic researchers and graduate students alike. The breadth of applications makes the book appropriate for reader from sim...

  11. A Frequency Multiplier Based on Time Recursive Processing

    Directory of Open Access Journals (Sweden)

    D. M. Perisic

    2017-12-01

    Full Text Available This paper describes a digital frequency multiplier for a pulse rate. The multiplier is based on the recursive processing of the input and output periods and their time differences. Special emphasis is devoted to the techniques which provide the development of multipliers based on this principle. The circuit is defined by two system parameters. One is the ratio of two clock frequencies and the other is a division factor of a binary counter. The realization of the circuit is described. The region of the system parameters for the stable circuit is presented. The different aspects of applications and limitations in realization of the circuit are considered. All mathematical analyses are made using a Z transform approach. It is shown that the circuit can be also used in tracking and prediction applications. Computer simulations are performed to prove the correctness of the math and the whole approach.

  12. Learning to play Go using recursive neural networks.

    Science.gov (United States)

    Wu, Lin; Baldi, Pierre

    2008-11-01

    Go is an ancient board game that poses unique opportunities and challenges for artificial intelligence. Currently, there are no computer Go programs that can play at the level of a good human player. However, the emergence of large repositories of games is opening the door for new machine learning approaches to address this challenge. Here we develop a machine learning approach to Go, and related board games, focusing primarily on the problem of learning a good evaluation function in a scalable way. Scalability is essential at multiple levels, from the library of local tactical patterns, to the integration of patterns across the board, to the size of the board itself. The system we propose is capable of automatically learning the propensity of local patterns from a library of games. Propensity and other local tactical information are fed into recursive neural networks, derived from a probabilistic Bayesian network architecture. The recursive neural networks in turn integrate local information across the board in all four cardinal directions and produce local outputs that represent local territory ownership probabilities. The aggregation of these probabilities provides an effective strategic evaluation function that is an estimate of the expected area at the end, or at various other stages, of the game. Local area targets for training can be derived from datasets of games played by human players. In this approach, while requiring a learning time proportional to N(4), skills learned on a board of size N(2) can easily be transferred to boards of other sizes. A system trained using only 9 x 9 amateur game data performs surprisingly well on a test set derived from 19 x 19 professional game data. Possible directions for further improvements are briefly discussed.

  13. Generic Ising trees

    DEFF Research Database (Denmark)

    Durhuus, Bergfinnur Jøgvan; Napolitano, George Maria

    2012-01-01

    The Ising model on a class of infinite random trees is defined as a thermodynamiclimit of finite systems. A detailed description of the corresponding distribution of infinite spin configurations is given. As an application, we study the magnetization properties of such systems and prove that they......The Ising model on a class of infinite random trees is defined as a thermodynamiclimit of finite systems. A detailed description of the corresponding distribution of infinite spin configurations is given. As an application, we study the magnetization properties of such systems and prove...

  14. Theory of Mind Development in Adolescence and Early Adulthood: The Growing Complexity of Recursive Thinking Ability

    Science.gov (United States)

    Valle, Annalisa; Massaro, Davide; Castelli, Ilaria; Marchetti, Antonella

    2015-01-01

    This study explores the development of theory of mind, operationalized as recursive thinking ability, from adolescence to early adulthood (N = 110; young adolescents = 47; adolescents = 43; young adults = 20). The construct of theory of mind has been operationalized in two different ways: as the ability to recognize the correct mental state of a character, and as the ability to attribute the correct mental state in order to predict the character’s behaviour. The Imposing Memory Task, with five recursive thinking levels, and a third-order false-belief task with three recursive thinking levels (devised for this study) have been used. The relationship among working memory, executive functions, and linguistic skills are also analysed. Results show that subjects exhibit less understanding of elevated recursive thinking levels (third, fourth, and fifth) compared to the first and second levels. Working memory is correlated with total recursive thinking, whereas performance on the linguistic comprehension task is related to third level recursive thinking in both theory of mind tasks. An effect of age on third-order false-belief task performance was also found. A key finding of the present study is that the third-order false-belief task shows significant age differences in the application of recursive thinking that involves the prediction of others’ behaviour. In contrast, such an age effect is not observed in the Imposing Memory Task. These results may support the extension of the investigation of the third order false belief after childhood. PMID:27247645

  15. Theory of Mind Development in Adolescence and Early Adulthood: The Growing Complexity of Recursive Thinking Ability

    Directory of Open Access Journals (Sweden)

    Annalisa Valle

    2015-02-01

    Full Text Available This study explores the development of theory of mind, operationalized as recursive thinking ability, from adolescence to early adulthood (N = 110; young adolescents = 47; adolescents = 43; young adults = 20. The construct of theory of mind has been operationalized in two different ways: as the ability to recognize the correct mental state of a character, and as the ability to attribute the correct mental state in order to predict the character’s behaviour. The Imposing Memory Task, with five recursive thinking levels, and a third-order false-belief task with three recursive thinking levels (devised for this study have been used. The relationship among working memory, executive functions, and linguistic skills are also analysed. Results show that subjects exhibit less understanding of elevated recursive thinking levels (third, fourth, and fifth compared to the first and second levels. Working memory is correlated with total recursive thinking, whereas performance on the linguistic comprehension task is related to third level recursive thinking in both theory of mind tasks. An effect of age on third-order false-belief task performance was also found. A key finding of the present study is that the third-order false-belief task shows significant age differences in the application of recursive thinking that involves the prediction of others’ behaviour. In contrast, such an age effect is not observed in the Imposing Memory Task. These results may support the extension of the investigation of the third order false belief after childhood.

  16. Attention trees and semantic paths

    Science.gov (United States)

    Giusti, Christian; Pieroni, Goffredo G.; Pieroni, Laura

    2007-02-01

    In the last few decades several techniques for image content extraction, often based on segmentation, have been proposed. It has been suggested that under the assumption of very general image content, segmentation becomes unstable and classification becomes unreliable. According to recent psychological theories, certain image regions attract the attention of human observers more than others and, generally, the image main meaning appears concentrated in those regions. Initially, regions attracting our attention are perceived as a whole and hypotheses on their content are formulated; successively the components of those regions are carefully analyzed and a more precise interpretation is reached. It is interesting to observe that an image decomposition process performed according to these psychological visual attention theories might present advantages with respect to a traditional segmentation approach. In this paper we propose an automatic procedure generating image decomposition based on the detection of visual attention regions. A new clustering algorithm taking advantage of the Delaunay- Voronoi diagrams for achieving the decomposition target is proposed. By applying that algorithm recursively, starting from the whole image, a transformation of the image into a tree of related meaningful regions is obtained (Attention Tree). Successively, a semantic interpretation of the leaf nodes is carried out by using a structure of Neural Networks (Neural Tree) assisted by a knowledge base (Ontology Net). Starting from leaf nodes, paths toward the root node across the Attention Tree are attempted. The task of the path consists in relating the semantics of each child-parent node pair and, consequently, in merging the corresponding image regions. The relationship detected in this way between two tree nodes generates, as a result, the extension of the interpreted image area through each step of the path. The construction of several Attention Trees has been performed and partial

  17. A Comparative Assessment of the Influences of Human Impacts on Soil Cd Concentrations Based on Stepwise Linear Regression, Classification and Regression Tree, and Random Forest Models.

    Science.gov (United States)

    Qiu, Lefeng; Wang, Kai; Long, Wenli; Wang, Ke; Hu, Wei; Amable, Gabriel S

    2016-01-01

    Soil cadmium (Cd) contamination has attracted a great deal of attention because of its detrimental effects on animals and humans. This study aimed to develop and compare the performances of stepwise linear regression (SLR), classification and regression tree (CART) and random forest (RF) models in the prediction and mapping of the spatial distribution of soil Cd and to identify likely sources of Cd accumulation in Fuyang County, eastern China. Soil Cd data from 276 topsoil (0-20 cm) samples were collected and randomly divided into calibration (222 samples) and validation datasets (54 samples). Auxiliary data, including detailed land use information, soil organic matter, soil pH, and topographic data, were incorporated into the models to simulate the soil Cd concentrations and further identify the main factors influencing soil Cd variation. The predictive models for soil Cd concentration exhibited acceptable overall accuracies (72.22% for SLR, 70.37% for CART, and 75.93% for RF). The SLR model exhibited the largest predicted deviation, with a mean error (ME) of 0.074 mg/kg, a mean absolute error (MAE) of 0.160 mg/kg, and a root mean squared error (RMSE) of 0.274 mg/kg, and the RF model produced the results closest to the observed values, with an ME of 0.002 mg/kg, an MAE of 0.132 mg/kg, and an RMSE of 0.198 mg/kg. The RF model also exhibited the greatest R2 value (0.772). The CART model predictions closely followed, with ME, MAE, RMSE, and R2 values of 0.013 mg/kg, 0.154 mg/kg, 0.230 mg/kg and 0.644, respectively. The three prediction maps generally exhibited similar and realistic spatial patterns of soil Cd contamination. The heavily Cd-affected areas were primarily located in the alluvial valley plain of the Fuchun River and its tributaries because of the dramatic industrialization and urbanization processes that have occurred there. The most important variable for explaining high levels of soil Cd accumulation was the presence of metal smelting industries. The

  18. A Comparative Assessment of the Influences of Human Impacts on Soil Cd Concentrations Based on Stepwise Linear Regression, Classification and Regression Tree, and Random Forest Models.

    Directory of Open Access Journals (Sweden)

    Lefeng Qiu

    Full Text Available Soil cadmium (Cd contamination has attracted a great deal of attention because of its detrimental effects on animals and humans. This study aimed to develop and compare the performances of stepwise linear regression (SLR, classification and regression tree (CART and random forest (RF models in the prediction and mapping of the spatial distribution of soil Cd and to identify likely sources of Cd accumulation in Fuyang County, eastern China. Soil Cd data from 276 topsoil (0-20 cm samples were collected and randomly divided into calibration (222 samples and validation datasets (54 samples. Auxiliary data, including detailed land use information, soil organic matter, soil pH, and topographic data, were incorporated into the models to simulate the soil Cd concentrations and further identify the main factors influencing soil Cd variation. The predictive models for soil Cd concentration exhibited acceptable overall accuracies (72.22% for SLR, 70.37% for CART, and 75.93% for RF. The SLR model exhibited the largest predicted deviation, with a mean error (ME of 0.074 mg/kg, a mean absolute error (MAE of 0.160 mg/kg, and a root mean squared error (RMSE of 0.274 mg/kg, and the RF model produced the results closest to the observed values, with an ME of 0.002 mg/kg, an MAE of 0.132 mg/kg, and an RMSE of 0.198 mg/kg. The RF model also exhibited the greatest R2 value (0.772. The CART model predictions closely followed, with ME, MAE, RMSE, and R2 values of 0.013 mg/kg, 0.154 mg/kg, 0.230 mg/kg and 0.644, respectively. The three prediction maps generally exhibited similar and realistic spatial patterns of soil Cd contamination. The heavily Cd-affected areas were primarily located in the alluvial valley plain of the Fuchun River and its tributaries because of the dramatic industrialization and urbanization processes that have occurred there. The most important variable for explaining high levels of soil Cd accumulation was the presence of metal smelting industries

  19. Flowering Trees

    Indian Academy of Sciences (India)

    Flowering Trees. Brachichiton acerifolius F. Muell., commonly called as the Illawara flame tree is a member of Malvaceae family and is native to sub-tropical parts of Australia. Due to its spectacular flowers and tolerance to wide range of climates, it's now cultivated all over the world for its beauty. The tree produces flowers ...

  20. 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 crowded at the branch ends; leaflets 8–14 pairs, very variable in shape and with irregularly toothed margin. Flowers are small and appear in large, lax, often ...

  1. Flowering Trees

    Indian Academy of Sciences (India)

    Srimath

    Flowering Trees. Grevillea robusta A. Cunn. ex R. Br. (Sil- ver Oak) of Proteaceae is a daintily lacy ornamental tree while young and growing into a mighty tree (45 m). Young shoots are silvery grey and the leaves are fern- like. Flowers are golden-yellow in one- sided racemes (10 cm). Fruit is a boat- shaped, woody follicle.

  2. 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 when cut. Leaves are once compound and are crowded at the branch ...

  3. Flowering Trees

    Indian Academy of Sciences (India)

    Srimath

    Flowering Trees. Couroupita guianensis Abul (Cannonball tree) of Lecythidaceae is a large semi-evergreen tree with a straight bole and spreading crown. Leaves are simple and clustered at the end of short branches. Flowers are large, showy, strongly scented with six fleshy perianth lobes. They are borne on long woody ...

  4. Sequent Calculus in the Topos of Trees

    DEFF Research Database (Denmark)

    Clouston, Ranald; Goré, Rajeev

    2015-01-01

    Nakano’s “later” modality, inspired by Gödel-Löb provability logic, has been applied in type systems and program logics to capture guarded recursion. Birkedal et al modelled this modality via the internal logic of the topos of trees. We show that the semantics of the propositional fragment...... that decomposes implication into its static and irreflexive components. Our calculus provides deterministic and terminating backward proof-search, yields decidability of the logic and the coNP-completeness of its validity problem. Our calculus and decision procedure can be restricted to drop linearity and hence...

  5. Piecewise exponential survival trees with time-dependent covariates.

    Science.gov (United States)

    Huang, X; Chen, S; Soong, S J

    1998-12-01

    Survival trees methods are nonparametric alternatives to the semiparametric Cox regression in survival analysis. In this paper, a tree-based method for censored survival data with time-dependent covariates is proposed. The proposed method assumes a very general model for the hazard function and is fully nonparametric. The recursive partitioning algorithm uses the likelihood estimation procedure to grow trees under a piecewise exponential structure that handles time-dependent covariates in a parallel way to time-independent covariates. In general, the estimated hazard at a node gives the risk for a group of individuals during a specific time period. Both cross-validation and bootstrap resampling techniques are implemented in the tree selection procedure. The performance of the proposed survival trees method is shown to be good through simulation and application to real data.

  6. Multi-Resolution Seismic Tomography Based on Recursive Tessellation Hierarchy

    Energy Technology Data Exchange (ETDEWEB)

    Simmons, N A; Myers, S C; Ramirez, A

    2009-07-01

    A 3-D global tomographic model that reconstructs velocity structure at multiple scales and incorporates laterally variable seismic discontinuities is currently being developed. The model parameterization is node-based where nodes are placed along vertices defined by triangular tessellations of a spheroidal surface. The triangular tessellation framework is hierarchical. Starting with a tetrahexahedron representing the whole globe (1st level of the hierarchy, 24 faces), they divide each triangle of the tessellation into daughter triangles. The collection of all daughter triangles comprises the 2nd level of the tessellation hierarchy and further recursion produces an arbitrary number of tessellation levels and arbitrarily fine node-spacing. They have developed an inversion procedure that takes advantage of the recursive properties of the tessellation hierarchies by progressively solving for shorter wavelength heterogeneities. In this procedure, we first perform the tomographic inversion using a tessellation level with coarse node spacing. They find that a coarse node spacing of approximately 8{sup o} is adequate to capture bulk regional properties. They then conduct the tomographic inversion on a 4{sup o} tessellation level using the residuals and inversion results from the 8{sup o} run. In practice they find that the progressive tomography approach is robust, providing an intrinsic regularization for inversion stability and avoids the issue of predefining resolution levels. Further, determining average regional properties with coarser tessellation levels enables long-wavelength heterogeneities to account for sparsely sampled regions (or regions of the mantle where longer wavelength patterns of heterogeneity suffice) while allowing shorter length-scale heterogeneities to emerge where necessary. They demonstrate the inversion approach with a set of synthetic test cases that mimic the complex nature of data arrangements (mixed-determined inversion) common to most

  7. Determinants for swine mycoplasmal pneumonia reproduction under experimental conditions: A systematic review and recursive partitioning analysis.

    Directory of Open Access Journals (Sweden)

    Beatriz Garcia-Morante

    Full Text Available One of the main Mycoplasma hyopneumoniae (M. hyopneumoniae swine experimental model objectives is to reproduce mycoplasmal pneumonia (MP. Unfortunately, experimental validated protocols to maximize the chance to successfully achieve lung lesions induced by M. hyopneumoniae are not available at the moment. Thus, the objective of this work was to identify those factors that might have a major influence on the effective development of MP, measured as macroscopic lung lesions, under experimental conditions. Data from 85 studies describing M. hyopneumoniae inoculation experiments were compiled by means of a systematic review and analyzed thereafter. Several variables were considered in the analyses such as the number of pigs in the experiment, serological status against M. hyopneumoniae, source of the animals, age at inoculation, type of inoculum, strain of M. hyopneumoniae, route, dose and times of inoculation, study duration and co-infection with other swine pathogens. Descriptive statistics were used to depict M. hyopneumoniae experimental model main characteristics whereas a recursive partitioning approach, using regression trees, assessed the importance of the abovementioned experimental variables as MP triggering factors. A strong link between the time period between challenge and necropsies and lung lesion severity was observed. Results indicated that the most important factors to explain the observed lung lesion score variability were: (1 study duration, (2 M. hyopneumoniae strain, (3 age at inoculation, (4 co-infection with other swine pathogens and (5 animal source. All other studied variables were not relevant to explain the variability on M. hyopneumoniae lung lesions. The results provided in the present work may serve as a basis for debate in the search for a universally accepted M. hyopneumoniae challenge model.

  8. Determinants for swine mycoplasmal pneumonia reproduction under experimental conditions: A systematic review and recursive partitioning analysis.

    Science.gov (United States)

    Garcia-Morante, Beatriz; Segalés, Joaquim; Serrano, Emmanuel; Sibila, Marina

    2017-01-01

    One of the main Mycoplasma hyopneumoniae (M. hyopneumoniae) swine experimental model objectives is to reproduce mycoplasmal pneumonia (MP). Unfortunately, experimental validated protocols to maximize the chance to successfully achieve lung lesions induced by M. hyopneumoniae are not available at the moment. Thus, the objective of this work was to identify those factors that might have a major influence on the effective development of MP, measured as macroscopic lung lesions, under experimental conditions. Data from 85 studies describing M. hyopneumoniae inoculation experiments were compiled by means of a systematic review and analyzed thereafter. Several variables were considered in the analyses such as the number of pigs in the experiment, serological status against M. hyopneumoniae, source of the animals, age at inoculation, type of inoculum, strain of M. hyopneumoniae, route, dose and times of inoculation, study duration and co-infection with other swine pathogens. Descriptive statistics were used to depict M. hyopneumoniae experimental model main characteristics whereas a recursive partitioning approach, using regression trees, assessed the importance of the abovementioned experimental variables as MP triggering factors. A strong link between the time period between challenge and necropsies and lung lesion severity was observed. Results indicated that the most important factors to explain the observed lung lesion score variability were: (1) study duration, (2) M. hyopneumoniae strain, (3) age at inoculation, (4) co-infection with other swine pathogens and (5) animal source. All other studied variables were not relevant to explain the variability on M. hyopneumoniae lung lesions. The results provided in the present work may serve as a basis for debate in the search for a universally accepted M. hyopneumoniae challenge model.

  9. Prognostic factors for survival in adult patients with recurrent glioblastoma: a decision-tree-based model.

    Science.gov (United States)

    Audureau, Etienne; Chivet, Anaïs; Ursu, Renata; Corns, Robert; Metellus, Philippe; Noel, Georges; Zouaoui, Sonia; Guyotat, Jacques; Le Reste, Pierre-Jean; Faillot, Thierry; Litre, Fabien; Desse, Nicolas; Petit, Antoine; Emery, Evelyne; Lechapt-Zalcman, Emmanuelle; Peltier, Johann; Duntze, Julien; Dezamis, Edouard; Voirin, Jimmy; Menei, Philippe; Caire, François; Dam Hieu, Phong; Barat, Jean-Luc; Langlois, Olivier; Vignes, Jean-Rodolphe; Fabbro-Peray, Pascale; Riondel, Adeline; Sorbets, Elodie; Zanello, Marc; Roux, Alexandre; Carpentier, Antoine; Bauchet, Luc; Pallud, Johan

    2017-11-20

    We assessed prognostic factors in relation to OS from progression in recurrent glioblastomas. Retrospective multicentric study enrolling 407 (training set) and 370 (external validation set) adult patients with a recurrent supratentorial glioblastoma treated by surgical resection and standard combined chemoradiotherapy as first-line treatment. Four complementary multivariate prognostic models were evaluated: Cox proportional hazards regression modeling, single-tree recursive partitioning, random survival forest, conditional random forest. Median overall survival from progression was 7.6 months (mean, 10.1; range, 0-86) and 8.0 months (mean, 8.5; range, 0-56) in the training and validation sets, respectively (p = 0.900). Using the Cox model in the training set, independent predictors of poorer overall survival from progression included increasing age at histopathological diagnosis (aHR, 1.47; 95% CI [1.03-2.08]; p = 0.032), RTOG-RPA V-VI classes (aHR, 1.38; 95% CI [1.11-1.73]; p = 0.004), decreasing KPS at progression (aHR, 3.46; 95% CI [2.10-5.72]; p < 0.001), while independent predictors of longer overall survival from progression included surgical resection (aHR, 0.57; 95% CI [0.44-0.73]; p < 0.001) and chemotherapy (aHR, 0.41; 95% CI [0.31-0.55]; p < 0.001). Single-tree recursive partitioning identified KPS at progression, surgical resection at progression, chemotherapy at progression, and RTOG-RPA class at histopathological diagnosis, as main survival predictors in the training set, yielding four risk categories highly predictive of overall survival from progression both in training (p < 0.0001) and validation (p < 0.0001) sets. Both random forest approaches identified KPS at progression as the most important survival predictor. Age, KPS at progression, RTOG-RPA classes, surgical resection at progression and chemotherapy at progression are prognostic for survival in recurrent glioblastomas and should inform the treatment decisions.

  10. A parallel implementation of multilevel recursive spectral bisection for application to adaptive unstructured meshes

    Energy Technology Data Exchange (ETDEWEB)

    Barnard, S.T.; Simon, H. [NASA Ames Research Center, Moffett Field, CA (United States)

    1995-12-01

    The design of a parallel implementation of multilevel recursive spectral bisection is described. The goal is to implement a code that is fast enough to enable dynamic repartitioning of adaptive meshes.

  11. Decoding development in the XXI century: subjectivity, complexity, sinapsis, sinergy, recursivity, lidership and territorial dependency

    National Research Council Canada - National Science Library

    Sergio Boisier

    2010-01-01

      BOISIER, Sergio. Decoding development in the XXI century: subjectivity, complexity, sinapsis, sinergy, recursivity, lidership and territorial dependency. Semest. Econ. [online]. 2010, vol.13, n.27, pp. 11-37. ISSN 0120-6346...

  12. Recursive Construction Of Jacobian Matrix And Its Time Derivative For Robot Arm

    Science.gov (United States)

    Kreutz, Kenneth K.

    1990-01-01

    Report discusses recursive calculation of Jacobian matrix (J) and derivative of matrix with respect to time (J) for robot arm that has multiple rotary joints. Such calculations used for implementation of linearizing feedback in digital control system for arm.

  13. Nonlinear dynamics for charges particle beams with a curved axis in the matrix - recursive model

    Energy Technology Data Exchange (ETDEWEB)

    Dymnikov, A.D. [University of St Petersburg, (Russian Federation). Institute of Computational Mathematics and Control Process

    1993-12-31

    In this paper a new matrix and recursive approach has been outlined for treating nonlinear optics of charged particle beams. This approach is a new analytical and computational tool for designers of optimal beam control systems. 9 refs.

  14. A Parallel Implementation of Multilevel Recursive Spectral Bisection for Application to Adaptive Unstructured Meshes. Chapter 1

    Science.gov (United States)

    Barnard, Stephen T.; Simon, Horst; Lasinski, T. A. (Technical Monitor)

    1994-01-01

    The design of a parallel implementation of multilevel recursive spectral bisection is described. The goal is to implement a code that is fast enough to enable dynamic repartitioning of adaptive meshes.

  15. Implicit Learning of Recursive Context-Free Grammars

    Science.gov (United States)

    Rohrmeier, Martin; Fu, Qiufang; Dienes, Zoltan

    2012-01-01

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

  16. Decision-Directed Recursive Least Squares MIMO Channels Tracking

    Directory of Open Access Journals (Sweden)

    2006-01-01

    Full Text Available A new approach for joint data estimation and channel tracking for multiple-input multiple-output (MIMO channels is proposed based on the decision-directed recursive least squares (DD-RLS algorithm. RLS algorithm is commonly used for equalization and its application in channel estimation is a novel idea. In this paper, after defining the weighted least squares cost function it is minimized and eventually the RLS MIMO channel estimation algorithm is derived. The proposed algorithm combined with the decision-directed algorithm (DDA is then extended for the blind mode operation. From the computational complexity point of view being O3 versus the number of transmitter and receiver antennas, the proposed algorithm is very efficient. Through various simulations, the mean square error (MSE of the tracking of the proposed algorithm for different joint detection algorithms is compared with Kalman filtering approach which is one of the most well-known channel tracking algorithms. It is shown that the performance of the proposed algorithm is very close to Kalman estimator and that in the blind mode operation it presents a better performance with much lower complexity irrespective of the need to know the channel model.

  17. Decision-Directed Recursive Least Squares MIMO Channels Tracking

    Directory of Open Access Journals (Sweden)

    Karami Ebrahim

    2006-01-01

    Full Text Available A new approach for joint data estimation and channel tracking for multiple-input multiple-output (MIMO channels is proposed based on the decision-directed recursive least squares (DD-RLS algorithm. RLS algorithm is commonly used for equalization and its application in channel estimation is a novel idea. In this paper, after defining the weighted least squares cost function it is minimized and eventually the RLS MIMO channel estimation algorithm is derived. The proposed algorithm combined with the decision-directed algorithm (DDA is then extended for the blind mode operation. From the computational complexity point of view being versus the number of transmitter and receiver antennas, the proposed algorithm is very efficient. Through various simulations, the mean square error (MSE of the tracking of the proposed algorithm for different joint detection algorithms is compared with Kalman filtering approach which is one of the most well-known channel tracking algorithms. It is shown that the performance of the proposed algorithm is very close to Kalman estimator and that in the blind mode operation it presents a better performance with much lower complexity irrespective of the need to know the channel model.

  18. Implicit learning of recursive context-free grammars.

    Directory of Open Access Journals (Sweden)

    Martin Rohrmeier

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

  19. Recursive least mean p-power Extreme Learning Machine.

    Science.gov (United States)

    Yang, Jing; Ye, Feng; Rong, Hai-Jun; Chen, Badong

    2017-07-01

    As real industrial processes have measurement samples with noises of different statistical characteristics and obtain the sample one by one usually, on-line sequential learning algorithms which can achieve better learning performance for systems with noises of various statistics are necessary. This paper proposes a new online Extreme Learning Machine (ELM, of Huang et al.) algorithm, namely recursive least mean p-power ELM (RLMP-ELM). In RLMP-ELM, a novel error criterion for cost function, namely the least mean p-power (LMP) error criterion, provides a mechanism to update the output weights sequentially. The LMP error criterion aims to minimize the mean p-power of the error that is the generalization of the mean square error criterion used in the ELM. The proposed on-line learning algorithm is able to provide on-line predictions of variables with noises of different statistics and obtains better performance than ELM and online sequential ELM (OS-ELM) while the non-Gaussian noises impact the processes. Simulations are reported to demonstrate the performance and effectiveness of the proposed methods. Copyright © 2017 Elsevier Ltd. All rights reserved.

  20. Strategy as practice:recursiveness, adaptation, and practices-in-use

    OpenAIRE

    Jarzabkowski, P.

    2004-01-01

    In this article, a social theory framework is developed to explain the common themes of recursive and adaptive practice underpinning the existing strategic management literature. In practice, there is a coexistent tension between recursive and adaptive forms of strategic action that spans multiple levels from macro-institutional and competitive contexts to within-firm levels of analysis to individual cognition. This tension may be better understood by examining how management practices are us...

  1. Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA

    DEFF Research Database (Denmark)

    Conradie, Willem; Goranko, Valentin; Vakarelov, Dimiter

    2010-01-01

    The previously introduced algorithm SQEMA computes first-order frame equivalents for modal formulae and also proves their canonicity. Here we extend SQEMA with an additional rule based on a recursive version of Ackermann's lemma, which enables the algorithm to compute local frame equivalents of m...... on the class of ‘recursive formulae’. We also show that a certain version of this algorithm guarantees the canonicity of the formulae on which it succeeds....

  2. Estimation of Mechanical Signals in Induction Motors using the Recursive Prediction Error Method

    DEFF Research Database (Denmark)

    Børsting, H.; Knudsen, Morten; Rasmussen, Henrik

    1993-01-01

    Sensor feedback of mechanical quantities for control applications in induction motors is troublesome and relative expensive. In this paper a recursive prediction error (RPE) method has successfully been used to estimate the angular rotor speed ........Sensor feedback of mechanical quantities for control applications in induction motors is troublesome and relative expensive. In this paper a recursive prediction error (RPE) method has successfully been used to estimate the angular rotor speed .....

  3. Understanding search trees via statistical physics

    Indian Academy of Sciences (India)

    http://www.ias.ac.in/article/fulltext/pram/064/06/1175-1189. Keywords. Search trees; fragmentation; travelling fronts; phase transition. Abstract. We study the random -ary search tree model (where stands for the number of branches of the search tree), an important problem for data storage in computer science, using a ...

  4. Exploratory Decision-Tree Modeling of Data from the Randomized REACTT Trial of Tadalafil Versus Placebo to Predict Recovery of Erectile Function After Bilateral Nerve-Sparing Radical Prostatectomy.

    Science.gov (United States)

    Montorsi, Francesco; Oelke, Matthias; Henneges, Carsten; Brock, Gerald; Salonia, Andrea; d'Anzeo, Gianluca; Rossi, Andrea; Mulhall, John P; Büttner, Hartwig

    2016-09-01

    Understanding predictors for the recovery of erectile function (EF) after nerve-sparing radical prostatectomy (nsRP) might help clinicians and patients in preoperative counseling and expectation management of EF rehabilitation strategies. To describe the effect of potential predictors on EF recovery after nsRP by post hoc decision-tree modeling of data from A Study of Tadalafil After Radical Prostatectomy (REACTT). Randomized double-blind double-dummy placebo-controlled trial in 423 men aged decision-tree models, using the International Index of Erectile Function-Erectile Function (IIEF-EF) domain score at the end of double-blind treatment, washout, and open-label treatment as response variable. Each model evaluated the association between potential predictors: presurgery IIEF domain and IIEF single-item scores, surgical approach, nerve-sparing score (NSS), and postsurgery randomized treatment group. The first decision-tree model (n=422, intention-to-treat population) identified high presurgery sexual desire (IIEF item 12: ≥3.5 and decision-tree analyses identified high presurgery sexual desire, confidence, and intercourse satisfaction as key predictors for EF recovery. Patients meeting these criteria might benefit the most from conserving surgery and early postsurgery EF rehabilitation. Strategies for improving EF after surgery should be discussed preoperatively with all patients; this information may support expectation management for functional recovery on an individual patient level. Understanding how patient characteristics and different treatment options affect the recovery of erectile function (EF) after radical surgery for prostate cancer might help physicians select the optimal treatment for their patients. This analysis of data from a clinical trial suggested that high presurgery sexual desire, sexual confidence, and intercourse satisfaction are key factors predicting EF recovery. Patients meeting these criteria might benefit the most from conserving

  5. Recursive Subsystems in Aphasia and Alzheimer's Disease: Case Studies in Syntax and Theory of Mind

    Science.gov (United States)

    Bánréti, Zoltán; Hoffmann, Ildikó; Vincze, Veronika

    2016-01-01

    The relationship between recursive sentence embedding and theory-of-mind (ToM) inference is investigated in three persons with Broca's aphasia, two persons with Wernicke's aphasia, and six persons with mild and moderate Alzheimer's disease (AD). We asked questions of four types about photographs of various real-life situations. Type 4 questions asked participants about intentions, thoughts, or utterances of the characters in the pictures (“What may X be thinking/asking Y to do?”). The expected answers typically involved subordinate clauses introduced by conjunctions or direct quotations of the characters' utterances. Broca's aphasics did not produce answers with recursive sentence embedding. Rather, they projected themselves into the characters' mental states and gave direct answers in the first person singular, with relevant ToM content. We call such replies “situative statements.” Where the question concerned the mental state of the character but did not require an answer with sentence embedding (“What does X hate?”), aphasics gave descriptive answers rather than situative statements. Most replies given by persons with AD to Type 4 questions were grammatical instances of recursive sentence embedding. They also gave a few situative statements but the ToM content of these was irrelevant. In more than one third of their well-formed sentence embeddings, too, they conveyed irrelevant ToM contents. Persons with moderate AD were unable to pass secondary false belief tests. The results reveal double dissociation: Broca's aphasics are unable to access recursive sentence embedding but they can make appropriate ToM inferences; moderate AD persons make the wrong ToM inferences but they are able to access recursive sentence embedding. The double dissociation may be relevant for the nature of the relationship between the two recursive capacities. Broca's aphasics compensated for the lack of recursive sentence embedding by recursive ToM reasoning represented in very

  6. Lossless image compression based on a generalized recursive interpolation

    Science.gov (United States)

    Aiazzi, Bruno; Alba, Pasquale S.; Alparone, Luciano; Baronti, Stefano; Lotti, Franco

    1996-09-01

    A variety of image compression algorithms exists for applications where reconstruction errors are tolerated. When lossless coding is mandatory, compression ratios greater than 2 or 3 are hard to obtain. DPCM techniques can be implemented in a hierarchical way, thus producing high- quality intermediate versions (tokens) of the input images at increasing spatial resolutions. Data retrieval and transmission can be achieved in a progressive fashion, either by stopping the process at the requested resolution level, or by recognizing that the image being retrieved is no longer of interest. However, progressiveness is usually realized with a certain performance penalty with respect to the reference DPCM (i.e., 4-pel optimum causal AR prediction). A generalized recursive interpolation (GRINT) algorithm is proposed and shown to be the most effective progressive technique for compression of still images. The main advantage of the novel scheme with respect to the standard hierarchical interpolation (HINT) is that interpolation is performed in a separable fashion from all error-free values, thereby reducing the variance of interpolation errors. Moreover, the introduction of a parametric half-band interpolation filter produces further benefits and allows generalized interpolation. An adaptive strategy consists of measuring image correlation both along rows and along columns and interpolating first along the direction of minimum correlation. The statistics of the different subband-like sets of interpolation errors are modeled as generalized Gaussian PDFs, and individual codebooks are fitted for variable length coding. The estimate of the shape factor of the PDF is based on a novel criterion matching the entropy of the theoretical and actual distributions. Performances are evaluated by comparing GRINT with HINT, and a variety of other multiresolution techniques. Optimum 4-pel causal DPCM and lossless JPEG are also considered for completeness of comparisons, although they are not

  7. Dynamics of Tree-Type Robotic Systems

    CERN Document Server

    Shah, Suril Vijaykumar; Dutt, Jayanta Kumar

    2013-01-01

    This book addresses dynamic modelling methodology and analyses of tree-type robotic systems. Such analyses are required to visualize the motion of a system without really building it. The book contains novel treatment of the tree-type systems using concept of kinematic modules and the corresponding Decoupled Natural Orthogonal Complements (DeNOC), unified representation of the multiple-degrees-of freedom-joints, efficient recursive dynamics algorithms, and detailed dynamic analyses of several legged robots. The book will help graduate students, researchers and practicing engineers in applying their knowledge of dynamics for analysis of complex robotic systems. The knowledge contained in the book will help one in virtual testing of robot operation, trajectory planning and control.

  8. Flowering Trees

    Indian Academy of Sciences (India)

    Srimath

    (Indian Coral Tree;Hindi:Pangra)of Leguminosae is a small, quick-growing deciduous tree with a small crown. Branches are covered with dark conical prickles, which fall off after some time. The leaves are compound with three leaflets. Bright red or scarlet flowers which appear following leaf fall are in clusters at branch ends.

  9. Talking Trees

    Science.gov (United States)

    Tolman, Marvin

    2005-01-01

    Students love outdoor activities and will love them even more when they build confidence in their tree identification and measurement skills. Through these activities, students will learn to identify the major characteristics of trees and discover how the pace--a nonstandard measuring unit--can be used to estimate not only distances but also the…

  10. Flowering Trees

    Indian Academy of Sciences (India)

    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 lobed, dark green above and pale grey underneath. They are 3-nerved from the base and often ...

  11. Flowering Trees

    Indian Academy of Sciences (India)

    Cassia siamia Lamk. (Siamese tree senna) of Caesalpiniaceae is a small or medium size handsome tree. Leaves are alternate, pinnately compound and glandular, upto 18 cm long with 8–12 pairs of leaflets. Inflorescence is axillary or terminal and branched. Flowering lasts for a long period from March to February.

  12. Flowering Trees

    Indian Academy of Sciences (India)

    Srimath

    Flowering Trees. Diospyros montana Roxb. (Mountain Ebony) of. Ebenaceae is a medium size deciduous tree with slim, straight trunk and narrow open crown. Leaves are simple, elliptic and leathery. Young leaves are covered with dense velvety growth of hairs. Flow- ers are small, unisexual, males in groups of four or.

  13. Flowering Trees

    Indian Academy of Sciences (India)

    Flowering Trees. Acrocarpus fraxinifolius Wight & Arn. (PINK CEDAR, AUSTRALIAN ASH) of. Caesalpiniaceae is a lofty unarmed deciduous native tree that attains a height of 30–60m with buttresses. Bark is thin and light grey. Leaves are compound and bright red when young. Flowers in dense, erect, axillary racemes.

  14. Flowering Trees

    Indian Academy of Sciences (India)

    IAS Admin

    Flowering Trees. Alangium salviifolium (L.f.) Wangerin ssp. salviifolium (SAGE-. LEAVED ALANGIUM) of Alangiaceae is a small deciduous tree, sometimes straggling and sometimes spinous. Leaves are alternate, variable, narrowly oblong or ovate-lanceolate. Flowers are in axillary fascicles. They are 1.5–2 cms long, white ...

  15. Flowering Trees

    Indian Academy of Sciences (India)

    Flowering Trees. Diospyros peregrina (Gaertn.) Guercke Syn. Diospyros embryopteris Pers., Diospyros malabarica Desr. (PALE MOON EBONY, RIBER EBONY) of Ebenaceae is a small or mid-sized slow-growing evergreen tree with spreading branches that form a dense crown. The bark is smooth, thick, dark and flakes off ...

  16. Flowering Trees

    Indian Academy of Sciences (India)

    Baccaurea courtallensis Muell.-Arg. of Euphorbiaceae is an evergreen tree that is very attractive when in flower. Leaves are alternate. Male and female flowers are borne on separate trees. Inflorescences bearing several flowers arise in tufts on tubercles on the stem. Fruits are crimson red in colour. Seeds are covered.

  17. :Flowering 'Trees

    Indian Academy of Sciences (India)

    :Flowering 'Trees. Prima Vera of Mexico (botanical name: Cybistex donell-smithii) The tree planted in 1973 in the RRllawn at the spot where Prof Raman s body was cremated on 21. November 1970 flowered with a magnificient golden crown on the concluding day of the Golden Jubilee of the Institute. 4th February 1999.

  18. The Language Faculty that Wasn't: A Usage-Based Account of Natural Language Recursion

    Directory of Open Access Journals (Sweden)

    Morten H Christiansen

    2015-08-01

    Full Text Available In the generative tradition, the language faculty has been shrinking—perhaps to include only the mechanism of recursion. This paper argues that even this view of the language faculty is too expansive. We first argue that a language faculty is difficult to reconcile with evolutionary considerations. We then focus on recursion as a detailed case study, arguing that our ability to process recursive structure does not rely on recursion as a property of the grammar, but instead emerge gradually by piggybacking on domain-general sequence learning abilities. Evidence from genetics, comparative work on non-human primates, and cognitive neuroscience suggests that humans have evolved complex sequence learning skills, which were subsequently pressed into service to accommodate language. Constraints on sequence learning therefore have played an important role in shaping the cultural evolution of linguistic structure, including our limited abilities for processing recursive structure. Finally, we re-evaluate some of the key considerations that have often been taken to require the postulation of a language faculty.

  19. Mining IP to Domain Name Interactions to Detect DNS Flood Attacks on Recursive DNS Servers

    Directory of Open Access Journals (Sweden)

    Roberto Alonso

    2016-08-01

    Full Text Available The Domain Name System (DNS is a critical infrastructure of any network, and, not surprisingly a common target of cybercrime. There are numerous works that analyse higher level DNS traffic to detect anomalies in the DNS or any other network service. By contrast, few efforts have been made to study and protect the recursive DNS level. In this paper, we introduce a novel abstraction of the recursive DNS traffic to detect a flooding attack, a kind of Distributed Denial of Service (DDoS. The crux of our abstraction lies on a simple observation: Recursive DNS queries, from IP addresses to domain names, form social groups; hence, a DDoS attack should result in drastic changes on DNS social structure. We have built an anomaly-based detection mechanism, which, given a time window of DNS usage, makes use of features that attempt to capture the DNS social structure, including a heuristic that estimates group composition. Our detection mechanism has been successfully validated (in a simulated and controlled setting and with it the suitability of our abstraction to detect flooding attacks. To the best of our knowledge, this is the first time that work is successful in using this abstraction to detect these kinds of attacks at the recursive level. Before concluding the paper, we motivate further research directions considering this new abstraction, so we have designed and tested two additional experiments which exhibit promising results to detect other types of anomalies in recursive DNS servers.

  20. Mining IP to Domain Name Interactions to Detect DNS Flood Attacks on Recursive DNS Servers.

    Science.gov (United States)

    Alonso, Roberto; Monroy, Raúl; Trejo, Luis A

    2016-08-17

    The Domain Name System (DNS) is a critical infrastructure of any network, and, not surprisingly a common target of cybercrime. There are numerous works that analyse higher level DNS traffic to detect anomalies in the DNS or any other network service. By contrast, few efforts have been made to study and protect the recursive DNS level. In this paper, we introduce a novel abstraction of the recursive DNS traffic to detect a flooding attack, a kind of Distributed Denial of Service (DDoS). The crux of our abstraction lies on a simple observation: Recursive DNS queries, from IP addresses to domain names, form social groups; hence, a DDoS attack should result in drastic changes on DNS social structure. We have built an anomaly-based detection mechanism, which, given a time window of DNS usage, makes use of features that attempt to capture the DNS social structure, including a heuristic that estimates group composition. Our detection mechanism has been successfully validated (in a simulated and controlled setting) and with it the suitability of our abstraction to detect flooding attacks. To the best of our knowledge, this is the first time that work is successful in using this abstraction to detect these kinds of attacks at the recursive level. Before concluding the paper, we motivate further research directions considering this new abstraction, so we have designed and tested two additional experiments which exhibit promising results to detect other types of anomalies in recursive DNS servers.

  1. Mining IP to Domain Name Interactions to Detect DNS Flood Attacks on Recursive DNS Servers

    Science.gov (United States)

    Alonso, Roberto; Monroy, Raúl; Trejo, Luis A.

    2016-01-01

    The Domain Name System (DNS) is a critical infrastructure of any network, and, not surprisingly a common target of cybercrime. There are numerous works that analyse higher level DNS traffic to detect anomalies in the DNS or any other network service. By contrast, few efforts have been made to study and protect the recursive DNS level. In this paper, we introduce a novel abstraction of the recursive DNS traffic to detect a flooding attack, a kind of Distributed Denial of Service (DDoS). The crux of our abstraction lies on a simple observation: Recursive DNS queries, from IP addresses to domain names, form social groups; hence, a DDoS attack should result in drastic changes on DNS social structure. We have built an anomaly-based detection mechanism, which, given a time window of DNS usage, makes use of features that attempt to capture the DNS social structure, including a heuristic that estimates group composition. Our detection mechanism has been successfully validated (in a simulated and controlled setting) and with it the suitability of our abstraction to detect flooding attacks. To the best of our knowledge, this is the first time that work is successful in using this abstraction to detect these kinds of attacks at the recursive level. Before concluding the paper, we motivate further research directions considering this new abstraction, so we have designed and tested two additional experiments which exhibit promising results to detect other types of anomalies in recursive DNS servers. PMID:27548169

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

  3. Recursive Subspace Identification of AUV Dynamic Model under General Noise Assumption

    Directory of Open Access Journals (Sweden)

    Zheping Yan

    2014-01-01

    Full Text Available A recursive subspace identification algorithm for autonomous underwater vehicles (AUVs is proposed in this paper. Due to the advantages at handling nonlinearities and couplings, the AUV model investigated here is for the first time constructed as a Hammerstein model with nonlinear feedback in the linear part. To better take the environment and sensor noises into consideration, the identification problem is concerned as an errors-in-variables (EIV one which means that the identification procedure is under general noise assumption. In order to make the algorithm recursively, propagator method (PM based subspace approach is extended into EIV framework to form the recursive identification method called PM-EIV algorithm. With several identification experiments carried out by the AUV simulation platform, the proposed algorithm demonstrates its effectiveness and feasibility.

  4. Puzzles in modern biology. II. Language, cancer and the recursive processes of evolutionary innovation.

    Science.gov (United States)

    Frank, Steven A

    2016-01-01

    Human language emerged abruptly. Diverse body forms evolved suddenly. Seed-bearing plants spread rapidly. How do complex evolutionary innovations arise so quickly? Resolving alternative claims remains difficult. The great events of the past happened a long time ago. Cancer provides a model to study evolutionary innovation. A tumor must evolve many novel traits to become an aggressive cancer. I use what we know or could study about cancer to describe the key processes of innovation. In general, evolutionary systems form a hierarchy of recursive processes. Those recursive processes determine the rates at which innovations are generated, spread and transmitted. I relate the recursive processes to abrupt evolutionary innovation.

  5. Design and Implementation of Recursive Model Predictive Control for Permanent Magnet Synchronous Motor Drives

    Directory of Open Access Journals (Sweden)

    Xuan Wu

    2015-01-01

    Full Text Available In order to control the permanent-magnet synchronous motor system (PMSM with different disturbances and nonlinearity, an improved current control algorithm for the PMSM systems using recursive model predictive control (RMPC is developed in this paper. As the conventional MPC has to be computed online, its iterative computational procedure needs long computing time. To enhance computational speed, a recursive method based on recursive Levenberg-Marquardt algorithm (RLMA and iterative learning control (ILC is introduced to solve the learning issue in MPC. RMPC is able to significantly decrease the computation cost of traditional MPC in the PMSM system. The effectiveness of the proposed algorithm has been verified by simulation and experimental results.

  6. The Tree Theme Method® (TTM), an occupational therapy intervention for treating depression and anxiety : Study protocol of a randomized controlled trial

    OpenAIRE

    Gunnarsson, Birgitta; Wagman, Petra; Håkansson, Carita; Hedin, Katarina

    2015-01-01

    Background Depression and anxiety disorders are increasing among the general population in the Western world. Individuals may need several kinds of treatment in order to maintain health, such as cognitive behavioural therapy (CBT) and drug treatment. However, having an everyday life that ?works? is also important, suggesting a need for interventions based on activities that facilitate a satisfying everyday life. There is still lack of such evidence-based interventions. The Tree Theme Method? ...

  7. 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...... navigational queries directly on the compressed representation. We show that the new compression scheme achieves close to optimal worst-case compression, can compress exponentially better than DAG compression, is never much worse than DAG compression, and supports navigational queries in logarithmic time....

  8. 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...... navigational queries directly on the compressed representation. We show that the new compression scheme achieves close to optimal worst-case compression, can compress exponentially better than DAG compression, is never much worse than DAG compression, and supports navigational queries in logarithmic time....

  9. In silico prediction of spleen tyrosine kinase inhibitors using machine learning approaches and an optimized molecular descriptor subset generated by recursive feature elimination method.

    Science.gov (United States)

    Li, Bing-Ke; Cong, Yong; Yang, Xue-Gang; Xue, Ying; Chen, Yi-Zong

    2013-05-01

    We tested four machine learning methods, support vector machine (SVM), k-nearest neighbor, back-propagation neural network and C4.5 decision tree for their capability in predicting spleen tyrosine kinase (Syk) inhibitors by using 2592 compounds which are more diverse than those in other studies. The recursive feature elimination method was used for improving prediction performance and selecting molecular descriptors responsible for distinguishing Syk inhibitors and non-inhibitors. Among four machine learning models, SVM produces the best performance at 99.18% for inhibitors and 98.82% for non-inhibitors, respectively, indicating that the SVM is potentially useful for facilitating the discovery of Syk inhibitors. Copyright © 2013 Elsevier Ltd. All rights reserved.

  10. The boundary length and point spectrum enumeration of partial chord diagrams using cut and join recursion

    DEFF Research Database (Denmark)

    Andersen, Jørgen Ellegaard; Fuji, Hiroyuki; Penner, Robert C.

    relation, which combined with an initial condition determines these numbers uniquely. This recursion relation is equivalent to a second order, non-linear, algebraic partial differential equation for the generating function of the numbers of partial chord diagrams filtered by the boundary length and point......We introduce the boundary length and point spectrum, as a joint generalization of the boundary length spectrum and boundary point spectrum in [1]. We establish by cut-and-join methods that the number of partial chord diagrams filtered by the boundary length and point spectrum satisfies a recursion...

  11. Recursive prediction error methods for online estimation in nonlinear state-space models

    Directory of Open Access Journals (Sweden)

    Dag Ljungquist

    1994-04-01

    Full Text Available Several recursive algorithms for online, combined state and parameter estimation in nonlinear state-space models are discussed in this paper. Well-known algorithms such as the extended Kalman filter and alternative formulations of the recursive prediction error method are included, as well as a new method based on a line-search strategy. A comparison of the algorithms illustrates that they are very similar although the differences can be important for the online tracking capabilities and robustness. Simulation experiments on a simple nonlinear process show that the performance under certain conditions can be improved by including a line-search strategy.

  12. Parameter Estimation of Permanent Magnet Synchronous Motor Using Orthogonal Projection and Recursive Least Squares Combinatorial Algorithm

    Directory of Open Access Journals (Sweden)

    Iman Yousefi

    2015-01-01

    Full Text Available This paper presents parameter estimation of Permanent Magnet Synchronous Motor (PMSM using a combinatorial algorithm. Nonlinear fourth-order space state model of PMSM is selected. This model is rewritten to the linear regression form without linearization. Noise is imposed to the system in order to provide a real condition, and then combinatorial Orthogonal Projection Algorithm and Recursive Least Squares (OPA&RLS method is applied in the linear regression form to the system. Results of this method are compared to the Orthogonal Projection Algorithm (OPA and Recursive Least Squares (RLS methods to validate the feasibility of the proposed method. Simulation results validate the efficacy of the proposed algorithm.

  13. Compositional generative mapping for tree-structured data--part II: topographic projection model.

    Science.gov (United States)

    Bacciu, D; Micheli, A; Sperduti, A

    2013-02-01

    We introduce GTM-SD (Generative Topographic Mapping for Structured Data), which is the first compositional generative model for topographic mapping of tree-structured data. GTM-SD exploits a scalable bottom-up hidden-tree Markov model that was introduced in Part I of this paper to achieve a recursive topographic mapping of hierarchical information. The proposed model allows efficient exploitation of contextual information from shared substructures by a recursive upward propagation on the tree structure which distributes substructure information across the topographic map. Compared to its noncompositional generative counterpart, GTM-SD is shown to allow the topographic mapping of the full sample tree, which includes a projection onto the lattice of all the distinct subtrees rooted in each of its nodes. Experimental results show that the continuous projection space generated by the smooth topographic mapping of GTM-SD yields a finer grained discrimination of the sample structures with respect to the state-of-the-art recursive neural network approach.

  14. Generation of Random Numbers and Parallel Random Number Streams for Monte Carlo Simulations

    Directory of Open Access Journals (Sweden)

    L. Yu. Barash

    2012-01-01

    Full Text Available Modern methods and libraries for high quality pseudorandom number generation and for generation of parallel random number streams for Monte Carlo simulations are considered. The probability equidistribution property and the parameters when the property holds at dimensions up to logarithm of mesh size are considered for Multiple Recursive Generators.

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

  16. A Simple Nonperiodic Random Number Generator: A Recursive Model for the Logistic Map

    Science.gov (United States)

    1992-01-01

    Engineering and Center for Space Physics Boston, MA. 02215 January 1992 Scientific Report No. 1 DTIC ELECTEJUL 20O1994 i Approved for public release...and Center for Space Physics Boston, MA. 02215 9. SPONSORING /MONITORING AGENCY NAME(S) AND ADORESS(ES) 10. SPONSORING/MONITORING Geophysics...impulse during World War II when simultaneously and independently Kolmogoroff in Russia, Onsager in the USA and Heisenberg (Ref. 19) and von Weizaker

  17. Rotorcraft Blade Mode Damping Identification from Random Responses Using a Recursive Maximum Likelihood Algorithm.

    Science.gov (United States)

    1982-09-01

    defined.) Prior knowledge of the approximate frequency band allows for pretest seleccion of the bandpass filter passband, which in turn permits...covariance of the parameter es-imate corrected for nonwhite innovations e natural logrithm basis, e = 2.71828 Fi generalized force scaled by generalized...process noise and measurement noise respectively ac standard deviation of damping parameter estimate W frequency, rad/sec. Wn, undamped natural frequency

  18. Decision trees and forests: a probabilistic perspective

    OpenAIRE

    Lakshminarayanan, B.

    2016-01-01

    Decision trees and ensembles of decision trees are very popular in machine learning and often achieve state-of-the-art performance on black-box prediction tasks. However, popular variants such as C4.5, CART, boosted trees and random forests lack a probabilistic interpretation since they usually just specify an algorithm for training a model. We take a probabilistic approach where we cast the decision tree structures and the parameters associated with the nodes of a decision tree as a probabil...

  19. A General Recursion Method for Calculating Diffracted Intensities from Crystals Containing Planar Faults

    Science.gov (United States)

    Treacy, M. M. J.; Newsam, J. M.; Deem, M. W.

    1991-06-01

    A general recursion algorithm is described for calculating kinematical diffraction intensities from crystals containing coherent planar faults. The method exploits the self-similar stacking sequences that occur when layers stack non-deterministically. Recursion gives a set of simple relations between average interference terms from a statistical crystal, which can be solved as a set of simultaneous equations. The diffracted intensity for a polycrystalline sample is given by the incoherent sum of scattered intensities over an ensemble of crystallites. The relations between this and previous approaches, namely the Hendricks-Teller matrix formulation, the difference equation method, the summed series formula of Cowley, and Michalski's recurrence relations between average phase factors, are discussed. Although formally identical to these previous methods, the present recursive description has an intuitive appeal and proves easier to apply to complex crystal structure types. The method is valid for all types of planar faults, can accommodate long-range stacking correlations, and is applicable to crystals that contain only a finite number of layers. A FORTRAN program DIFFaX, based on this recursion algorithm, has been written and used to simulate powder X-ray (and neutron) diffraction patterns and single crystal electron (kinematical) diffraction patterns. Calculations for diamond-lonsdaleite and for several synthetic zeolite systems that contain high densities of stacking faults are presented as examples.

  20. Separating the classes of recursively enumerable languages based on machine size

    NARCIS (Netherlands)

    van Leeuwen, Jan|info:eu-repo/dai/nl/068413025; Wiedermann, Jiří

    In the late nineteen sixties it was observed that the recursively enumerable languages form an infinite proper hierarchy bassed on the size of the Turing machines that accept them. We examine the fundamental position of the finite languages and their complements in the hierarchy. Several results are

  1. Recursive identification of time-variant model parameters from drying curves

    NARCIS (Netherlands)

    Ooteghem, van R.J.C.; Amankwah, E.Y.A.; Boxtel, van A.J.B.

    2016-01-01

    This work applies the Extended Kalman Filter for recursive identification of time-variant drying rate constant and derives the behavior of the effective diffusion coefficient during drying of yam (Dioscoreaceae rotundata). The identification concerns drying at different temperatures and shrinkage

  2. Recursive Solution Procedures for Flexible Multibody Systems: Comparing Condensation and Transfer Matrix Methods

    NARCIS (Netherlands)

    Schilder, Jurnan; Ellenbroek, Marcel; de Boer, Andre

    2017-01-01

    In this work two different recursive solution procedures for flexible multibody systems are considered: the condensation method and the transfer matrix method. A comparison between these methods is made based on the equation of motion of an arbitrary 3D linear elastic body, in which the absolute

  3. Recursive Alterations of the Relationship between Simple Membrane Geometry and Insertion of Amphiphilic Motifs

    DEFF Research Database (Denmark)

    Madsen, Kenneth Lindegaard; Herlo, Rasmus

    2017-01-01

    The shape and composition of a membrane directly regulate the localization, activity, and signaling properties of membrane associated proteins. Proteins that both sense and generate membrane curvature, e.g., through amphiphilic insertion motifs, potentially engage in recursive binding dynamics, w...

  4. Recursive inverse kinematics for robot arms via Kalman filtering and Bryson-Frazier smoothing

    Science.gov (United States)

    Rodriguez, G.; Scheid, R. E., Jr.

    1987-01-01

    This paper applies linear filtering and smoothing theory to solve recursively the inverse kinematics problem for serial multilink manipulators. This problem is to find a set of joint angles that achieve a prescribed tip position and/or orientation. A widely applicable numerical search solution is presented. The approach finds the minimum of a generalized distance between the desired and the actual manipulator tip position and/or orientation. Both a first-order steepest-descent gradient search and a second-order Newton-Raphson search are developed. The optimal relaxation factor required for the steepest descent method is computed recursively using an outward/inward procedure similar to those used typically for recursive inverse dynamics calculations. The second-order search requires evaluation of a gradient and an approximate Hessian. A Gauss-Markov approach is used to approximate the Hessian matrix in terms of products of first-order derivatives. This matrix is inverted recursively using a two-stage process of inward Kalman filtering followed by outward smoothing. This two-stage process is analogous to that recently developed by the author to solve by means of spatial filtering and smoothing the forward dynamics problem for serial manipulators.

  5. Recursive Frame Analysis: Reflections on the Development of a Qualitative Research Method

    Science.gov (United States)

    Keeney, Hillary; Keeney, Bradford

    2012-01-01

    The origin of recursive frame analysis (RFA) is revisited and discussed as a postmodern alternative to modernist therapeutic models and research methods that foster hegemony of a preferred therapeutic metaphor, narrative, or strategy. It encourages improvisational performance while enabling a means of scoring the change and movement of the…

  6. CP-Recursion in Danish: A cP/CP-Analysis

    DEFF Research Database (Denmark)

    Nyvad, Anne Mette; Christensen, Ken Ramshøj; Vikner, Sten

    2017-01-01

    Based on data from extraction, embedded V2, and complementizer stacking, this paper proposes a cP/CP-analysis of CP-recursion in Danish. Because extraction can be shown to be possible from relative clauses, wh-islands, and adverbial clauses, and given that long extraction is successive......-cyclic, an extra specifier position has to be available as an escape hatch. Consequently, such extractions require a CP-recursion analysis, as has been argued for embedded V2 and for complementizer stacking. Given that CP-recursion in embedded V2 clauses does not allow extraction, whereas other types of CP......-recursion do, we suggest that embedded V2 is fundamentally different, in that main clause V2 and embedded V2 involve a CP (“big CP”), whereas all other clausal projections above IP are instances of cP (“little cP”). The topmost “little” c° has an occurrence feature that enables extraction but bars spell...

  7. Joint Analysis of Binomial and Continuous Traits with a Recursive Model

    DEFF Research Database (Denmark)

    Varona, Louis; Sorensen, Daniel

    2014-01-01

    This work presents a model for the joint analysis of a binomial and a Gaussian trait using a recursive parametrization that leads to a computationally efficient implementation. The model is illustrated in an analysis of mortality and litter size in two breeds of Danish pigs, Landrace and Yorkshir...

  8. Recursion operators and bi-Hamiltonian structure of the general heavenly equation

    Science.gov (United States)

    Sheftel, M. B.; Yazıcı, D.; Malykh, A. A.

    2017-06-01

    We discover two additional Lax pairs and three nonlocal recursion operators for symmetries of the general heavenly equation introduced by Doubrov and Ferapontov. Converting the equation to a two-component form, we obtain Lagrangian and Hamiltonian structures of the two-component general heavenly system. We study all point symmetries of the two-component system and, using the inverse Noether theorem in the Hamiltonian form, obtain all the integrals of motion corresponding to each variational (Noether) symmetry. We discover that in the two-component form we have only a single nonlocal recursion operator. Composing the recursion operator with the first Hamiltonian operator we obtain second Hamiltonian operator. We check the Jacobi identities for the second Hamiltonian operator and compatibility of the two Hamiltonian structures using P. Olver's theory of functional multi-vectors. Our well-founded conjecture is that P. Olver's method works fine for nonlocal operators. We show that the general heavenly equation in the two-component form is a bi-Hamiltonian system integrable in the sense of Magri. We demonstrate how to obtain nonlocal Hamiltonian flows generated by local Hamiltonians by using formal adjoint recursion operator.

  9. Recursive Least Squares with Real Time Stochastic Modeling: Application to GPS Relative Positioning

    Science.gov (United States)

    Zangeneh-Nejad, F.; Amiri-Simkooei, A. R.; Sharifi, M. A.; Asgari, J.

    2017-09-01

    Geodetic data processing is usually performed by the least squares (LS) adjustment method. There are two different forms for the LS adjustment, namely the batch form and recursive form. The former is not an appropriate method for real time applications in which new observations are added to the system over time. For such cases, the recursive solution is more suitable than the batch form. The LS method is also implemented in GPS data processing via two different forms. The mathematical model including both functional and stochastic models should be properly defined for both forms of the LS method. Proper choice of the stochastic model plays an important role to achieve high-precision GPS positioning. The noise characteristics of the GPS observables have been already investigated using the least squares variance component estimation (LS-VCE) in a batch form by the authors. In this contribution, we introduce a recursive procedure that provides a proper stochastic modeling for the GPS observables using the LS-VCE. It is referred to as the recursive LS-VCE (RLS-VCE) method, which is applied to the geometry-based observation model (GBOM). In this method, the (co)variances parameters can be estimated recursively when the new group of observations is added. Therefore, it can easily be implemented in real time GPS data processing. The efficacy of the method is evaluated using a real GPS data set collected by the Trimble R7 receiver over a zero baseline. The results show that the proposed method has an appropriate performance so that the estimated (co)variance parameters of the GPS observables are consistent with the batch estimates. However, using the RLS-VCE method, one can estimate the (co)variance parameters of the GPS observables when a new observation group is added. This method can thus be introduced as a reliable method for application to the real time GPS data processing.

  10. Flowering Trees

    Indian Academy of Sciences (India)

    Cerbera manghasL. (SEA MANGO) of Apocynaceae is a medium-sized evergreen coastal tree with milky latex. The bark is grey-brown, thick and rough. Leaves are leathery, long-veined, alternate and usually crowded at the end of branches. Flowers are in terminal compact clusters and are mildly scented, large (3–.

  11. Flowering Trees

    Indian Academy of Sciences (India)

    Andira inermis (wright) DC. , Dog Almond of Fabaceae is a handsome lofty evergreen tree. Leaves are alternate and pinnately compound with 4–7 pairs of leaflets. Flowers are fragrant and are borne on compact branched inflorescences. Fruit is ellipsoidal one-seeded drupe that is peculiar to members of this family.

  12. Flowering Trees

    Indian Academy of Sciences (India)

    IAS Admin

    handsome tree reaching a height of 15–20 feet. Leaves are alternate, pinnately compound (11–35 pairs of leaflets) and clustered at the branch ends. Flowers are small, fragrant and are borne on branched inflorescence directly from the trunk. Fruits are bright-green, oblong and lobed. They taste sour and are pickled.

  13. Flowering Trees

    Indian Academy of Sciences (India)

    narrow towards base. Flowers are large and attrac- tive, but emit unpleasant foetid smell. They appear in small numbers on erect terminal clusters and open at night. Stamens are numerous, pink or white. Style is slender and long, terminating in a small stigma. Fruit is green, ovoid and indistinctly lobed. Flowering Trees.

  14. Flowering Trees

    Indian Academy of Sciences (India)

    IAS Admin

    Caesalpinia coriaria (Jacq.) Willd. (THE AMERICAN SUMACH, DIVI-DIVI) of. Caesalpiniaceae is a small unarmed tree reaching up to 10 m in height with a spreading crown. Leaves are alternate and twice compound. The flowers are small, about 0.6 cm (enlarged 5 times here), greenish-yellow, fragrant and appear in dense ...

  15. Flowering Trees

    Indian Academy of Sciences (India)

    IAS Admin

    Benth. of Meliaceae is a small-sized evergreen tree of both moist and dry deciduous forests. The leaves are alternate and pinnately compound, terminating in a single leaflet. Leaflets are more or less elliptic with entire margin. Flowers are small on branched inflorescence. Fruit is a globose berry (1.5 to 2 cm across) with one ...

  16. Flowering Trees

    Indian Academy of Sciences (India)

    Celtis tetrandra Roxb. of Ulmaceae is a moderately large handsome deciduous tree with green branchlets and grayish-brown bark. Leaves are simple with three to four secondary veins running parallel to the mid vein. Flowers are solitary, male, female and bisexual and inconspicuous. Fruit is berry-like, small and globose ...

  17. Flowering Trees

    Indian Academy of Sciences (India)

    sriranga

    Haldina cordifolia (Roxb.) Ridsd. Syn. Adina cordifolia (Roxb.) Hook.f. ex Brandis (Yellow. Cadamba) of Rubiaceae is a large and handsome deciduous tree. Leaves are simple, large, orbicular, and drawn abruptly at the apex. Flowers are small, yellowish and aggregate into small spherical heads. The corolla is ...

  18. ~{owering 'Trees

    Indian Academy of Sciences (India)

    ... green but yellow when ripe, quite smooth at first but wrinkled in drying, remaining long on the tree ajier ripening. The species is widely natural but occasionally cultivated for firewood as it grows very fast. The bark is very bitter and is used as an anthelmintic. Heartwood is reddish brown and takes good polish and hence.

  19. Tree Mortality

    Science.gov (United States)

    Mark J. Ambrose

    2012-01-01

    Tree mortality is a natural process in all forest ecosystems. However, extremely high mortality also can be an indicator of forest health issues. On a regional scale, high mortality levels may indicate widespread insect or disease problems. High mortality may also occur if a large proportion of the forest in a particular region is made up of older, senescent stands....

  20. Flowering Trees

    Indian Academy of Sciences (India)

    user

    Gliricidia sepium(Jacq.) Kunta ex Walp. (Quickstick) of Fabaceae is a small deciduous tree with. Pinnately compound leaves. Flower are prroduced in large number in early summer on terminal racemes. They are attractive, pinkish-white and typically like bean flowers. Fruit is a few-seeded flat pod. G. sepium is a native of ...

  1. Flowering Trees

    Indian Academy of Sciences (India)

    deciduous tropical tree with often multiple stems and handsome foliage. Leaves are 8–10 cm long, dull green, the two thin leathery halves of the lamina fusing or the cleft between them extending beyond the middle. Flowers are gorgeous, axillary with ...

  2. Flowering Trees

    Indian Academy of Sciences (India)

    Trincomali Wood of Tiliaceae is a tall evergreen tree with straight trunk, smooth brownish-grey bark and simple broad leaves. Inflorescence is much branched with white flowers. Stamens are many with golden yellow anthers. Fruit is a capsule with six spreading wings. Seeds bear short stiff hairs that cause skin irritation.

  3. Flowering Trees

    Indian Academy of Sciences (India)

    Muntingia calabura L. (Singapore cherry) of. Elaeocarpaceae is a medium size handsome ever- green tree. Leaves are simple and alternate with sticky hairs. Flowers are bisexual, bear numerous stamens, white in colour and arise in the leaf axils. Fruit is a berry, edible with several small seeds embedded in a fleshy pulp ...

  4. Flowering Trees

    Indian Academy of Sciences (India)

    knobbly, rough and twisted medium-sized ev- ergreen tree with mottled bark. The wood is very hard and resinous. Leaves are compound. The leaflets are smooth, leathery, ovate-ellipti- cal and appear in two pairs. Flowers (about 1.5 cm across) are clustered in leaf axils and are bisexual. Fruit is yellow, fleshy, two-valved.

  5. Flowering Trees

    Indian Academy of Sciences (India)

    Srimath

    . (6-10m high) evergreen tree with a straight trunk and broad open crown. Leaves are clustered at the end of twigs. They are dark green, broadest near the rounded apex and tapering towards the base with a short stalk. Flowers are greenish or ...

  6. :Ffowering 'Trees-

    Indian Academy of Sciences (India)

    The tree is a host of lac insects which secrete a resinous substance that yields shellac or lac. A ruby-coloured gum known as Bengal Kino is collected from the incisions made in the bark. The wood, resistant to water, is used in water-well work. The seeds are used as anthelmintic and as an antidote for snake-bite.

  7. Flowering Trees

    Indian Academy of Sciences (India)

    Sterculia foetida L. (INDIAN ALMOND,. JAVA OLIVE) of Sterculiaceae is a tall deciduous tree reaching a height of 20 m with faintly ridged grey bark. The bole reaches up to 2m in girth. Branches are reddish, usually horizontal. Leaves are large, palmately compound (5–7 leaflets) and clustered at the branch ends. Flowers ...

  8. Towards "AlphaChem": Chemical Synthesis Planning with Tree Search and Deep Neural Network Policies

    OpenAIRE

    Segler, Marwin; Preuß, Mike; Waller, Mark P.

    2017-01-01

    Retrosynthesis is a technique to plan the chemical synthesis of organic molecules, for example drugs, agro- and fine chemicals. In retrosynthesis, a search tree is built by analysing molecules recursively and dissecting them into simpler molecular building blocks until one obtains a set of known building blocks. The search space is intractably large, and it is difficult to determine the value of retrosynthetic positions. Here, we propose to model retrosynthesis as a Markov Decision Process. I...

  9. Some Novel Applications of Explanation-Based Learning to Parsing Lexicalized Tree-Adjoining Grammars

    CERN Document Server

    Srinivas, B; Joshi, Aravind

    1995-01-01

    In this paper we present some novel applications of Explanation-Based Learning (EBL) technique to parsing Lexicalized Tree-Adjoining grammars. The novel aspects are (a) immediate generalization of parses in the training set, (b) generalization over recursive structures and (c) representation of generalized parses as Finite State Transducers. A highly impoverished parser called a ``stapler'' has also been introduced. We present experimental results using EBL for different corpora and architectures to show the effectiveness of our approach.

  10. Randomized clinical trial comparing the efficacy of the vaginal use of metronidazole with a Brazilian pepper tree (Schinus extract for the treatment of bacterial vaginosis

    Directory of Open Access Journals (Sweden)

    S.R.R.F. Leite

    2011-03-01

    Full Text Available A 7.4% vaginal extract of the Brazilian pepper tree (Schinus terebinthifolius Raddi was compared with 0.75% vaginal metronidazole, both manufactured by the Hebron Laboratory, for the treatment of bacterial vaginosis, used at bedtime for 7 nights. The condition was diagnosed using the combined criteria of Amsel and Nugent in two groups of 140 and 137 women, aged between 18 and 40 years. Intention-to-treat analysis was performed. Women were excluded from the study if they presented delayed menstruation, were pregnant, were using or had used any topical or systemic medication, presented any other vaginal infections, presented hymen integrity, or if they reported any history suggestive of acute pelvic inflammatory disease. According to Amsel’s criteria separately, 29 patients (21.2% treated with the extract and 87 (62.1% treated with metronidazole were considered to be cured (P < 0.001. According to Nugent’s score separately, 19 women (13.9% treated with the extract and 79 (56.4% treated with metronidazole were considered to be cured (P < 0.001. Using the two criteria together, the so-called total cure was observed in 17 women (12.4% treated with the extract and in 79 women (56.4% treated with metronidazole (P < 0.001. In conclusion, the cure rate for bacterial vaginosis using a vaginal gel from a pepper tree extract was lower than the rate obtained with metronidazole gel, while side effects were infrequent and non-severe in both groups.

  11. Evaluating effectiveness of down-sampling for stratified designs and unbalanced prevalence in Random Forest models of tree species distributions in Nevada

    Science.gov (United States)

    Elizabeth A. Freeman; Gretchen G. Moisen; Tracy S. Frescino

    2012-01-01

    Random Forests is frequently used to model species distributions over large geographic areas. Complications arise when data used to train the models have been collected in stratified designs that involve different sampling intensity per stratum. The modeling process is further complicated if some of the target species are relatively rare on the landscape leading to an...

  12. Decision trees in epidemiological research.

    Science.gov (United States)

    Venkatasubramaniam, Ashwini; Wolfson, Julian; Mitchell, Nathan; Barnes, Timothy; JaKa, Meghan; French, Simone

    2017-01-01

    In many studies, it is of interest to identify population subgroups that are relatively homogeneous with respect to an outcome. The nature of these subgroups can provide insight into effect mechanisms and suggest targets for tailored interventions. However, identifying relevant subgroups can be challenging with standard statistical methods. We review the literature on decision trees, a family of techniques for partitioning the population, on the basis of covariates, into distinct subgroups who share similar values of an outcome variable. We compare two decision tree methods, the popular Classification and Regression tree (CART) technique and the newer Conditional Inference tree (CTree) technique, assessing their performance in a simulation study and using data from the Box Lunch Study, a randomized controlled trial of a portion size intervention. Both CART and CTree identify homogeneous population subgroups and offer improved prediction accuracy relative to regression-based approaches when subgroups are truly present in the data. An important distinction between CART and CTree is that the latter uses a formal statistical hypothesis testing framework in building decision trees, which simplifies the process of identifying and interpreting the final tree model. We also introduce a novel way to visualize the subgroups defined by decision trees. Our novel graphical visualization provides a more scientifically meaningful characterization of the subgroups identified by decision trees. Decision trees are a useful tool for identifying homogeneous subgroups defined by combinations of individual characteristics. While all decision tree techniques generate subgroups, we advocate the use of the newer CTree technique due to its simplicity and ease of interpretation.

  13. Decision trees in epidemiological research

    Directory of Open Access Journals (Sweden)

    Ashwini Venkatasubramaniam

    2017-09-01

    Full Text Available Abstract Background In many studies, it is of interest to identify population subgroups that are relatively homogeneous with respect to an outcome. The nature of these subgroups can provide insight into effect mechanisms and suggest targets for tailored interventions. However, identifying relevant subgroups can be challenging with standard statistical methods. Main text We review the literature on decision trees, a family of techniques for partitioning the population, on the basis of covariates, into distinct subgroups who share similar values of an outcome variable. We compare two decision tree methods, the popular Classification and Regression tree (CART technique and the newer Conditional Inference tree (CTree technique, assessing their performance in a simulation study and using data from the Box Lunch Study, a randomized controlled trial of a portion size intervention. Both CART and CTree identify homogeneous population subgroups and offer improved prediction accuracy relative to regression-based approaches when subgroups are truly present in the data. An important distinction between CART and CTree is that the latter uses a formal statistical hypothesis testing framework in building decision trees, which simplifies the process of identifying and interpreting the final tree model. We also introduce a novel way to visualize the subgroups defined by decision trees. Our novel graphical visualization provides a more scientifically meaningful characterization of the subgroups identified by decision trees. Conclusions Decision trees are a useful tool for identifying homogeneous subgroups defined by combinations of individual characteristics. While all decision tree techniques generate subgroups, we advocate the use of the newer CTree technique due to its simplicity and ease of interpretation.

  14. Unimodular trees versus Einstein trees

    Energy Technology Data Exchange (ETDEWEB)

    Alvarez, Enrique; Gonzalez-Martin, Sergio [Universidad Autonoma, Instituto de Fisica Teorica, IFT-UAM/CSIC, Madrid (Spain); Universidad Autonoma de Madrid, Departamento de Fisica Teorica, Madrid (Spain); Martin, Carmelo P. [Universidad Complutense de Madrid (UCM), Departamento de Fisica Teorica I Facultad de Ciencias Fisicas, Madrid (Spain)

    2016-10-15

    The maximally helicity violating tree-level scattering amplitudes involving three, four or five gravitons are worked out in Unimodular Gravity. They are found to coincide with the corresponding amplitudes in General Relativity. This a remarkable result, insofar as both the propagators and the vertices are quite different in the two theories. (orig.)

  15. Random field estimation approach to robot dynamics

    Science.gov (United States)

    Rodriguez, Guillermo

    1990-01-01

    The difference equations of Kalman filtering and smoothing recursively factor and invert the covariance of the output of a linear state-space system driven by a white-noise process. Here it is shown that similar recursive techniques factor and invert the inertia matrix of a multibody robot system. The random field models are based on the assumption that all of the inertial (D'Alembert) forces in the system are represented by a spatially distributed white-noise model. They are easier to describe than the models based on classical mechanics, which typically require extensive derivation and manipulation of equations of motion for complex mechanical systems. With the spatially random models, more primitive locally specified computations result in a global collective system behavior equivalent to that obtained with deterministic models. The primary goal of applying random field estimation is to provide a concise analytical foundation for solving robot control and motion planning problems.

  16. Building optimal regression tree by ant colony system-genetic algorithm: application to modeling of melting points.

    Science.gov (United States)

    Hemmateenejad, Bahram; Shamsipur, Mojtaba; Zare-Shahabadi, Vali; Akhond, Morteza

    2011-10-17

    The classification and regression trees (CART) possess the advantage of being able to handle large data sets and yield readily interpretable models. A conventional method of building a regression tree is recursive partitioning, which results in a good but not optimal tree. Ant colony system (ACS), which is a meta-heuristic algorithm and derived from the observation of real ants, can be used to overcome this problem. The purpose of this study was to explore the use of CART and its combination with ACS for modeling of melting points of a large variety of chemical compounds. Genetic algorithm (GA) operators (e.g., cross averring and mutation operators) were combined with ACS algorithm to select the best solution model. In addition, at each terminal node of the resulted tree, variable selection was done by ACS-GA algorithm to build an appropriate partial least squares (PLS) model. To test the ability of the resulted tree, a set of approximately 4173 structures and their melting points were used (3000 compounds as training set and 1173 as validation set). Further, an external test set containing of 277 drugs was used to validate the prediction ability of the tree. Comparison of the results obtained from both trees showed that the tree constructed by ACS-GA algorithm performs better than that produced by recursive partitioning procedure. Copyright © 2011 Elsevier B.V. All rights reserved.

  17. Research of Current Control Strategy of Hybrid Active Power Filter Based on Fuzzy Recursive Integral PI Control Algorithm

    Science.gov (United States)

    Tang, Zhong; Liao, Daifa

    According to the current control characters of hybrid active power filter (HAPF), the current control model of HAPF is designed. The fuzzy recursive integral PI control algorithm is presented when it is compared to conventional PI control method. The control algorithm is applied to auto-regulate the proportional and integral parameters of PI. Thus, the robustness and response speed is enhanced; the dynamic performance of the HAPF device is improved. Under Matlab/Simulink background, a fuzzy recursive integral PI controller is designed and it is applied in a HAPF model in PSCAD/EMTDC. The results prove the feasibility and effectiveness of this fuzzy recursive integral PI control algorithm.

  18. Understanding search trees via statistical physics

    Indian Academy of Sciences (India)

    Abstract. We study the random m-ary search tree model (where m stands for the number of branches of the search tree), an important problem for data storage in computer science, using a variety of statistical physics techniques that allow us to obtain exact asymptotic results. In particular, we show that the probability ...

  19. Technical Tree Climbing.

    Science.gov (United States)

    Jenkins, Peter

    Tree climbing offers a safe, inexpensive adventure sport that can be performed almost anywhere. Using standard procedures practiced in tree surgery or rock climbing, almost any tree can be climbed. Tree climbing provides challenge and adventure as well as a vigorous upper-body workout. Tree Climbers International classifies trees using a system…

  20. THE CONTRIBUTION OF AGROFORESTRY TREE PRODUCTS TO ...

    African Journals Online (AJOL)

    philiph

    forestry tree products to rural farmers in Karim-Lamido Local Government Area was conducted. Fourty (40) farmers randomly selected from 45.5% of eleven wards were interviewed, using a well- designed and pretested questionnaire. The data ...

  1. AR-RBFS: Aware-Routing Protocol Based on Recursive Best-First Search Algorithm for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Farzad Kiani

    2016-01-01

    Full Text Available Energy issue is one of the most important problems in wireless sensor networks. They consist of low-power sensor nodes and a few base station nodes. They must be adaptive and efficient in data transmission to sink in various areas. This paper proposes an aware-routing protocol based on clustering and recursive search approaches. The paper focuses on the energy efficiency issue with various measures such as prolonging network lifetime along with reducing energy consumption in the sensor nodes and increasing the system reliability. Our proposed protocol consists of two phases. In the first phase (network development phase, the sensors are placed into virtual layers. The second phase (data transmission is related to routes discovery and data transferring so it is based on virtual-based Classic-RBFS algorithm in the lake of energy problem environments but, in the nonchargeable environments, all nodes in each layer can be modeled as a random graph and then begin to be managed by the duty cycle method. Additionally, the protocol uses new topology control, data aggregation, and sleep/wake-up schemas for energy saving in the network. The simulation results show that the proposed protocol is optimal in the network lifetime and packet delivery parameters according to the present protocols.

  2. An efficient ASIC implementation of 16-channel on-line recursive ICA processor for real-time EEG system.

    Science.gov (United States)

    Fang, Wai-Chi; Huang, Kuan-Ju; Chou, Chia-Ching; Chang, Jui-Chung; Cauwenberghs, Gert; Jung, Tzyy-Ping

    2014-01-01

    This is a proposal for an efficient very-large-scale integration (VLSI) design, 16-channel on-line recursive independent component analysis (ORICA) processor ASIC for real-time EEG system, implemented with TSMC 40 nm CMOS technology. ORICA is appropriate to be used in real-time EEG system to separate artifacts because of its highly efficient and real-time process features. The proposed ORICA processor is composed of an ORICA processing unit and a singular value decomposition (SVD) processing unit. Compared with previous work [1], this proposed ORICA processor has enhanced effectiveness and reduced hardware complexity by utilizing a deeper pipeline architecture, shared arithmetic processing unit, and shared registers. The 16-channel random signals which contain 8-channel super-Gaussian and 8-channel sub-Gaussian components are used to analyze the dependence of the source components, and the average correlation coefficient is 0.95452 between the original source signals and extracted ORICA signals. Finally, the proposed ORICA processor ASIC is implemented with TSMC 40 nm CMOS technology, and it consumes 15.72 mW at 100 MHz operating frequency.

  3. Recursive Approach for Evaluation of Time Intervals between Transactions in Polling Procedure

    Directory of Open Access Journals (Sweden)

    Larkin Eugene

    2016-01-01

    Full Text Available An ergodic semi-Markov process with the structure represented by the full graph with loops, which simulates a digital control algorithm that generated transactions onto an object, is investigated. Elementary simplifications for reduction of semi-Markov processes are defined. Recursive procedure for reduction of initial semi-Markov process structure till the model, which includes selected states with its links only, is proposed. Formulae for recalculation of probabilities, weighted densities and expectations of time of switching to linked states are obtained. It is shown that recursive procedure may be used also for calculation of time expectation of return the process to one of selected states that simplified the task of evaluation of time intervals between transactions in polling procedure.

  4. Recursive construction of (J,L (J,L QC LDPC codes with girth 6

    Directory of Open Access Journals (Sweden)

    Mohammad Gholami

    2016-06-01

    Full Text Available ‎In this paper‎, ‎a recursive algorithm is presented to generate some exponent matrices which correspond to Tanner graphs with girth at least 6‎. ‎For a J×L J×L exponent matrix E E‎, ‎the lower bound Q(E Q(E is obtained explicitly such that (J,L (J,L QC LDPC codes with girth at least 6 exist for any circulant permutation matrix (CPM size m≥Q(E m≥Q(E‎. ‎The results show that the exponent matrices constructed with our recursive algorithm have smaller lower-bound than the ones proposed recently with girth 6‎

  5. A novel thermodynamic state recursion method for description of nonideal nonlinear chromatographic process of frontal analysis.

    Science.gov (United States)

    Liu, Qian; OuYang, Liangfei; Liang, Heng; Li, Nan; Geng, Xindu

    2012-06-01

    A novel thermodynamic state recursion (TSR) method, which is based on nonequilibrium thermodynamic path described by the Lagrangian-Eulerian representation, is presented to simulate the whole chromatographic process of frontal analysis using the spatial distribution of solute bands in time series like as a series of images. TSR differs from the current numerical methods using the partial differential equations in Eulerian representation. The novel method is used to simulate the nonideal, nonlinear hydrophobic interaction chromatography (HIC) processes of lysozyme and myoglobin under the discrete complex boundary conditions. The results show that the simulated breakthrough curves agree well with the experimental ones. The apparent diffusion coefficient and the Langmuir isotherm parameters of the two proteins in HIC are obtained by the state recursion inverse method. Due to its the time domain and Markov characteristics, TSR is applicable to the design and online control of the nonlinear multicolumn chromatographic systems. © 2012 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

  6. A recursive vesicle-based model protocell with a primitive model cell cycle.

    Science.gov (United States)

    Kurihara, Kensuke; Okura, Yusaku; Matsuo, Muneyuki; Toyota, Taro; Suzuki, Kentaro; Sugawara, Tadashi

    2015-09-29

    Self-organized lipid structures (protocells) have been proposed as an intermediate between nonliving material and cellular life. Synthetic production of model protocells can demonstrate the potential processes by which living cells first arose. While we have previously described a giant vesicle (GV)-based model protocell in which amplification of DNA was linked to self-reproduction, the ability of a protocell to recursively self-proliferate for multiple generations has not been demonstrated. Here we show that newborn daughter GVs can be restored to the status of their parental GVs by pH-induced vesicular fusion of daughter GVs with conveyer GVs filled with depleted substrates. We describe a primitive model cell cycle comprising four discrete phases (ingestion, replication, maturity and division), each of which is selectively activated by a specific external stimulus. The production of recursive self-proliferating model protocells represents a step towards eventual production of model protocells that are able to mimic evolution.

  7. A Note on Local Stability Conditions for Two Types of Monetary Models with Recursive Utility

    Science.gov (United States)

    Miyazaki, Kenji; Utsunomiya, Hitoshi

    2009-09-01

    This note explores local stability conditions for money-in-utility-function (MIUF) and transaction-costs (TC) models with recursive utility. Although Chen et al. [Chen, B.-L., M. Hsu, and C.-H. Lin, 2008, Inflation and growth: impatience and a qualitative equivalent, Journal of Money, Credit, and Banking, Vol. 40, No. 6, 1310-1323] investigated the relationship between inflation and growth in MIUF and TC models with recursive utility, they conducted only a comparative static analysis in a steady state. By establishing sufficient conditions for local stability, this note proves that impatience should be increasing in consumption and real balances. Increasing impatience, although less plausible from an empirical point of view, receives more support from a theoretical viewpoint.

  8. Neumann Series on the Recursive Moments of Copula-Dependent Aggregate Discounted Claims

    Directory of Open Access Journals (Sweden)

    Siti Norafidah Mohd Ramli

    2014-05-01

    Full Text Available We study the recursive moments of aggregate discounted claims, where the dependence between the inter-claim time and the subsequent claim size is considered. Using the general expression for the m-th order moment proposed by Léveillé and Garrido (Scand. Actuar. J. 2001, 2, 98–110, which takes the form of the Volterra integral equation (VIE, we used the method of successive approximation to derive the Neumann series of the recursive moments. We then compute the first two moments of aggregate discounted claims, i.e., its mean and variance, based on the Neumann series expression, where the dependence structure is captured by a Farlie–Gumbel–Morgenstern (FGM copula, a Gaussian copula and a Gumbel copula with exponential marginal distributions. Insurance premium calculations with their figures are also illustrated.

  9. Recursive jigsaw reconstruction: HEP event analysis in the presence of kinematic and combinatoric ambiguities

    Science.gov (United States)

    Jackson, Paul; Rogan, Christopher

    2017-12-01

    We introduce recursive jigsaw reconstruction, a technique for analyzing reconstructed particle interactions in the presence of kinematic and combinatoric unknowns associated with unmeasured and indistinguishable particles, respectively. By factorizing missing information according to decays and rest frames of intermediate particles, an interchangeable and configurable set of jigsaw rules, algorithms for resolving these unknowns, are applied to approximately reconstruct decays with arbitrarily many particles, in their entirety. That the recursive jigsaw reconstruction approach can be used to analyze any event topology of interest, with any number of ambiguities, is demonstrated through twelve different simulated LHC physics examples. These include the production and decay of W , Z , Higgs bosons, and supersymmetric particles including gluinos, stop quarks, charginos, and neutralinos.

  10. A novel intrusion detection method based on OCSVM and K-means recursive clustering

    Directory of Open Access Journals (Sweden)

    Leandros A. Maglaras

    2015-01-01

    Full Text Available In this paper we present an intrusion detection module capable of detecting malicious network traffic in a SCADA (Supervisory Control and Data Acquisition system, based on the combination of One-Class Support Vector Machine (OCSVM with RBF kernel and recursive k-means clustering. Important parameters of OCSVM, such as Gaussian width o and parameter v affect the performance of the classifier. Tuning of these parameters is of great importance in order to avoid false positives and over fitting. The combination of OCSVM with recursive k- means clustering leads the proposed intrusion detection module to distinguish real alarms from possible attacks regardless of the values of parameters o and v, making it ideal for real-time intrusion detection mechanisms for SCADA systems. Extensive simulations have been conducted with datasets extracted from small and medium sized HTB SCADA testbeds, in order to compare the accuracy, false alarm rate and execution time against the base line OCSVM method.

  11. Non-recursive augmented Lagrangian algorithms for the forward and inverse dynamics of constrained flexible multibodies

    Science.gov (United States)

    Bayo, Eduardo; Ledesma, Ragnar

    1993-01-01

    A technique is presented for solving the inverse dynamics of flexible planar multibody systems. This technique yields the non-causal joint efforts (inverse dynamics) as well as the internal states (inverse kinematics) that produce a prescribed nominal trajectory of the end effector. A non-recursive global Lagrangian approach is used in formulating the equations for motion as well as in solving the inverse dynamics equations. Contrary to the recursive method previously presented, the proposed method solves the inverse problem in a systematic and direct manner for both open-chain as well as closed-chain configurations. Numerical simulation shows that the proposed procedure provides an excellent tracking of the desired end effector trajectory.

  12. Recursive proportional feedback and its use to control chaos in an electrochemical system

    CERN Document Server

    Rollins, R W; Sherard, P; Dewald, H D

    1995-01-01

    The recursive proportional feedback (RPF) algorithm for controlling chaos is described and applied to control chemical chaos observed during the electrodissolution of a rotating copper disk in a sodium acetate/acetic acid buffer. Experimental evidence is presented to indicate why the RPF method was used and the theoretical robustness of the algorithm is discussed. (This paper appears in the "Proceedings of the 2nd Conference on EXPERIMENTAL CHAOS," World Scientific Press, River Ridge, NJ, 1995)

  13. Majorant recursions to determine eigenstate bounds of a symmetric exponential quantum anharmonic oscillator

    Energy Technology Data Exchange (ETDEWEB)

    Özdemir, Semra Bayat; Demiralp, Metin [Computational Science and Engineering Department, Informatics Institute, Istanbul Technical University, Istanbul (Turkey)

    2015-12-31

    The determination of the energy states is highly studied issue in the quantum mechanics. Based on expectation values dynamics, energy states can be observed. But conditions and calculations vary depending on the created system. In this work, a symmetric exponential anharmonic oscillator is considered and development of a recursive approximation method is studied to find its ground energy state. The use of majorant values facilitates the approximate calculation of expectation values.

  14. A recursive formula for the number of intuitionistic fuzzy subgroups of a finite cyclic group

    Science.gov (United States)

    Chandni, Sharma, P. K.; Singh, Pushpinder; Singh, Manreet

    2017-07-01

    In this article, we have given an explicit recursive formula for the number of intuitionistic fuzzy subgroups of a finite cyclic group G = Zp1 × Zp ×………..×Zpm, where p1, p2, ….., pm are distinct prime numbers. A method for constructing an intuitionistic fuzzy subgroup of a given group in terms of double pinned flags is also proposed.

  15. Multi-Objective Big Bang–Big Crunch Optimization Algorithm For Recursive Digital Filter Design

    OpenAIRE

    Ms. Rashmi Singh; Dr. H. K. Verma

    2012-01-01

    The paper represents the design of recursive second order Butterworth low pass digital filter which optimizes both the magnitude and group delay simultaneously under the Multi-Objective Big Bang-Big Crunch Optimization algorithm. Multi-Objective problem of magnitude and group delay are solved using Multi-Objective BB-BC Optimization algorithm that operates on a complex, continuous search space and optimized by statistically determining the abilities of Big Bang Phase and Big Crunch Phase. Her...

  16. Recursive black-box identification of nonlinear state-space ODE models

    OpenAIRE

    Brus, Linda

    2006-01-01

    Nonlinear system identification methods is a topic that has been gaining interest over the last years. One reason is the many application areas in controller design and system development. However, the problem of modeling nonlinear systems is complex and finding a general method that can be used for many different applications is difficult. This thesis treats recursive identification methods for identification of systems that can be described by nonlinear ordinary differential equations. The ...

  17. A self-applicable online partial evaluator for recursive flowchart languages

    DEFF Research Database (Denmark)

    Glück, Robert

    2012-01-01

    This paper describes a self-applicable online partial evaluator for a ¿owchart language with recursive calls. Self-application of the partial evaluator yields generating extensions that are as ef¿cient as those reported in the literature for of¿ine partial evaluation. This result is remarkable be...... Futamura projections is demonstrated. The complete bootstrap of a compiler generator from a partial evaluator is also reported. Copyright q 2011 John Wiley & Sons, Ltd....

  18. Increasing stability and accuracy of the lattice Boltzmann scheme: recursivity and regularization

    OpenAIRE

    Malaspinas, Orestis

    2015-01-01

    In the present paper a lattice Boltzmann scheme is presented which exhibits an increased stability and accuracy with respect to standard single- or multi-relaxation-time (MRT) approaches. The scheme is based on a single-relaxation-time model where a special regularization procedure is applied. This regularization is based on the fact that, for a-thermal flows, there exists a recursive way to express the velocity distribution function at any order (in the Hermite series sense) in terms of the ...

  19. Recursive Estimation of the Stein Center of SPD Matrices & its Applications.

    Science.gov (United States)

    Salehian, Hesamoddin; Cheng, Guang; Vemuri, Baba C; Ho, Jeffrey

    2013-12-01

    Symmetric positive-definite (SPD) matrices are ubiquitous in Computer Vision, Machine Learning and Medical Image Analysis. Finding the center/average of a population of such matrices is a common theme in many algorithms such as clustering, segmentation, principal geodesic analysis, etc. The center of a population of such matrices can be defined using a variety of distance/divergence measures as the minimizer of the sum of squared distances/divergences from the unknown center to the members of the population. It is well known that the computation of the Karcher mean for the space of SPD matrices which is a negatively-curved Riemannian manifold is computationally expensive. Recently, the LogDet divergence-based center was shown to be a computationally attractive alternative. However, the LogDet-based mean of more than two matrices can not be computed in closed form, which makes it computationally less attractive for large populations. In this paper we present a novel recursive estimator for center based on the Stein distance - which is the square root of the LogDet divergence - that is significantly faster than the batch mode computation of this center. The key theoretical contribution is a closed-form solution for the weighted Stein center of two SPD matrices, which is used in the recursive computation of the Stein center for a population of SPD matrices. Additionally, we show experimental evidence of the convergence of our recursive Stein center estimator to the batch mode Stein center. We present applications of our recursive estimator to K-means clustering and image indexing depicting significant time gains over corresponding algorithms that use the batch mode computations. For the latter application, we develop novel hashing functions using the Stein distance and apply it to publicly available data sets, and experimental results have shown favorable comparisons to other competing methods.

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

  1. Mondrian Forests: Efficient Online Random Forests

    OpenAIRE

    Lakshminarayanan, Balaji; Roy, Daniel M.; Teh, Yee Whye

    2014-01-01

    Ensembles of randomized decision trees, usually referred to as random forests, are widely used for classification and regression tasks in machine learning and statistics. Random forests achieve competitive predictive performance and are computationally efficient to train and test, making them excellent candidates for real-world prediction tasks. The most popular random forest variants (such as Breiman's random forest and extremely randomized trees) operate on batches of training data. Online ...

  2. Construction of random perfect phylogeny matrix

    Directory of Open Access Journals (Sweden)

    Mehdi Sadeghi

    2010-11-01

    Full Text Available Mehdi Sadeghi1,2, Hamid Pezeshk4, Changiz Eslahchi3,5, Sara Ahmadian6, Sepideh Mah Abadi61National Institute of Genetic Engineering and Biotechnology, Tehran, Iran; 2School of Computer Science, 3School of Mathematics, Institute for Research in Fundamental Sciences (IPM, Tehran, Iran; 4School of Mathematics, Statistics and Computer Sciences, Center of Excellence in Biomathematics, College of Science, University of Tehran, Tehran, Iran; 5Department of Mathematics, Shahid Beheshti University, G.C., Tehran, Iran; 6Department of Computer Engineering, Sharif University of Technology, Tehran, IranPurpose: Interest in developing methods appropriate for mapping increasing amounts of genome-wide molecular data are increasing rapidly. There is also an increasing need for methods that are able to efficiently simulate such data.Patients and methods: In this article, we provide a graph-theory approach to find the necessary and sufficient conditions for the existence of a phylogeny matrix with k nonidentical haplotypes, n single nucleotide polymorphisms (SNPs, and a population size of m for which the minimum allele frequency of each SNP is between two specific numbers a and b.Results: We introduce an O(max(n2, nm algorithm for the random construction of such a phylogeny matrix. The running time of any algorithm for solving this problem would be Ω (nm.Conclusion: We have developed software, RAPPER, based on this algorithm, which is available at http://bioinf.cs.ipm.ir/softwares/RAPPER.Keywords: perfect phylogeny, minimum allele frequency (MAF, tree, recursive algorithm 

  3. Raw and Central Moments of Binomial Random Variables via Stirling Numbers

    Science.gov (United States)

    Griffiths, Martin

    2013-01-01

    We consider here the problem of calculating the moments of binomial random variables. It is shown how formulae for both the raw and the central moments of such random variables may be obtained in a recursive manner utilizing Stirling numbers of the first kind. Suggestions are also provided as to how students might be encouraged to explore this…

  4. Understanding who benefits at each step in an internet-based diabetes self-management program: application of a recursive partitioning approach.

    Science.gov (United States)

    Glasgow, Russell E; Strycker, Lisa A; King, Diane K; Toobert, Deborah J

    2014-02-01

    Efforts to predict success in chronic disease management programs have been generally unsuccessful. To identify patient subgroups associated with success at each of 6 steps in a diabetes self-management (DSM) program. Using data from a randomized trial, recursive partitioning with signal detection analysis was used to identify subgroups associated with 6 sequential steps of program success: agreement to participate, completion of baseline, initial website engagement, 4-month behavior change, later engagement, and longer-term maintenance. The study was conducted in 5 primary care clinics within Kaiser Permanente Colorado. Different numbers of patients participated in each step, including 2076, 544, 270, 219, 127, and 89. All measures available were used to address success at each step. Intervention. Participants were randomized to receive either enhanced usual care or 1 of 2 Internet-based DSM programs: 1) self-administered, computer-assisted self-management and 2) the self-administered program with the addition of enhanced social support. Two sets of potential predictor variables and 6 dichotomous outcomes were created. Signal detection analysis differentiated successful and unsuccessful subgroups at all but the final step. Different patient subgroups were associated with success at these different steps. Demographic factors (education, ethnicity, income) were associated with initial participation but not with later steps, and the converse was true of health behavior variables. Analyses were limited to one setting, and the sample sizes for some of the steps were modest. Signal detection and recursive partitioning methods may be useful for identifying subgroups that are more or less successful at different steps of intervention and may aid in understanding variability in outcomes.

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

  6. Discovery of Frequent Itemsets: Frequent Item Tree-Based Approach

    Directory of Open Access Journals (Sweden)

    A.V. Senthil Kumar

    2007-05-01

    Full Text Available Mining frequent patterns in large transactional databases is a highly researched area in the field of data mining. Existing frequent pattern discovering algorithms suffer from many problems regarding the high memory dependency when mining large amount of data, computational and I/O cost. Additionally, the recursive mining process to mine these structures is also too voracious in memory resources. In this paper, we describe a more efficient algorithm for mining complete frequent itemsets from transactional databases. The suggested algorithm is partially based on FP-tree hypothesis and extracts the frequent itemsets directly from the tree. Its memory requirement, which is independent from the number of processed transactions, is another benefit of the new method. We present performance comparisons for our algorithm against the Apriori algorithm and FP-growth.

  7. Discovery of Frequent Itemsets: Frequent Item Tree-Based Approach

    Directory of Open Access Journals (Sweden)

    A. V. Senthil Kumar

    2013-09-01

    Full Text Available Mining frequent patterns in large transactional databases is a highly researched area in the field of data mining. Existing frequent pattern discovering algorithms suffer from many problems regarding the high memory dependency when mining large amount of data, computational and I/O cost. Additionally, the recursive mining process to mine these structures is also too voracious in memory resources. In this paper, we describe a more efficient algorithm for mining complete frequent itemsets from transactional databases. The suggested algorithm is partially based on FP-tree hypothesis and extracts the frequent itemsets directly from the tree. Its memory requirement, which is independent from the number of processed transactions, is another benefit of the new method. We present performance comparisons for our algorithm against the Apriori algorithm and FP-growth.

  8. Data mining methods in the prediction of Dementia: A real-data comparison of the accuracy, sensitivity and specificity of linear discriminant analysis, logistic regression, neural networks, support vector machines, classification trees and random forests.

    Science.gov (United States)

    Maroco, João; Silva, Dina; Rodrigues, Ana; Guerreiro, Manuela; Santana, Isabel; de Mendonça, Alexandre

    2011-08-17

    Dementia and cognitive impairment associated with aging are a major medical and social concern. Neuropsychological testing is a key element in the diagnostic procedures of Mild Cognitive Impairment (MCI), but has presently a limited value in the prediction of progression to dementia. We advance the hypothesis that newer statistical classification methods derived from data mining and machine learning methods like Neural Networks, Support Vector Machines and Random Forests can improve accuracy, sensitivity and specificity of predictions obtained from neuropsychological testing. Seven non parametric classifiers derived from data mining methods (Multilayer Perceptrons Neural Networks, Radial Basis Function Neural Networks, Support Vector Machines, CART, CHAID and QUEST Classification Trees and Random Forests) were compared to three traditional classifiers (Linear Discriminant Analysis, Quadratic Discriminant Analysis and Logistic Regression) in terms of overall classification accuracy, specificity, sensitivity, Area under the ROC curve and Press'Q. Model predictors were 10 neuropsychological tests currently used in the diagnosis of dementia. Statistical distributions of classification parameters obtained from a 5-fold cross-validation were compared using the Friedman's nonparametric test. Press' Q test showed that all classifiers performed better than chance alone (p classification accuracy (Median (Me) = 0.76) an area under the ROC (Me = 0.90). However this method showed high specificity (Me = 1.0) but low sensitivity (Me = 0.3). Random Forest ranked second in overall accuracy (Me = 0.73) with high area under the ROC (Me = 0.73) specificity (Me = 0.73) and sensitivity (Me = 0.64). Linear Discriminant Analysis also showed acceptable overall accuracy (Me = 0.66), with acceptable area under the ROC (Me = 0.72) specificity (Me = 0.66) and sensitivity (Me = 0.64). The remaining classifiers showed overall classification accuracy above a median value of 0.63, but for most

  9. Analysis of missing data with random forests

    OpenAIRE

    Hapfelmeier, Alexander

    2012-01-01

    Random Forests are widely used for data prediction and interpretation purposes. They show many appealing characteristics, such as the ability to deal with high dimensional data, complex interactions and correlations. Furthermore, missing values can easily be processed by the built-in procedure of surrogate splits. However, there is only little knowledge about the properties of recursive partitioning in missing data situations. Therefore, extensive simulation studies and empir...

  10. Multi-level tree analysis of pulmonary artery/vein trees in non-contrast CT images

    Science.gov (United States)

    Gao, Zhiyun; Grout, Randall W.; Hoffman, Eric A.; Saha, Punam K.

    2012-02-01

    Diseases like pulmonary embolism and pulmonary hypertension are associated with vascular dystrophy. Identifying such pulmonary artery/vein (A/V) tree dystrophy in terms of quantitative measures via CT imaging significantly facilitates early detection of disease or a treatment monitoring process. A tree structure, consisting of nodes and connected arcs, linked to the volumetric representation allows multi-level geometric and volumetric analysis of A/V trees. Here, a new theory and method is presented to generate multi-level A/V tree representation of volumetric data and to compute quantitative measures of A/V tree geometry and topology at various tree hierarchies. The new method is primarily designed on arc skeleton computation followed by a tree construction based topologic and geometric analysis of the skeleton. The method starts with a volumetric A/V representation as input and generates its topologic and multi-level volumetric tree representations long with different multi-level morphometric measures. A new recursive merging and pruning algorithms are introduced to detect bad junctions and noisy branches often associated with digital geometric and topologic analysis. Also, a new notion of shortest axial path is introduced to improve the skeletal arc joining two junctions. The accuracy of the multi-level tree analysis algorithm has been evaluated using computer generated phantoms and pulmonary CT images of a pig vessel cast phantom while the reproducibility of method is evaluated using multi-user A/V separation of in vivo contrast-enhanced CT images of a pig lung at different respiratory volumes.

  11. Predicting the distribution of out-of-reach biotopes with decision trees in a Swedish marine protected area.

    Science.gov (United States)

    Gonzalez-Mirelis, Genoveva; Lindegarth, Mats

    2012-12-01

    Through spatially explicit predictive models, knowledge of spatial patterns of biota can be generated for out-of-reach environments, where there is a paucity of survey data. This knowledge is invaluable for conservation decisions. We used distribution modeling to predict the occurrence of benthic biotopes, or megafaunal communities of the seabed, to support the spatial planning of a marine national park. Nine biotope classes were obtained prior to modeling from multivariate species data derived from point source, underwater imagery. Five map layers relating to depth and terrain were used as predictor variables. Biotope type was predicted on a pixel-by-pixel basis, where pixel size was 15 x 15 m and total modeled area was 455 km2. To choose a suitable modeling technique we compared the performance of five common models based on recursive partitioning: two types of classification and regression trees ([1] pruned by 10-fold cross-validation and [2] pruned by minimizing complexity), random forests, conditional inference (CI) trees, and CI forests. The selected model was a CI forest (an ensemble of CI trees), a machine-learning technique whose discriminatory power (class-by-class area under the curve [AUC] ranged from 0.75 to 0.86) and classification accuracy (72%) surpassed those of the other methods tested. Conditional inference trees are virtually new to the field of ecology. The final model's overall prediction error was 28%. Model predictions were also checked against a custom-built measure of dubiousness, calculated at the polygon level. Key factors other than the choice of modeling technique include: the use of a multinomial response, accounting for the heterogeneity of observations, and spatial autocorrelation. To illustrate how the model results can be implemented in spatial planning, representation of biodiversity in the national park was described and quantified. Given a goal of maximizing classification accuracy, we conclude that conditional inference trees

  12. Composition and distribution of economic tree species in Nagi ...

    African Journals Online (AJOL)

    The inventory of economic trees in Nagi Natural Forest Reserve, Benue state was carried out to determine the status and dominance tree species. A total area of 0.4ha was sampled representing twenty percent of the reserve. Ten (10) sample plots of equal size (20 m x 20m) were randomly selected using simple random ...

  13. Boundary expansion algorithm of a decision tree induction for an imbalanced dataset

    Directory of Open Access Journals (Sweden)

    Kesinee Boonchuay

    2017-10-01

    Full Text Available A decision tree is one of the famous classifiers based on a recursive partitioning algorithm. This paper introduces the Boundary Expansion Algorithm (BEA to improve a decision tree induction that deals with an imbalanced dataset. BEA utilizes all attributes to define non-splittable ranges. The computed means of all attributes for minority instances are used to find the nearest minority instance, which will be expanded along all attributes to cover a minority region. As a result, BEA can successfully cope with an imbalanced dataset comparing with C4.5, Gini, asymmetric entropy, top-down tree, and Hellinger distance decision tree on 25 imbalanced datasets from the UCI Repository.

  14. Additive Similarity Trees

    Science.gov (United States)

    Sattath, Shmuel; Tversky, Amos

    1977-01-01

    Tree representations of similarity data are investigated. Hierarchical clustering is critically examined, and a more general procedure, called the additive tree, is presented. The additive tree representation is then compared to multidimensional scaling. (Author/JKS)

  15. City of Pittsburgh Trees

    Data.gov (United States)

    Allegheny County / City of Pittsburgh / Western PA Regional Data Center — Trees cared for and managed by the City of Pittsburgh Department of Public Works Forestry Division. Tree Benefits are calculated using the National Tree Benefit...

  16. Predicting cannabis abuse screening test (CAST scores: a recursive partitioning analysis using survey data from Czech Republic, Italy, the Netherlands and Sweden.

    Directory of Open Access Journals (Sweden)

    Matthijs Blankers

    Full Text Available Cannabis is Europe's most commonly used illicit drug. Some users do not develop dependence or other problems, whereas others do. Many factors are associated with the occurrence of cannabis-related disorders. This makes it difficult to identify key risk factors and markers to profile at-risk cannabis users using traditional hypothesis-driven approaches. Therefore, the use of a data-mining technique called binary recursive partitioning is demonstrated in this study by creating a classification tree to profile at-risk users.59 variables on cannabis use and drug market experiences were extracted from an internet-based survey dataset collected in four European countries (Czech Republic, Italy, Netherlands and Sweden, n = 2617. These 59 potential predictors of problematic cannabis use were used to partition individual respondents into subgroups with low and high risk of having a cannabis use disorder, based on their responses on the Cannabis Abuse Screening Test. Both a generic model for the four countries combined and four country-specific models were constructed.Of the 59 variables included in the first analysis step, only three variables were required to construct a generic partitioning model to classify high risk cannabis users with 65-73% accuracy. Based on the generic model for the four countries combined, the highest risk for cannabis use disorder is seen in participants reporting a cannabis use on more than 200 days in the last 12 months. In comparison to the generic model, the country-specific models led to modest, non-significant improvements in classification accuracy, with an exception for Italy (p = 0.01.Using recursive partitioning, it is feasible to construct classification trees based on only a few variables with acceptable performance to classify cannabis users into groups with low or high risk of meeting criteria for cannabis use disorder. The number of cannabis use days in the last 12 months is the most relevant variable

  17. Recursive Focal Plane Wavefront and Bias Estimation for the Direct Imaging of Exoplanets

    Science.gov (United States)

    Eldorado Riggs, A. J.; Kasdin, N. Jeremy; Groff, Tyler Dean

    2016-01-01

    To image the reflected light from exoplanets and disks, an instrument must suppress diffracted starlight by about nine orders of magnitude. A coronagraph alters the stellar PSF to create regions of high contrast, but it is extremely sensitive to wavefront aberrations. Deformable mirrors (DMs) are necessary to mitigate these quasi-static aberrations and recover high-contrast. To avoid non-common path aberrations, the science camera must be used as the primary wavefront sensor. Focal plane wavefront correction is an iterative process, and obtaining sufficient signal in the dark holes requires long exposure times. The fastest coronagraphic wavefront correction techniques require estimates of the stellar electric field. The main challenge of coronagraphy is thus to perform complex wavefront estimation quickly and efficiently using intensity images from the camera. The most widely applicable and tested technique is DM Diversity, in which a DM modulates the focal plane intensity and several images are used to reconstruct the stellar electric field in a batch process. At the High Contrast Imaging Lab (HCIL) at Princeton, we have developed an iterative extended Kalman filter (IEKF) to improve upon this technique. The IEKF enables recursive starlight estimation and can utilize fewer images per iteration, thereby speeding up wavefront correction. This IEKF formulation also estimates the bias in the images recursively. Since exoplanets and disks are embedded in the incoherent bias signal, the IEKF enables detection of science targets during wavefront correction. Here we present simulated and experimental results from Princeton's HCIL demonstrating the effectiveness of the IEKF for recursive electric field estimation and exoplanet detection.

  18. Recursive regularization for inferring gene networks from time-course gene expression profiles

    Directory of Open Access Journals (Sweden)

    Nagasaki Masao

    2009-04-01

    Full Text Available Abstract Background Inferring gene networks from time-course microarray experiments with vector autoregressive (VAR model is the process of identifying functional associations between genes through multivariate time series. This problem can be cast as a variable selection problem in Statistics. One of the promising methods for variable selection is the elastic net proposed by Zou and Hastie (2005. However, VAR modeling with the elastic net succeeds in increasing the number of true positives while it also results in increasing the number of false positives. Results By incorporating relative importance of the VAR coefficients into the elastic net, we propose a new class of regularization, called recursive elastic net, to increase the capability of the elastic net and estimate gene networks based on the VAR model. The recursive elastic net can reduce the number of false positives gradually by updating the importance. Numerical simulations and comparisons demonstrate that the proposed method succeeds in reducing the number of false positives drastically while keeping the high number of true positives in the network inference and achieves two or more times higher true discovery rate (the proportion of true positives among the selected edges than the competing methods even when the number of time points is small. We also compared our method with various reverse-engineering algorithms on experimental data of MCF-7 breast cancer cells stimulated with two ErbB ligands, EGF and HRG. Conclusion The recursive elastic net is a powerful tool for inferring gene networks from time-course gene expression profiles.

  19. Prediction of gait outcome with the knee-ankle-foot orthosis with medial hip joint in patients with spinal cord injuries: a study using recursive partitioning analysis.

    Science.gov (United States)

    Suzuki, T; Sonoda, S; Saitoh, E; Onogi, K; Fujino, H; Teranishi, T; Oyobe, T; Katoh, M; Ohtsuka, K

    2007-01-01

    Retrospective study of the degree of gait independence achieved by persons with spinal cord injury (SCI) using knee-ankle-foot orthosis with a medial single hip joint (MSH-KAFO). To examine the effects of the neurological level, degree of paresis, age, and inhibitory physical/other factors on the gait with a MSH-KAFO in patients with SCIs. Three university hospitals and two rehabilitation hospitals in Japan. The 45 patients (36 men, nine women) examined included 10 with injuries in the cervical cord between C6 and C8 (group C), 20 with injuries in the upper-middle thoracic cord between T4 and T10 (group UT), and 15 with injuries in the lower thoracic-lumbar cord between T12 and L1 (group TL). Mean age was 34.0 years (range 16-68 years). Of these patients, 13 used the Walkabout, four used the gear joint, and 28 used the Primewalk as the medial hip joint. Recursive partitioning, which predicted the final status of gait from the level, degree of paresis, age, and inhibitory factors, was performed, and a decision tree for gait was constructed. Inhibitory factors were spasticity, involuntary spasms or muscle contractions, pain, contracture, weakness of the upper extremities, and decreased motivation to perform gait exercise. The degree of gait independence was rated on the following five-point scale: outdoor independent gait (5 points), indoor independent gait (4 points), indoor supervised gait (3 points), indoor assisted gait (2 points), and gait within parallel bars (1 point). New branches were added to the decision tree for gait based on the clinical experience, thereby constructing a new decision tree. The coincident ratio between the value predicted on the basis of the decision tree of gait and the value actually observed was 53.3%. The coincident ratio between the value predicted on the basis of the modified decision tree of gait and the actually observed value was 68.9%. The results provide valuable information to medical teams that may assist prescription of

  20. A 3-D nonlinear recursive digital filter for video image processing

    Science.gov (United States)

    Bauer, P. H.; Qian, W.

    1991-01-01

    This paper introduces a recursive 3-D nonlinear digital filter, which is capable of performing noise suppression without degrading important image information such as edges in space or time. It also has the property of unnoticeable bandwidth reduction immediately after a scene change, which makes the filter an attractive preprocessor to many interframe compression algorithms. The filter consists of a nonlinear 2-D spatial subfilter and a 1-D temporal filter. In order to achieve the required computational speed and increase the flexibility of the filter, all of the linear shift-variant filter modules are of the IIR type.

  1. Recursive nearest neighbor search in a sparse and multiscale domain for comparing audio signals

    DEFF Research Database (Denmark)

    Sturm, Bob L.; Daudet, Laurent

    2011-01-01

    of time-frequency atoms. Theoretically, error bounds on these approximations provide efficient means for quickly reducing the search space to the nearest neighborhood of a given data; but we demonstrate here that the best bound defined thus far involving a probabilistic assumption does not provide......We investigate recursive nearest neighbor search in a sparse domain at the scale of audio signals. Essentially, to approximate the cosine distance between the signals we make pairwise comparisons between the elements of localized sparse models built from large and redundant multiscale dictionaries...

  2. Probabilistic forecasting of the solar irradiance with recursive ARMA and GARCH models

    DEFF Research Database (Denmark)

    David, M.; Ramahatana, F.; Trombe, Pierre-Julien

    2016-01-01

    sky index show some similarities with that of financial time series. The aim of this paper is to assess the performances of a commonly used combination of two linear models (ARMA and GARCH) in econometrics in order to provide probabilistic forecasts of solar irradiance. In addition, a recursive...... of the grid-connected storage systems. If numerous methods for forecasting the mean of the solar irradiance were recently developed, there are only few works dedicated to the evaluation of prediction intervals associated to these point forecasts. Time series of solar irradiance and more specifically of clear...

  3. Nonsmooth Recursive Identification of Sandwich Systems with Backlash-Like Hysteresis

    Directory of Open Access Journals (Sweden)

    Ruili Dong

    2012-01-01

    Full Text Available A recursive gradient identification algorithm based on the bundle method for sandwich systems with backlash-like hysteresis is presented in this paper. In this method, a dynamic parameter estimation scheme based on a subgradient is developed to handle the nonsmooth problem caused by the backlash embedded in the system. The search direction of the algorithm is estimated based on the so-called bundle method. Then, the convergence of the algorithm is discussed. After that, simulation results on a nonsmooth sandwich system are presented to validate the proposed estimation algorithm. Finally, the application of the proposed method to an X-Y moving positioning stage is illustrated.

  4. Recursive Cluster Elimination (RCE for classification and feature selection from gene expression data

    Directory of Open Access Journals (Sweden)

    Showe Louise C

    2007-05-01

    Full Text Available Abstract Background Classification studies using gene expression datasets are usually based on small numbers of samples and tens of thousands of genes. The selection of those genes that are important for distinguishing the different sample classes being compared, poses a challenging problem in high dimensional data analysis. We describe a new procedure for selecting significant genes as recursive cluster elimination (RCE rather than recursive feature elimination (RFE. We have tested this algorithm on six datasets and compared its performance with that of two related classification procedures with RFE. Results We have developed a novel method for selecting significant genes in comparative gene expression studies. This method, which we refer to as SVM-RCE, combines K-means, a clustering method, to identify correlated gene clusters, and Support Vector Machines (SVMs, a supervised machine learning classification method, to identify and score (rank those gene clusters for the purpose of classification. K-means is used initially to group genes into clusters. Recursive cluster elimination (RCE is then applied to iteratively remove those clusters of genes that contribute the least to the classification performance. SVM-RCE identifies the clusters of correlated genes that are most significantly differentially expressed between the sample classes. Utilization of gene clusters, rather than individual genes, enhances the supervised classification accuracy of the same data as compared to the accuracy when either SVM or Penalized Discriminant Analysis (PDA with recursive feature elimination (SVM-RFE and PDA-RFE are used to remove genes based on their individual discriminant weights. Conclusion SVM-RCE provides improved classification accuracy with complex microarray data sets when it is compared to the classification accuracy of the same datasets using either SVM-RFE or PDA-RFE. SVM-RCE identifies clusters of correlated genes that when considered together

  5. Fast Multilevel Implementation of Recursive Spectral Bisection for Partitioning Unstructured Problems

    Science.gov (United States)

    Barnard, Stephen T.; Simon, Horst D.

    1993-01-01

    If problems involving unstructured meshes are to be solved efficiently on distributed-memory parallel computers, the meshes must be partitioned and distributed across processors in a way that balances tile computational load and minimizes communication. The recursive spectral bisection method (RSB) has been shown to be very effective for such partitioning problems compared to alternative methods, but RSB in its simplest form is expensive. Here a multilevel version of RSB is introduced that attains about an order-of-magnitude improvement in run time on typical examples.

  6. Recursive cluster elimination (RCE) for classification and feature selection from gene expression data.

    Science.gov (United States)

    Yousef, Malik; Jung, Segun; Showe, Louise C; Showe, Michael K

    2007-05-02

    Classification studies using gene expression datasets are usually based on small numbers of samples and tens of thousands of genes. The selection of those genes that are important for distinguishing the different sample classes being compared, poses a challenging problem in high dimensional data analysis. We describe a new procedure for selecting significant genes as recursive cluster elimination (RCE) rather than recursive feature elimination (RFE). We have tested this algorithm on six datasets and compared its performance with that of two related classification procedures with RFE. We have developed a novel method for selecting significant genes in comparative gene expression studies. This method, which we refer to as SVM-RCE, combines K-means, a clustering method, to identify correlated gene clusters, and Support Vector Machines (SVMs), a supervised machine learning classification method, to identify and score (rank) those gene clusters for the purpose of classification. K-means is used initially to group genes into clusters. Recursive cluster elimination (RCE) is then applied to iteratively remove those clusters of genes that contribute the least to the classification performance. SVM-RCE identifies the clusters of correlated genes that are most significantly differentially expressed between the sample classes. Utilization of gene clusters, rather than individual genes, enhances the supervised classification accuracy of the same data as compared to the accuracy when either SVM or Penalized Discriminant Analysis (PDA) with recursive feature elimination (SVM-RFE and PDA-RFE) are used to remove genes based on their individual discriminant weights. SVM-RCE provides improved classification accuracy with complex microarray data sets when it is compared to the classification accuracy of the same datasets using either SVM-RFE or PDA-RFE. SVM-RCE identifies clusters of correlated genes that when considered together provide greater insight into the structure of the

  7. Recursive differentiation method to study the nature of carbon nanobeams: A numerical approach

    Science.gov (United States)

    Nagar, Priyanka; Tiwari, Parul

    2017-10-01

    This paper is concerned with the application of non-local elasticity theory to analyze the nature of carbon nanotubes/nanobeams embedded in an elastic medium. Winkler-type foundation is used as an elastic medium. The governing equations are investigated by finding the critical buckling load with aid of Recursive Differentiation Method. This method requires less computation time and thus the convergence is fast. The effects of small scale parameter and elastic foundation on buckling load are observed and outputs are plotted graphically. In addition, the accuracy of the present method is verified with the results available in literature.

  8. Memory Hierarchy Behavior Study during the Execution of Recursive Linear Algebra Library

    Directory of Open Access Journals (Sweden)

    I. Šimeček

    2008-01-01

    Full Text Available For good performance of every computer program, good cache and TLB utilization is crucial. In numerical linear algebra libraries (such as BLAS or LAPACK, good cache utilization is achieved by explicit loop restructuring (mainly loop blocking, but this requires difficult memory pattern behavior analysis. In this paper, we represent the recursive implementation (“divide and conquer” approach of some routines from numerical algebra libraries. This implementation leads to good cache and TLB utilization with no need to analyze the memory pattern behavior due to “natural” partition of data. 

  9. Recursive Averaging

    Science.gov (United States)

    Smith, Scott G.

    2015-01-01

    In this article, Scott Smith presents an innocent problem (Problem 12 of the May 2001 Calendar from "Mathematics Teacher" ("MT" May 2001, vol. 94, no. 5, p. 384) that was transformed by several timely "what if?" questions into a rewarding investigation of some interesting mathematics. These investigations led to two…

  10. Geometric recursion

    DEFF Research Database (Denmark)

    Andersen, Jørgen Ellegaard; Borot, Gaëtan; Orantin, Nicolas

    We propose a general theory whose main component are functorial assignments ∑→Ω∑ ∈ E (∑), for a large class of functors E from a certain category of bordered surfaces (∑'s) to a suitable a target category of topological vector spaces. The construction is done by summing appropriate compositions o...... by integration of the GR amplitudes over the moduli space of bordered Riemann surfaces and Laplace transform with respect the boundary lengths. In this regard, the structure of the Mirzakhani-McShane identities served as a prototype of GR.......We propose a general theory whose main component are functorial assignments ∑→Ω∑ ∈ E (∑), for a large class of functors E from a certain category of bordered surfaces (∑'s) to a suitable a target category of topological vector spaces. The construction is done by summing appropriate compositions...... of the initial data over all homotopy classes of successive excisions of embedded pair of pants. We provide sufficient conditions to guarantee these infinite sums converge and as a result, we can generate mapping class group invariant vectors Ω∑ which we call amplitudes. The initial data encode the amplitude...

  11. The combinatorics of tandem duplication trees.

    Science.gov (United States)

    Gascuel, Olivier; Hendy, Michael D; Jean-Marie, Alain; McLachlan, Robert

    2003-02-01

    We developed a recurrence relation that counts the number of tandem duplication trees (either rooted or unrooted) that are consistent with a set of n tandemly repeated sequences generated under the standard unequal recombination (or crossover) model of tandem duplications. The number of rooted duplication trees is exactly twice the number of unrooted trees, which means that on average only two positions for a root on a duplication tree are possible. Using the recurrence, we tabulated these numbers for small values of n. We also developed an asymptotic formula that for large n provides estimates for these numbers. These numbers give a priori probabilities for phylogenies of the repeated sequences to be duplication trees. This work extends earlier studies where exhaustive counts of the numbers for small n were obtained. One application showed the significance of finding that most maximum-parsimony trees constructed from repeat sequences from human immunoglobins and T-cell receptors were tandem duplication trees. Those findings provided strong support to the proposed mechanisms of tandem gene duplication. The recurrence relation also suggests efficient algorithms to recognize duplication trees and to generate random duplication trees for simulation. We present a linear-time recognition algorithm.

  12. Building optimal regression tree by ant colony system-genetic algorithm: Application to modeling of melting points

    Energy Technology Data Exchange (ETDEWEB)

    Hemmateenejad, Bahram, E-mail: hemmatb@sums.ac.ir [Department of Chemistry, Shiraz University, Shiraz (Iran, Islamic Republic of); Medicinal and Natural Products Chemistry Research Center, Shiraz University of Medical Sciences, Shiraz (Iran, Islamic Republic of); Shamsipur, Mojtaba [Department of Chemistry, Razi University, Kermanshah (Iran, Islamic Republic of); Zare-Shahabadi, Vali [Young Researchers Club, Mahshahr Branch, Islamic Azad University, Mahshahr (Iran, Islamic Republic of); Akhond, Morteza [Department of Chemistry, Shiraz University, Shiraz (Iran, Islamic Republic of)

    2011-10-17

    Highlights: {yields} Ant colony systems help to build optimum classification and regression trees. {yields} Using of genetic algorithm operators in ant colony systems resulted in more appropriate models. {yields} Variable selection in each terminal node of the tree gives promising results. {yields} CART-ACS-GA could model the melting point of organic materials with prediction errors lower than previous models. - Abstract: The classification and regression trees (CART) possess the advantage of being able to handle large data sets and yield readily interpretable models. A conventional method of building a regression tree is recursive partitioning, which results in a good but not optimal tree. Ant colony system (ACS), which is a meta-heuristic algorithm and derived from the observation of real ants, can be used to overcome this problem. The purpose of this study was to explore the use of CART and its combination with ACS for modeling of melting points of a large variety of chemical compounds. Genetic algorithm (GA) operators (e.g., cross averring and mutation operators) were combined with ACS algorithm to select the best solution model. In addition, at each terminal node of the resulted tree, variable selection was done by ACS-GA algorithm to build an appropriate partial least squares (PLS) model. To test the ability of the resulted tree, a set of approximately 4173 structures and their melting points were used (3000 compounds as training set and 1173 as validation set). Further, an external test set containing of 277 drugs was used to validate the prediction ability of the tree. Comparison of the results obtained from both trees showed that the tree constructed by ACS-GA algorithm performs better than that produced by recursive partitioning procedure.

  13. The canary tree

    OpenAIRE

    Mekler, Alan H.; Shelah, Saharon

    1993-01-01

    A canary tree is a tree of cardinality the continuum which has no uncountable branch, but gains a branch whenever a stationary set is destroyed (without adding reals). Canary trees are important in infinitary model theory. The existence of a canary tree is independent of ZFC + GCH.

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

  15. A recursive field-normalized bibliometric performance indicator: an application to the field of library and information science.

    Science.gov (United States)

    Waltman, Ludo; Yan, Erjia; van Eck, Nees Jan

    2011-10-01

    Two commonly used ideas in the development of citation-based research performance indicators are the idea of normalizing citation counts based on a field classification scheme and the idea of recursive citation weighing (like in PageRank-inspired indicators). We combine these two ideas in a single indicator, referred to as the recursive mean normalized citation score indicator, and we study the validity of this indicator. Our empirical analysis shows that the proposed indicator is highly sensitive to the field classification scheme that is used. The indicator also has a strong tendency to reinforce biases caused by the classification scheme. Based on these observations, we advise against the use of indicators in which the idea of normalization based on a field classification scheme and the idea of recursive citation weighing are combined.

  16. Kernel Recursive Least-Squares Temporal Difference Algorithms with Sparsification and Regularization

    Directory of Open Access Journals (Sweden)

    Chunyuan Zhang

    2016-01-01

    Full Text Available By combining with sparse kernel methods, least-squares temporal difference (LSTD algorithms can construct the feature dictionary automatically and obtain a better generalization ability. However, the previous kernel-based LSTD algorithms do not consider regularization and their sparsification processes are batch or offline, which hinder their widespread applications in online learning problems. In this paper, we combine the following five techniques and propose two novel kernel recursive LSTD algorithms: (i online sparsification, which can cope with unknown state regions and be used for online learning, (ii L2 and L1 regularization, which can avoid overfitting and eliminate the influence of noise, (iii recursive least squares, which can eliminate matrix-inversion operations and reduce computational complexity, (iv a sliding-window approach, which can avoid caching all history samples and reduce the computational cost, and (v the fixed-point subiteration and online pruning, which can make L1 regularization easy to implement. Finally, simulation results on two 50-state chain problems demonstrate the effectiveness of our algorithms.

  17. Application of the Recursive Finite Element Approach on 2D Periodic Structures under Harmonic Vibrations

    Directory of Open Access Journals (Sweden)

    Reem Yassine

    2016-12-01

    Full Text Available The frequency response function is a quantitative measure used in structural analysis and engineering design; hence, it is targeted for accuracy. For a large structure, a high number of substructures, also called cells, must be considered, which will lead to a high amount of computational time. In this paper, the recursive method, a finite element method, is used for computing the frequency response function, independent of the number of cells with much lesser time costs. The fundamental principle is eliminating the internal degrees of freedom that are at the interface between a cell and its succeeding one. The method is applied solely for free (no load nodes. Based on the boundary and interior degrees of freedom, the global dynamic stiffness matrix is computed by means of products and inverses resulting with a dimension the same as that for one cell. The recursive method is demonstrated on periodic structures (cranes and buildings under harmonic vibrations. The method yielded a satisfying time decrease with a maximum time ratio of 1 18 and a percentage difference of 19%, in comparison with the conventional finite element method. Close values were attained at low and very high frequencies; the analysis is supported for two types of materials (steel and plastic. The method maintained its efficiency with a high number of forces, excluding the case when all of the nodes are under loads.

  18. Issues concerning Landowner Management Plan Adoption Decisions: A Recursive Bivariate Probit Approach

    Directory of Open Access Journals (Sweden)

    Omkar Joshi

    2015-01-01

    Full Text Available Despite the likely benefits of having a written forest management plan, a small number of landowners in the United States have the one. A recursive bivariate probit model was used to identify the possible relationship between landowners’ decision to obtain a management plan and their interest in future timber harvesting. Our study results based on recursive bivariate model suggest that landowners having larger land ownerships, longer forest ownership tenure, and higher education were more likely to have a forest management plan and future timber harvesting interest. While the landowners having interest for wildlife management were also interested to have a written management plan, they did not prefer to harvest in future. Study results indicate that written management plan means more than a timber harvesting strategy to landowners in general. Many elderly landowners with a low level of income and less formal education and those having small or medium sized tracts of forestland are less likely to own a written management plan. Therefore, this group requires special attention in various government sponsored forest management related extension activities. Future research on understanding landowner perception behind written management plan is recommended.

  19. Exploring biological relationships between calving traits in primiparous cattle with a Bayesian recursive model.

    Science.gov (United States)

    de Maturana, Evangelina López; Wu, Xiao-Lin; Gianola, Daniel; Weigel, Kent A; Rosa, Guilherme J M

    2009-01-01

    Structural equation models (SEMs) of a recursive type with heterogeneous structural coefficients were used to explore biological relationships between gestation length (GL), calving difficulty (CD), and perinatal mortality, also known as stillbirth (SB), in cattle, with the last two traits having categorical expression. An acyclic model was assumed, where recursive effects existed from the GL phenotype to the liabilities (latent variables) to CD and SB and from the liability to CD to that of SB considering four periods regarding GL. The data contained GL, CD, and SB records from 90,393 primiparous cows, sired by 1122 bulls, distributed over 935 herd-calving year classes. Low genetic correlations between GL and the other calving traits were found, whereas the liabilities to CD and SB were high and positively correlated, genetically. The model indicated that gestations of approximately 274 days of length (3 days shorter than the average) would lead to the lowest CD and SB and confirmed the existence of an intermediate optimum of GL with respect to these traits.

  20. CP-recursion and the derivation of verb second in Germanic main and embedded clauses

    DEFF Research Database (Denmark)

    Vikner, Sten

    2017-01-01

    This paper will give an overview of the verb second (V2) phenomenon, as found in both main and embedded clauses in Germanic, and it will also explore a particular derivation of (embedded) V2, in terms of a cP/CP-distinction. All the Germanic languages except modern English (but including e. g. Old......, this is normally not the case for all types of embedded clauses, as e. g. embedded questions (almost) never allow V2 (Julien 2007, Vikner 2001, though see McCloskey 2006 and Biberauer 2015). As in Nyvad et al. (2016), I will explore a particular derivation of (embedded) V2, in terms of a cP/CP-distinction, which...... may be seen as a version of the CP-recursion analysis (deHaan & Weerman 1986, Vikner 1995 and many others). The idea is that because embedded V2 clauses do not allow extraction, whereas other types of CP-recursion clauses do (Christensen et al. 2013a; Christensen et al. 2013b; Christensen & Nyvad 2014...

  1. Recursive organizer (ROR): an analytic framework for sequence-based association analysis.

    Science.gov (United States)

    Zhao, Lue Ping; Huang, Xin

    2013-07-01

    The advent of next-generation sequencing technologies affords the ability to sequence thousands of subjects cost-effectively, and is revolutionizing the landscape of genetic research. With the evolving genotyping/sequencing technologies, it is not unrealistic to expect that we will soon obtain a pair of diploidic fully phased genome sequences from each subject in the near future. Here, in light of this potential, we propose an analytic framework called, recursive organizer (ROR), which recursively groups sequence variants based upon sequence similarities and their empirical disease associations, into fewer and potentially more interpretable super sequence variants (SSV). As an illustration, we applied ROR to assess an association between HLA-DRB1 and type 1 diabetes (T1D), discovering SSVs of HLA-DRB1 with sequence data from the Wellcome Trust Case Control Consortium. Specifically, ROR reduces 36 observed unique HLA-DRB1 sequences into 8 SSVs that empirically associate with T1D, a fourfold reduction of sequence complexity. Using HLA-DRB1 data from Type 1 Diabetes Genetics Consortium as cases and data from Fred Hutchinson Cancer Research Center as controls, we are able to validate associations of these SSVs with T1D. Further, SSVs consist of nine nucleotides, and each associates with its corresponding amino acids. Detailed examination of these selected amino acids reveals their potential functional roles in protein structures and possible implication to the mechanism of T1D.

  2. Recursive Differential Evolution Algorithm for Inertia Parameter Identification of Space Manipulator

    Directory of Open Access Journals (Sweden)

    Zhengxiong Liu

    2016-05-01

    Full Text Available This paper proposes a recursive differential evolution (RDE algorithm to identify the inertial parameters of an unknown target and simultaneously revise the friction parameters of space manipulator joints. The inertia parameters of a space manipulator, which govern the dynamic behaviours of the entire system to a significant extent, can change for many reasons during the process of on-orbit operations; consequently, it is essential to trace these changes within the control system to ensure the stability and accuracy of the entire system. RDE is inspired by a recursive least squares algorithm, using approximate gradient information to guide the mutation operation in the standard DE. A series of contrast simulations are employed to confirm the feasibility of the RDE algorithm. The simulation results show that the identification of the RDE algorithm is more precise than for a GA (genetic algorithm and LS (least square algorithm, and has an appropriate convergence rate. The RDE identification method is suitable for linear, nonlinear and combined systems, and can follow system dynamics exactly.

  3. Improving the computational efficiency of recursive cluster elimination for gene selection.

    Science.gov (United States)

    Luo, Lin-Kai; Huang, Deng-Feng; Ye, Ling-Jun; Zhou, Qi-Feng; Shao, Gui-Fang; Peng, Hong

    2011-01-01

    The gene expression data are usually provided with a large number of genes and a relatively small number of samples, which brings a lot of new challenges. Selecting those informative genes becomes the main issue in microarray data analysis. Recursive cluster elimination based on support vector machine (SVM-RCE) has shown the better classification accuracy on some microarray data sets than recursive feature elimination based on support vector machine (SVM-RFE). However, SVM-RCE is extremely time-consuming. In this paper, we propose an improved method of SVM-RCE called ISVM-RCE. ISVM-RCE first trains a SVM model with all clusters, then applies the infinite norm of weight coefficient vector in each cluster to score the cluster, finally eliminates the gene clusters with the lowest score. In addition, ISVM-RCE eliminates genes within the clusters instead of removing a cluster of genes when the number of clusters is small. We have tested ISVM-RCE on six gene expression data sets and compared their performances with SVM-RCE and linear-discriminant-analysis-based RFE (LDA-RFE). The experiment results on these data sets show that ISVM-RCE greatly reduces the time cost of SVM-RCE, meanwhile obtains comparable classification performance as SVM-RCE, while LDA-RFE is not stable.

  4. Recursive Gauss-Seidel median filter for CT lung image denoising

    Science.gov (United States)

    Dewi, Dyah Ekashanti Octorina; Faudzi, Ahmad Athif Mohd.; Mengko, Tati Latifah; Suzumori, Koichi

    2017-02-01

    Poisson and Gaussian noises have been known to affect Computed Tomography (CT) image quality during reconstruction. Standard median (SM) Filter has been widely used to reduce the unwanted impulsive noises. However, it cannot perform satisfactorily once the noise density is high. Recursive median (RM) filter has also been proposed to optimize the denoising. On the other hand, the image quality is degraded. In this paper, we propose a hybrid recursive median (RGSM) filtering technique by using Gauss-Seidel Relaxation to enhance denoising and preserve image quality in RM filter. First, the SM filtering was performed, followed by Gauss-Seidel, and combined to generate secondary approximation solution. This scheme was iteratively done by applying the secondary approximation solution to the successive iterations. Progressive noise reduction was accomplished in every iterative stage. The last stage generated the final solution. Experiments on CT lung images show that the proposed technique has higher noise reduction improvements compared to the conventional RM filtering. The results have also confirmed better anatomical quality preservation. The proposed technique may improve lung nodules segmentation and characterization performance.

  5. Continuous Recursive Sliding Mode Control for Hypersonic Flight Vehicle with Extended Disturbance Observer

    Directory of Open Access Journals (Sweden)

    Yunjie Wu

    2015-01-01

    Full Text Available A continuous recursive sliding mode controller (CRSMC with extended disturbance observer (EDO is proposed for the longitudinal dynamics of a generic hypersonic flight vehicle (HFV in the presence of multiple uncertainties under control constraints. Firstly, sliding mode tracking controller based on a set of novel recursive sliding mode manifolds is presented, in which the chattering problem is reduced. The CRSMC possesses the merits of both nonsingular terminal sliding mode controller (NTSMC and high-order sliding mode controller (HOSMC. Then antiwindup controller is designed according to the input constraints, which adds a dynamic compensation factor in the CRSMC. For the external disturbance of system, an improved disturbance observer based on extended disturbance observer (EDO is designed. The external disturbance is estimated by the disturbance observer and the estimated value is regarded as compensation in CRSMC for disturbance. The stability of the proposed scheme is analyzed by Lyapunov function theory. Finally, numerical simulation is conducted for cruise flight dynamics of HFV, where altitude is 110000 ft, velocity is 15060 ft/s, and Mach is 15. Simulation results show the validity of the proposed approach.

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

  7. Hierarchical Recursive Organization and the Free Energy Principle: From Biological Self-Organization to the Psychoanalytic Mind.

    Science.gov (United States)

    Connolly, Patrick; van Deventer, Vasi

    2017-01-01

    The present paper argues that a systems theory epistemology (and particularly the notion of hierarchical recursive organization) provides the critical theoretical context within which the significance of Friston's (2010a) Free Energy Principle (FEP) for both evolution and psychoanalysis is best understood. Within this perspective, the FEP occupies a particular level of the hierarchical organization of the organism, which is the level of biological self-organization. This form of biological self-organization is in turn understood as foundational and pervasive to the higher levels of organization of the human organism that are of interest to both neuroscience as well as psychoanalysis. Consequently, central psychoanalytic claims should be restated, in order to be located in their proper place within a hierarchical recursive organization of the (situated) organism. In light of the FEP the realization of the psychoanalytic mind by the brain should be seen in terms of the evolution of different levels of systematic organization where the concepts of psychoanalysis describe a level of hierarchical recursive organization superordinate to that of biological self-organization and the FEP. The implication of this formulation is that while "psychoanalytic" mental processes are fundamentally subject to the FEP, they nonetheless also add their own principles of process over and above that of the FEP. A model found in Grobbelaar (1989) offers a recursive bottom-up description of the self-organization of the psychoanalytic ego as dependent on the organization of language (and affect), which is itself founded upon the tendency toward autopoiesis (self-making) within the organism, which is in turn described as formally similar to the FEP. Meaningful consilience between Grobbelaar's model and the hierarchical recursive description available in Friston's (2010a) theory is described. The paper concludes that the valuable contribution of the FEP to psychoanalysis underscores the

  8. Hierarchical Recursive Organization and the Free Energy Principle: From Biological Self-Organization to the Psychoanalytic Mind

    Science.gov (United States)

    Connolly, Patrick; van Deventer, Vasi

    2017-01-01

    The present paper argues that a systems theory epistemology (and particularly the notion of hierarchical recursive organization) provides the critical theoretical context within which the significance of Friston's (2010a) Free Energy Principle (FEP) for both evolution and psychoanalysis is best understood. Within this perspective, the FEP occupies a particular level of the hierarchical organization of the organism, which is the level of biological self-organization. This form of biological self-organization is in turn understood as foundational and pervasive to the higher levels of organization of the human organism that are of interest to both neuroscience as well as psychoanalysis. Consequently, central psychoanalytic claims should be restated, in order to be located in their proper place within a hierarchical recursive organization of the (situated) organism. In light of the FEP the realization of the psychoanalytic mind by the brain should be seen in terms of the evolution of different levels of systematic organization where the concepts of psychoanalysis describe a level of hierarchical recursive organization superordinate to that of biological self-organization and the FEP. The implication of this formulation is that while “psychoanalytic” mental processes are fundamentally subject to the FEP, they nonetheless also add their own principles of process over and above that of the FEP. A model found in Grobbelaar (1989) offers a recursive bottom-up description of the self-organization of the psychoanalytic ego as dependent on the organization of language (and affect), which is itself founded upon the tendency toward autopoiesis (self-making) within the organism, which is in turn described as formally similar to the FEP. Meaningful consilience between Grobbelaar's model and the hierarchical recursive description available in Friston's (2010a) theory is described. The paper concludes that the valuable contribution of the FEP to psychoanalysis underscores the

  9. Implementation of genomic recursions in single-step genomic best linear unbiased predictor for US Holsteins with a large number of genotyped animals.

    Science.gov (United States)

    Masuda, Y; Misztal, I; Tsuruta, S; Legarra, A; Aguilar, I; Lourenco, D A L; Fragomeni, B O; Lawlor, T J

    2016-03-01

    The objectives of this study were to develop and evaluate an efficient implementation in the computation of the inverse of genomic relationship matrix with the recursion algorithm, called the algorithm for proven and young (APY), in single-step genomic BLUP. We validated genomic predictions for young bulls with more than 500,000 genotyped animals in final score for US Holsteins. Phenotypic data included 11,626,576 final scores on 7,093,380 US Holstein cows, and genotypes were available for 569,404 animals. Daughter deviations for young bulls with no classified daughters in 2009, but at least 30 classified daughters in 2014 were computed using all the phenotypic data. Genomic predictions for the same bulls were calculated with single-step genomic BLUP using phenotypes up to 2009. We calculated the inverse of the genomic relationship matrix GAPY(-1) based on a direct inversion of genomic relationship matrix on a small subset of genotyped animals (core animals) and extended that information to noncore animals by recursion. We tested several sets of core animals including 9,406 bulls with at least 1 classified daughter, 9,406 bulls and 1,052 classified dams of bulls, 9,406 bulls and 7,422 classified cows, and random samples of 5,000 to 30,000 animals. Validation reliability was assessed by the coefficient of determination from regression of daughter deviation on genomic predictions for the predicted young bulls. The reliabilities were 0.39 with 5,000 randomly chosen core animals, 0.45 with the 9,406 bulls, and 7,422 cows as core animals, and 0.44 with the remaining sets. With phenotypes truncated in 2009 and the preconditioned conjugate gradient to solve mixed model equations, the number of rounds to convergence for core animals defined by bulls was 1,343; defined by bulls and cows, 2,066; and defined by 10,000 random animals, at most 1,629. With complete phenotype data, the number of rounds decreased to 858, 1,299, and at most 1,092, respectively. Setting up GAPY(-1

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

  11. Compositional generative mapping for tree-structured data--part I: bottom-up probabilistic modeling of trees.

    Science.gov (United States)

    Bacciu, Davide; Micheli, Alessio; Sperduti, Alessandro

    2012-12-01

    We introduce a novel compositional (recursive) probabilistic model for trees that defines an approximated bottom-up generative process from the leaves to the root of a tree. The proposed model defines contextual state transitions from the joint configuration of the children to the parent nodes. We argue that the bottom-up context postulates different probabilistic assumptions with respect to a top-down approach, leading to different representational capabilities. We discuss classes of applications that are best suited to a bottom-up approach. In particular, the bottom-up context is shown to better correlate and model the co-occurrence of substructures among the child subtrees of internal nodes. A mixed memory approximation is introduced to factorize the joint children-to-parent state transition matrix as a mixture of pairwise transitions. The proposed approach is the first practical bottom-up generative model for tree-structured data that maintains the same computational class of its top-down counterpart. Comparative experimental analyses exploiting synthetic and real-world datasets show that the proposed model can deal with deep structures better than a top-down generative model. The model is also shown to better capture structural information from real-world data comprising trees with a large out-degree. The proposed bottom-up model can be used as a fundamental building block for the development of other new powerful models.

  12. Covering tree with stars

    DEFF Research Database (Denmark)

    Baumbach, Jan; Guo, Jian-Ying; Ibragimov, Rashid

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

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

  14. Nearest neighbor search in general metric spaces using a tree data structure with a simple heuristic.

    Science.gov (United States)

    Xu, Huafeng; Agrafiotis, Dimitris K

    2003-01-01

    We present a new algorithm for nearest neighbor search in general metric spaces. The algorithm organizes the database into recursively partitioned Voronoi regions and represents these partitions in a tree. The separations between the Voronoi regions as well as the radius of each region are used with triangular inequality to derive the minimum possible distance between any point in a region and the query and to discard the region from further search if a smaller distance has already been found. The algorithm also orders the search sequence of the tree branches using the estimate of the minimum possible distance. This simple heuristic proves to considerably enhance the pruning of the search tree. The efficiency of the algorithm is demonstrated on several artificial data sets and real problems in computational chemistry.

  15. To Tree or Not to Tree

    NARCIS (Netherlands)

    Holmgren, Milena; Scheffer, Marten

    2017-01-01

    Few things are more defining in a landscape compared to the absence or presence of trees, both in aesthetic and in functional terms. At the same time, tree cover has been profoundly affected by humans since ancient times. It is therefore not surprising that opinions about deforestation and

  16. New Modified Adomian Decomposition Recursion Schemes for Solving Certain Types of Nonlinear Fractional Two-Point Boundary Value Problems

    Directory of Open Access Journals (Sweden)

    Sekson Sirisubtawee

    2017-01-01

    Full Text Available We apply new modified recursion schemes obtained by the Adomian decomposition method (ADM to analytically solve specific types of two-point boundary value problems for nonlinear fractional order ordinary and partial differential equations. The new modified recursion schemes, which sometimes utilize the technique of Duan’s convergence parameter, are derived using the Duan-Rach modified ADM. The Duan-Rach modified ADM employs all of the given boundary conditions to compute the remaining unknown constants of integration, which are then embedded in the integral solution form before constructing recursion schemes for the solution components. New modified recursion schemes obtained by the method are generated in order to analytically solve nonlinear fractional order boundary value problems with a variety of two-point boundary conditions such as Robin and separated boundary conditions. Some numerical examples of such problems are demonstrated graphically. In addition, the maximal errors (MEn or the error remainder functions (ERn(x of each problem are calculated.

  17. New Recursive Representations for the Favard Constants with Application to Multiple Singular Integrals and Summation of Series

    Directory of Open Access Journals (Sweden)

    Snezhana Georgieva Gocheva-Ilieva

    2013-01-01

    Full Text Available There are obtained integral form and recurrence representations for some Fourier series and connected with them Favard constants. The method is based on preliminary integration of Fourier series which permits to establish general recursion formulas for Favard constants. This gives the opportunity for effective summation of infinite series and calculation of some classes of multiple singular integrals by the Favard constants.

  18. Diverse Pathways to Positive and Negative Affect in Adulthood and Later Life: An Integrative Approach Using Recursive Partitioning

    Science.gov (United States)

    Gruenewald, Tara L.; Mroczek, Daniel K.; Ryff, Carol D.; Singer, Burton H.

    2008-01-01

    Recursive partitioning is an analytic technique that is useful for identifying complex combinations of conditions that predict particular outcomes as well as for delineating multiple subgroup differences in how such factors work together. As such, the methodology is well suited to multidisciplinary, life course inquiry in which the goal is to…

  19. Recursive thoughts on the simulation of the flexible multibody dynamics of slender offshore structures

    Science.gov (United States)

    Schilder, J.; Ellenbroek, M.; de Boer, A.

    2017-12-01

    In this work, the floating frame of reference formulation is used to create a flexible multibody model of slender offshore structures such as pipelines and risers. It is shown that due to the chain-like topology of the considered structures, the equation of motion can be expressed in terms of absolute interface coordinates. In the presented form, kinematic constraint equations are satisfied explicitly and the Lagrange multipliers are eliminated from the equations. Hence, the structures can be conveniently coupled to finite element or multibody models of for example seabed and vessel. The chain-like topology enables the efficient use of recursive solution procedures for both transient dynamic analysis and equilibrium analysis. For this, the transfer matrix method is used. In order to improve the convergence of the equilibrium analysis, the analytical solution of an ideal catenary is used as an initial configuration, reducing the number of required iterations.

  20. A Family of Meta-Fibonacci Sequences Defined by Variable-Order Recursions

    Science.gov (United States)

    Emerson, Nathaniel D.

    2006-04-01

    We define a family of meta-Fibonacci sequences. For each sequence in the family, the order of the of the defining recursion at the nth stage is a variable r(n), and the nth term is the sum of the previous r(n) terms. Given a sequence of real numbers that satisfies some conditions on growth, there is a meta-Fibonacci sequence in the family that grows at the same rate as the given sequence. In particular, the growth rate of these sequences can be exponential, polynomial, or logarithmic. However, the possible asymptotic limits of such a sequence are restricted to a class of exponential functions. We give upper and lower bounds for the terms of any such sequence, which depend only on r(n). The Narayana-Zidek-Capell sequence is a member of this family. We show that it converges asymptotically.

  1. Comprehensive proton dose algorithm using pencil beam redefinition and recursive dynamic splitting

    CERN Document Server

    Gottschalk, Bernard

    2016-01-01

    We compute, from first principles, the absolute dose or fluence distribution per incident proton charge in a known heterogeneous terrain exposed to known proton beams. The algorithm is equally amenable to scattered or scanned beams. All objects in the terrain (including collimators) are sliced into slabs, of any convenient thickness, perpendicular to the nominal beam direction. Transport is by standard Fermi-Eyges theory. Transverse heterogeneities are handled by breaking up pencil beams (PBs) either by conventional redefinition or a new form of 2D recursive dynamic splitting: the mother PB is replaced, conserving emittance and charge, by seven daughters of equal transverse size. One has 1/4 the charge and travels in the mother's direction and six have 1/8 the charge, are arranged hexagonally and radiate from the mother's virtual point source. The longitudinal (energy-like) variable is pv (proton momentum times speed). Each material encountered is treated on its own merits, not referenced to water. Slowing do...

  2. Social cognition in ADHD: irony understanding and recursive theory of mind.

    Science.gov (United States)

    Caillies, Stéphanie; Bertot, Vincine; Motte, Jacques; Raynaud, Christine; Abely, Michel

    2014-11-01

    The main goal of the present study was to characterise the social cognition abilities of French children with ADHD, in terms of their understanding of people's recursive mental states and their irony comprehension. We hypothesised that these children have difficulty understanding second-order false beliefs and ironic remarks, owing to the executive dysfunction that is characteristic of ADHD. We therefore conducted an experiment in which children with ADHD and typically developing matched controls performed second-order false-belief and executive function tasks. They then listened to ironic stories and answered questions about the ironic comments and about the speakers' beliefs and attitudes. The groups differed significantly on second-order theory of mind, irony comprehension and executive functions, confirming that children with ADHD have impaired social cognition. Copyright © 2014 Elsevier Ltd. All rights reserved.

  3. Estimation of the blood velocity spectrum using a recursive lattice filter

    DEFF Research Database (Denmark)

    Jensen, Jørgen Arendt; Buelund, Claus; Jørgensen, Allan

    1996-01-01

    In medical ultrasound the blood velocity distribution in a vessel can be found by emitting a pulsed field into the patient. The field is then scattered by the tissues and the red blood cells, and a single complex sample set is acquired at the depth of interest for each pulse emitted. The signals...... acquired for showing the blood velocity distribution are inherently non-stationary, due to the pulsatility of the flow. All current signal processing schemes assume that the signal is stationary within the window of analysis, although this is an approximation. In this paper a recursive least...... based on the measured time evolution of the spatial mean velocity in the femoral artery. The smooth theoretical velocity distribution is then known and can be compared to the estimated distribution. Using 8 parameters a very smooth estimate of the velocity distribution is seen, more in line...

  4. Topological recursion for chord diagrams, RNA complexes, and cells in moduli spaces

    DEFF Research Database (Denmark)

    Andersen, Jørgen Ellegaard; Chekhov, Leonid O.; Penner, Robert

    2013-01-01

    and free energies are convergent for small t and all s as a perturbation of the Gaussian potential, which arises for st=0. This perturbation is computed using the formalism of the topological recursion. The corresponding enumeration of chord diagrams gives at once the number of RNA complexes of a given...... topology as well as the number of cells in Riemann's moduli spaces for bordered surfaces. The free energies are computed here in principle for all genera and explicitly for genera less than four.......We introduce and study the Hermitian matrix model with potential V(x)=x^2/2-stx/(1-tx), which enumerates the number of linear chord diagrams of fixed genus with specified numbers of backbones generated by s and chords generated by t. For the one-cut solution, the partition function, correlators...

  5. A recursive algorithm for computing the inverse of the Vandermonde matrix

    Directory of Open Access Journals (Sweden)

    Youness Aliyari Ghassabeh

    2016-12-01

    Full Text Available The inverse of a Vandermonde matrix has been used for signal processing, polynomial interpolation, curve fitting, wireless communication, and system identification. In this paper, we propose a novel fast recursive algorithm to compute the inverse of a Vandermonde matrix. The algorithm computes the inverse of a higher order Vandermonde matrix using the available lower order inverse matrix with a computational cost of $ O(n^2 $. The proposed algorithm is given in a matrix form, which makes it appropriate for hardware implementation. The running time of the proposed algorithm to find the inverse of a Vandermonde matrix using a lower order Vandermonde matrix is compared with the running time of the matrix inversion function implemented in MATLAB.

  6. Efficient Implementation of the Riccati Recursion for Solving Linear-Quadratic Control Problems

    DEFF Research Database (Denmark)

    Frison, Gianluca; Jørgensen, John Bagterp

    2013-01-01

    In both Active-Set (AS) and Interior-Point (IP) algorithms for Model Predictive Control (MPC), sub-problems in the form of linear-quadratic (LQ) control problems need to be solved at each iteration. The solution of these sub-problems is typically the main computational effort at each iteration....... In this paper, we compare a number of solvers for an extended formulation of the LQ control problem: a Riccati recursion based solver can be considered the best choice for the general problem with dense matrices. Furthermore, we present a novel version of the Riccati solver, that makes use of the Cholesky...... factorization of the Pn matrices to reduce the number of flops. When combined with regularization and mixed precision, this algorithm can solve large instances of the LQ control problem up to 3 times faster than the classical Riccati solver....

  7. TouchGrid: Touchpad pointing by recursively mapping taps to smaller display regions

    DEFF Research Database (Denmark)

    Hertzum, Morten; Hornbæk, Kasper

    2005-01-01

    Touchpad devices are widely used but lacking in pointing efficiency. The TouchGrid, an instance of what we term cell cursors, replaces moving the cursor through dragging the finger on a touchpad with tapping in different regions of the touchpad. The touchpad regions are recursively mapped...... to smaller display regions and thereby enable high-precision pointing without requiring high tapping precision. In an experiment, six subjects used the TouchGrid and a standard touchpad across different numbers of targets, distances to targets, and target widths. Whereas standard touchpad operation follows...... Fitts’ law, target selection time with the TouchGrid is a linear function of the required number of taps. The TouchGrid was significantly faster for small targets and for tasks requiring one tap, and marginally faster for two-tap tasks. Error rates tended to be higher with the TouchGrid than...

  8. The PLSI Method of Stabilizing Two-Dimensional Nonsymmetric Half-Plane Recursive Digital Filters

    Directory of Open Access Journals (Sweden)

    Gangatharan N

    2003-01-01

    Full Text Available Two-dimensional (2D recursive digital filters find applications in image processing as in medical X-ray processing. Nonsymmetric half-plane (NSHP filters have definitely positive magnitude characteristics as opposed to quarter-plane (QP filters. In this paper, we provide methods for stabilizing the given 2D NSHP polynomial by the planar least squares inverse (PLSI method. We have proved in this paper that if the given 2D unstable NSHP polynomial and its PLSI are of the same degree, the PLSI polynomial is always stable, irrespective of whether the coefficients of the given polynomial have relationship among its coefficients or not. Examples are given for 2D first-order and second-order cases to prove our results. The generalization is done for the th order polynomial.

  9. Two dimensional recursive digital filters for near real time image processing

    Science.gov (United States)

    Olson, D.; Sherrod, E.

    1980-01-01

    A program was designed toward the demonstration of the feasibility of using two dimensional recursive digital filters for subjective image processing applications that require rapid turn around. The concept of the use of a dedicated minicomputer for the processor for this application was demonstrated. The minicomputer used was the HP1000 series E with a RTE 2 disc operating system and 32K words of memory. A Grinnel 256 x 512 x 8 bit display system was used to display the images. Sample images were provided by NASA Goddard on a 800 BPI, 9 track tape. Four 512 x 512 images representing 4 spectral regions of the same scene were provided. These images were filtered with enhancement filters developed during this effort.

  10. Recursive anisotropic 2-D Gaussian filtering based on a triple-axis decomposition.

    Science.gov (United States)

    Lam, Stanley Yiu Man; Shi, Bertram E

    2007-07-01

    We describe a recursive algorithm for anisotropic 2-D Gaussian filtering, based on separating the filter into the cascade of three, rather two, 1-D filters. The filters operate along axes obtained by integer horizontal and/or vertical pixel shifts. This eliminates interpolation, which removes spatial inhomogeneity in the filter, and produces more elliptically shaped kernels. It also results in a more regular filter structure, which facilitates implementation in DSP chips. Finally, it improves matching between filters with the same eccentricity and width, but different orientations. Our analysis and experiments indicate that the computational complexity is similar to an algorithm that operates along two axes (filter axes, there is an orientation dependent lower bound on the achievable aspect ratios.

  11. On 2-D recursive LMS algorithms using ARMA prediction for ADPCM encoding of images.

    Science.gov (United States)

    Chung, Y S; Kanefsky, M

    1992-01-01

    A two-dimensional (2D) linear predictor which has an autoregressive moving average (ARMA) representation well as a bias term is adapted for adaptive differential pulse code modulation (ADPCM) encoding of nonnegative images. The predictor coefficients are updated by using a 2D recursive LMS (TRLMS) algorithm. A constraint on optimum values for the convergence factors and an updating algorithm based on the constraint are developed. The coefficient updating algorithm can be modified with a stability control factor. This realization can operate in real time and in the spatial domain. A comparison of three different types of predictors is made for real images. ARMA predictors show improved performance relative to an AR algorithm.

  12. Application of Recursive Least Square Algorithm on Estimation of Vehicle Sideslip Angle and Road Friction

    Directory of Open Access Journals (Sweden)

    Nenggen Ding

    2010-01-01

    Full Text Available A recursive least square (RLS algorithm for estimation of vehicle sideslip angle and road friction coefficient is proposed. The algorithm uses the information from sensors onboard vehicle and control inputs from the control logic and is intended to provide the essential information for active safety systems such as active steering, direct yaw moment control, or their combination. Based on a simple two-degree-of-freedom (DOF vehicle model, the algorithm minimizes the squared errors between estimated lateral acceleration and yaw acceleration of the vehicle and their measured values. The algorithm also utilizes available control inputs such as active steering angle and wheel brake torques. The proposed algorithm is evaluated using an 8-DOF full vehicle simulation model including all essential nonlinearities and an integrated active front steering and direct yaw moment control on dry and slippery roads.

  13. Probabilistic forecasting of the solar irradiance with recursive ARMA and GARCH models

    DEFF Research Database (Denmark)

    David, M.; Ramahatana, F.; Trombe, Pierre-Julien

    2016-01-01

    Forecasting of the solar irradiance is a key feature in order to increase the penetration rate of solar energy into the energy grids. Indeed, the anticipation of the fluctuations of the solar renewables allows a better management of the production means of electricity and a better operation...... of the grid-connected storage systems. If numerous methods for forecasting the mean of the solar irradiance were recently developed, there are only few works dedicated to the evaluation of prediction intervals associated to these point forecasts. Time series of solar irradiance and more specifically of clear...... sky index show some similarities with that of financial time series. The aim of this paper is to assess the performances of a commonly used combination of two linear models (ARMA and GARCH) in econometrics in order to provide probabilistic forecasts of solar irradiance. In addition, a recursive...

  14. Robust Recursive Algorithm under Uncertainties via Worst-Case SINR Maximization

    Directory of Open Access Journals (Sweden)

    Xin Song

    2015-01-01

    Full Text Available The performance of traditional constrained-LMS (CLMS algorithm is known to degrade seriously in the presence of small training data size and mismatches between the assumed array response and the true array response. In this paper, we develop a robust constrained-LMS (RCLMS algorithm based on worst-case SINR maximization. Our algorithm belongs to the class of diagonal loading techniques, in which the diagonal loading factor is obtained in a simple form and it decreases the computation cost. The updated weight vector is derived by the descent gradient method and Lagrange multiplier method. It demonstrates that our proposed recursive algorithm provides excellent robustness against signal steering vector mismatches and the small training data size and, has fast convergence rate, and makes the mean output array signal-to-interference-plus-noise ratio (SINR consistently close to the optimal one. Some simulation results are presented to compare the performance of our robust algorithm with the traditional CLMS algorithm.

  15. Human motion planning based on recursive dynamics and optimal control techniques

    Science.gov (United States)

    Lo, Janzen; Huang, Gang; Metaxas, Dimitris

    2002-01-01

    This paper presents an efficient optimal control and recursive dynamics-based computer animation system for simulating and controlling the motion of articulated figures. A quasi-Newton nonlinear programming technique (super-linear convergence) is implemented to solve minimum torque-based human motion-planning problems. The explicit analytical gradients needed in the dynamics are derived using a matrix exponential formulation and Lie algebra. Cubic spline functions are used to make the search space for an optimal solution finite. Based on our formulations, our method is well conditioned and robust, in addition to being computationally efficient. To better illustrate the efficiency of our method, we present results of natural looking and physically correct human motions for a variety of human motion tasks involving open and closed loop kinematic chains.

  16. Recursion method for the quasiparticle structure of a single vortex with induced magnetic order

    DEFF Research Database (Denmark)

    Udby, L.; Andersen, B.M.; Hedegård, P.

    2006-01-01

    . Furthermore, we study the low-energy quasiparticle structure when magnetic vortices operate as pinning centers for surrounding unidirectional spin density waves (stripes). We calculate the Fourier transformed LDOS and show how the energy dependence of relevant Fourier components can be used to determine...... the nature of the magnetic field-induced order, and predict field-induced LDOS features that can be tested by future scanning tunneling microscopy experiments.......We use a real-space recursion method to calculate the local density of states (LDOS) within a model that contains both d-wave superconducting and antiferromagnetic order. We focus on the LDOS in the superconducting phase near single vortices with either normal or antiferromagnetic cores...

  17. Recursive N-way partial least squares for brain-computer interface.

    Directory of Open Access Journals (Sweden)

    Andrey Eliseyev

    Full Text Available In the article tensor-input/tensor-output blockwise Recursive N-way Partial Least Squares (RNPLS regression is considered. It combines the multi-way tensors decomposition with a consecutive calculation scheme and allows blockwise treatment of tensor data arrays with huge dimensions, as well as the adaptive modeling of time-dependent processes with tensor variables. In the article the numerical study of the algorithm is undertaken. The RNPLS algorithm demonstrates fast and stable convergence of regression coefficients. Applied to Brain Computer Interface system calibration, the algorithm provides an efficient adjustment of the decoding model. Combining the online adaptation with easy interpretation of results, the method can be effectively applied in a variety of multi-modal neural activity flow modeling tasks.

  18. The Reliability of Classification of Terminal Nodes in GUIDE Decision Tree to Predict the Nonalcoholic Fatty Liver Disease

    Directory of Open Access Journals (Sweden)

    Mehdi Birjandi

    2016-01-01

    Full Text Available Tree structured modeling is a data mining technique used to recursively partition a dataset into relatively homogeneous subgroups in order to make more accurate predictions on generated classes. One of the classification tree induction algorithms, GUIDE, is a nonparametric method with suitable accuracy and low bias selection, which is used for predicting binary classes based on many predictors. In this tree, evaluating the accuracy of predicted classes (terminal nodes is clinically of special importance. For this purpose, we used GUIDE classification tree in two statuses of equal and unequal misclassification cost in order to predict nonalcoholic fatty liver disease (NAFLD, considering 30 predictors. Then, to evaluate the accuracy of predicted classes by using bootstrap method, first the classification reliability in which individuals are assigned to a unique class and next the prediction probability reliability as support for that are considered.

  19. Parameter Identification of Ship Maneuvering Models Using Recursive Least Square Method Based on Support Vector Machines

    Directory of Open Access Journals (Sweden)

    Man Zhu

    2017-03-01

    Full Text Available Determination of ship maneuvering models is a tough task of ship maneuverability prediction. Among several prime approaches of estimating ship maneuvering models, system identification combined with the full-scale or free- running model test is preferred. In this contribution, real-time system identification programs using recursive identification method, such as the recursive least square method (RLS, are exerted for on-line identification of ship maneuvering models. However, this method seriously depends on the objects of study and initial values of identified parameters. To overcome this, an intelligent technology, i.e., support vector machines (SVM, is firstly used to estimate initial values of the identified parameters with finite samples. As real measured motion data of the Mariner class ship always involve noise from sensors and external disturbances, the zigzag simulation test data include a substantial quantity of Gaussian white noise. Wavelet method and empirical mode decomposition (EMD are used to filter the data corrupted by noise, respectively. The choice of the sample number for SVM to decide initial values of identified parameters is extensively discussed and analyzed. With de-noised motion data as input-output training samples, parameters of ship maneuvering models are estimated using RLS and SVM-RLS, respectively. The comparison between identification results and true values of parameters demonstrates that both the identified ship maneuvering models from RLS and SVM-RLS have reasonable agreements with simulated motions of the ship, and the increment of the sample for SVM positively affects the identification results. Furthermore, SVM-RLS using data de-noised by EMD shows the highest accuracy and best convergence.

  20. Perceived Organizational Support for Enhancing Welfare at Work: A Regression Tree Model

    Science.gov (United States)

    Giorgi, Gabriele; Dubin, David; Perez, Javier Fiz

    2016-01-01

    When trying to examine outcomes such as welfare and well-being, research tends to focus on main effects and take into account limited numbers of variables at a time. There are a number of techniques that may help address this problem. For example, many statistical packages available in R provide easy-to-use methods of modeling complicated analysis such as classification and tree regression (i.e., recursive partitioning). The present research illustrates the value of recursive partitioning in the prediction of perceived organizational support in a sample of more than 6000 Italian bankers. Utilizing the tree function party package in R, we estimated a regression tree model predicting perceived organizational support from a multitude of job characteristics including job demand, lack of job control, lack of supervisor support, training, etc. The resulting model appears particularly helpful in pointing out several interactions in the prediction of perceived organizational support. In particular, training is the dominant factor. Another dimension that seems to influence organizational support is reporting (perceived communication about safety and stress concerns). Results are discussed from a theoretical and methodological point of view. PMID:28082924

  1. Perceived Organizational Support for Enhancing Welfare at Work: A Regression Tree Model.

    Science.gov (United States)

    Giorgi, Gabriele; Dubin, David; Perez, Javier Fiz

    2016-01-01

    When trying to examine outcomes such as welfare and well-being, research tends to focus on main effects and take into account limited numbers of variables at a time. There are a number of techniques that may help address this problem. For example, many statistical packages available in R provide easy-to-use methods of modeling complicated analysis such as classification and tree regression (i.e., recursive partitioning). The present research illustrates the value of recursive partitioning in the prediction of perceived organizational support in a sample of more than 6000 Italian bankers. Utilizing the tree function party package in R, we estimated a regression tree model predicting perceived organizational support from a multitude of job characteristics including job demand, lack of job control, lack of supervisor support, training, etc. The resulting model appears particularly helpful in pointing out several interactions in the prediction of perceived organizational support. In particular, training is the dominant factor. Another dimension that seems to influence organizational support is reporting (perceived communication about safety and stress concerns). Results are discussed from a theoretical and methodological point of view.

  2. Spanning Tree Problem

    Directory of Open Access Journals (Sweden)

    Yen Hung Chen

    2012-01-01

    minimum cost spanning tree T in G such that the total weight in T is at most a given bound B. In this paper, we present two polynomial time approximation schemes (PTASs for the constrained minimum spanning tree problem.

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

  4. Coded Splitting Tree Protocols

    DEFF Research Database (Denmark)

    Sørensen, Jesper Hemming; Stefanovic, Cedomir; Popovski, Petar

    2013-01-01

    This paper presents a novel approach to multiple access control called coded splitting tree protocol. The approach builds on the known tree splitting protocols, code structure and successive interference cancellation (SIC). Several instances of the tree splitting protocol are initiated, each...... as possible. Evaluations show that the proposed protocol provides considerable gains over the standard tree splitting protocol applying SIC. The improvement comes at the expense of an increased feedback and receiver complexity....

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

  6. Fibrations of Tree Automata

    OpenAIRE

    Riba, Colin

    2015-01-01

    International audience; We propose a notion of morphisms between tree automata based on game semantics. Morphisms are winning strategies on a synchronous restriction of the linear implication between acceptance games. This leads to split indexed categories, with substitution based on a suitable notion of synchronous tree function. By restricting to tree functions issued from maps on alphabets, this gives a fibration of tree automata. We then discuss the (fibrewise) monoidal structure issued f...

  7. Latent tree models

    OpenAIRE

    Zwiernik, Piotr

    2017-01-01

    Latent tree models are graphical models defined on trees, in which only a subset of variables is observed. They were first discussed by Judea Pearl as tree-decomposable distributions to generalise star-decomposable distributions such as the latent class model. Latent tree models, or their submodels, are widely used in: phylogenetic analysis, network tomography, computer vision, causal modeling, and data clustering. They also contain other well-known classes of models like hidden Markov models...

  8. Macro tree transducers

    NARCIS (Netherlands)

    Engelfriet, Joost; Vogler, Heiko

    1985-01-01

    Macro tree transducers are a combination of top-down tree transducers and macro grammars. They serve as a model for syntax-directed semantics in which context information can be handled. In this paper the formal model of macro tree transducers is studied by investigating typical automata theoretical

  9. Total well dominated trees

    DEFF Research Database (Denmark)

    Finbow, Arthur; Frendrup, Allan; Vestergaard, Preben D.

    cardinality then G is a total well dominated graph. In this paper we study composition and decomposition of total well dominated trees. By a reversible process we prove that any total well dominated tree can both be reduced to and constructed from a family of three small trees....

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

  11. Flowering T Flowering Trees

    Indian Academy of Sciences (India)

    Flowering T. Flowering Trees. Adansonia digitata L. ( The Baobab Tree) of Bombacaceae is a tree with swollen trunk that attains a dia. of 10m. Leaves are digitately compound with leaflets up to 18cm. long. Flowers are large, solitary, waxy white, and open at dusk. They open in 30 seconds and are bat pollinated. Stamens ...

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

  13. 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...... the FB-tree: a combination of an adapted B+-tree, a storage manager, and a buffer manager, all optimized for modern SSDs. Together the techniques enable writing to SSDs in relatively large blocks, thus achieving greater overall throughput. This is achieved by the out-of-place writing, whereby every time....... 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....

  14. Distributed Contour Trees

    Energy Technology Data Exchange (ETDEWEB)

    Morozov, Dmitriy; Weber, Gunther H.

    2014-03-31

    Topological techniques provide robust tools for data analysis. They are used, for example, for feature extraction, for data de-noising, and for comparison of data sets. This chapter concerns contour trees, a topological descriptor that records the connectivity of the isosurfaces of scalar functions. These trees are fundamental to analysis and visualization of physical phenomena modeled by real-valued measurements. We study the parallel analysis of contour trees. After describing a particular representation of a contour tree, called local{global representation, we illustrate how di erent problems that rely on contour trees can be solved in parallel with minimal communication.

  15. Skew-orthogonal polynomials and random matrix theory

    CERN Document Server

    Ghosh, Saugata

    2009-01-01

    Orthogonal polynomials satisfy a three-term recursion relation irrespective of the weight function with respect to which they are defined. This gives a simple formula for the kernel function, known in the literature as the Christoffel-Darboux sum. The availability of asymptotic results of orthogonal polynomials and the simple structure of the Christoffel-Darboux sum make the study of unitary ensembles of random matrices relatively straightforward. In this book, the author develops the theory of skew-orthogonal polynomials and obtains recursion relations which, unlike orthogonal polynomials, depend on weight functions. After deriving reduced expressions, called the generalized Christoffel-Darboux formulas (GCD), he obtains universal correlation functions and non-universal level densities for a wide class of random matrix ensembles using the GCD. The author also shows that once questions about higher order effects are considered (questions that are relevant in different branches of physics and mathematics) the ...

  16. A Survey of Wood Protection Chemicals, Tree Killers and Sprayers ...

    African Journals Online (AJOL)

    chemicals used in wood protection (preservation) within Makurdi metropolis. A purposive, non-random sampling was undertaken in Makurdi metropolis to identify wood protection chemicals/tree-killers available in agrochemical stores, ...

  17. New Gromov-Inspired Metrics on Phylogenetic Tree Space.

    Science.gov (United States)

    Liebscher, Volkmar

    2018-03-01

    We present a new class of metrics for unrooted phylogenetic X-trees inspired by the Gromov-Hausdorff distance for (compact) metric spaces. These metrics can be efficiently computed by linear or quadratic programming. They are robust under NNI operations, too. The local behaviour of the metrics shows that they are different from any previously introduced metrics. The performance of the metrics is briefly analysed on random weighted and unweighted trees as well as random caterpillars.

  18. Hierarchical Recursive Organization and the Free Energy Principle: From Biological Self-Organization to the Psychoanalytic Mind

    Directory of Open Access Journals (Sweden)

    Patrick Connolly

    2017-09-01

    Full Text Available The present paper argues that a systems theory epistemology (and particularly the notion of hierarchical recursive organization provides the critical theoretical context within which the significance of Friston's (2010a Free Energy Principle (FEP for both evolution and psychoanalysis is best understood. Within this perspective, the FEP occupies a particular level of the hierarchical organization of the organism, which is the level of biological self-organization. This form of biological self-organization is in turn understood as foundational and pervasive to the higher levels of organization of the human organism that are of interest to both neuroscience as well as psychoanalysis. Consequently, central psychoanalytic claims should be restated, in order to be located in their proper place within a hierarchical recursive organization of the (situated organism. In light of the FEP the realization of the psychoanalytic mind by the brain should be seen in terms of the evolution of different levels of systematic organization where the concepts of psychoanalysis describe a level of hierarchical recursive organization superordinate to that of biological self-organization and the FEP. The implication of this formulation is that while “psychoanalytic” mental processes are fundamentally subject to the FEP, they nonetheless also add their own principles of process over and above that of the FEP. A model found in Grobbelaar (1989 offers a recursive bottom-up description of the self-organization of the psychoanalytic ego as dependent on the organization of language (and affect, which is itself founded upon the tendency toward autopoiesis (self-making within the organism, which is in turn described as formally similar to the FEP. Meaningful consilience between Grobbelaar's model and the hierarchical recursive description available in Friston's (2010a theory is described. The paper concludes that the valuable contribution of the FEP to psychoanalysis

  19. Aneurysmal subarachnoid hemorrhage prognostic decision-making algorithm using classification and regression tree analysis.

    Science.gov (United States)

    Lo, Benjamin W Y; Fukuda, Hitoshi; Angle, Mark; Teitelbaum, Jeanne; Macdonald, R Loch; Farrokhyar, Forough; Thabane, Lehana; Levine, Mitchell A H

    2016-01-01

    Classification and regression tree analysis involves the creation of a decision tree by recursive partitioning of a dataset into more homogeneous subgroups. Thus far, there is scarce literature on using this technique to create clinical prediction tools for aneurysmal subarachnoid hemorrhage (SAH). The classification and regression tree analysis technique was applied to the multicenter Tirilazad database (3551 patients) in order to create the decision-making algorithm. In order to elucidate prognostic subgroups in aneurysmal SAH, neurologic, systemic, and demographic factors were taken into account. The dependent variable used for analysis was the dichotomized Glasgow Outcome Score at 3 months. Classification and regression tree analysis revealed seven prognostic subgroups. Neurological grade, occurrence of post-admission stroke, occurrence of post-admission fever, and age represented the explanatory nodes of this decision tree. Split sample validation revealed classification accuracy of 79% for the training dataset and 77% for the testing dataset. In addition, the occurrence of fever at 1-week post-aneurysmal SAH is associated with increased odds of post-admission stroke (odds ratio: 1.83, 95% confidence interval: 1.56-2.45, P tree was generated, which serves as a prediction tool to guide bedside prognostication and clinical treatment decision making. This prognostic decision-making algorithm also shed light on the complex interactions between a number of risk factors in determining outcome after aneurysmal SAH.

  20. An Empirical Study of Insertion and Deletion in Binary Search Trees.

    Science.gov (United States)

    1982-12-02

    AksriMw: The structure of bbnay trees naturally hed to ame Insertion algorithm. To~ Iner a node Into a binay tree (known not to contain the node...Hbbard 621] proved that deleting a random node (i.e., where each node has an equal probability of being deleted) from a binay tree of sue ft, with dl