WorldWideScience

Sample records for random search trees

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

  2. Skewed Binary Search Trees

    DEFF Research Database (Denmark)

    Brodal, Gerth Stølting; Moruz, Gabriel

    2006-01-01

    It is well-known that to minimize the number of comparisons a binary search tree should be perfectly balanced. Previous work has shown that a dominating factor over the running time for a search is the number of cache faults performed, and that an appropriate memory layout of a binary search tree...... can reduce the number of cache faults by several hundred percent. Motivated by the fact that during a search branching to the left or right at a node does not necessarily have the same cost, e.g. because of branch prediction schemes, we in this paper study the class of skewed binary search trees....... For all nodes in a skewed binary search tree the ratio between the size of the left subtree and the size of the tree is a fixed constant (a ratio of 1/2 gives perfect balanced trees). In this paper we present an experimental study of various memory layouts of static skewed binary search trees, where each...

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

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

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

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

  7. Trends in game tree search

    NARCIS (Netherlands)

    A. de Bruin (Arie); W.H.L.M. Pijls (Wim)

    2003-01-01

    textabstractThis paper deals with algorithms searching trees generated by two-person, zero-sum games with perfect information. The standard algorithm in this field is alpha-beta. We will discuss this algorithm as well as extensions, like transposition tables, iterative deepening and NegaScout.

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

  10. An analysis of Monte Carlo tree search

    CSIR Research Space (South Africa)

    James, S

    2017-02-01

    Full Text Available Monte Carlo Tree Search (MCTS) is a family of directed search algorithms that has gained widespread attention in recent years. Despite the vast amount of research into MCTS, the effect of modifications on the algorithm, as well as the manner...

  11. Tree patterns with full text search

    NARCIS (Netherlands)

    Peetz, M.H.; Marx, M.

    2010-01-01

    Tree patterns with full text search form the core of both XQuery Full Text and the NEXI query language. On such queries, users expect a relevance-ranked list of XML elements as an answer. But this requirement may lead to undesirable behavior of XML retrieval systems: two queries which are

  12. Score Bounded Monte-Carlo Tree Search

    Science.gov (United States)

    Cazenave, Tristan; Saffidine, Abdallah

    Monte-Carlo Tree Search (MCTS) is a successful algorithm used in many state of the art game engines. We propose to improve a MCTS solver when a game has more than two outcomes. It is for example the case in games that can end in draw positions. In this case it improves significantly a MCTS solver to take into account bounds on the possible scores of a node in order to select the nodes to explore. We apply our algorithm to solving Seki in the game of Go and to Connect Four.

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

  14. Solution trees as a basis for game tree search

    NARCIS (Netherlands)

    A. de Bruin (Arie); W.H.L.M. Pijls (Wim); A. Plaat (Aske)

    1994-01-01

    textabstractA game tree algorithm is an algorithm computing the minimax value of the root of a game tree. Many algorithms use the notion of establishing proofs that this value lies above or below some boundary value. We show that this amounts to the construction of a solution tree. We discuss the

  15. Greedy Local Search and Vertex Cover in Sparse Random Graphs

    DEFF Research Database (Denmark)

    Witt, Carsten

    2009-01-01

    finds an optimal cover in polynomial time with a probability arbitrarily close to 1. This behavior relies on the absence of a giant component. As an additional insight into the randomized search, it is shown that the heuristic fails badly also on graphs consisting of a single tree component of maximum......Recently, various randomized search heuristics have been studied for the solution of the minimum vertex cover problem, in particular for sparse random instances according to the G(n, c/n) model, where c > 0 is a constant. Methods from statistical physics suggest that the problem is easy if c .... This work starts with a rigorous explanation for this claim based on the refined analysis of the Karp-Sipser algorithm by Aronson et al. Subsequently, theoretical supplements are given to experimental studies of search heuristics on random graphs. For c search heuristic...

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

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

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

  19. Search Trees with Relaxed Balance and Near-Optimal Height

    DEFF Research Database (Denmark)

    Fagerberg, Rolf; Larsen, Kim Skak; Jensen, Rune E.

    2001-01-01

    We introduce a relaxed k-tree, a search tree with relaxed balance and a height bound, when in balance, of (1+epsilon)log_2 n + 1, for any epsilon > 0. The number of nodes involved in rebalancing is O(1/epsilon) per update in the amortized sense, and O(log n/epsilon) in the worst case sense....... This is the first binary search tree with relaxed balance having a height bound better than c log_2 n for a fixed constant c. In all previous proposals, the constant is at least 1/log_2 phi>1.44, where phi is the golden ratio. As a consequence, we can also define a standard (non-relaxed) k-tree with amortized...... constant rebalancing, which is an improvement over the current definition. World Wide Web search engines are possible applications for this line of work....

  20. Monte-Carlo Tree Search for Poly-Y

    NARCIS (Netherlands)

    Wevers, L.; te Brinke, Steven

    2014-01-01

    Monte-Carlo tree search (MCTS) is a heuristic search algorithm that has recently been very successful in the games of Go and Hex. In this paper, we describe an MCTS player for the game of Poly-Y, which is a connection game similar to Hex. Our player won the CodeCup 2014 AI programming competition.

  1. Efficient Tree Search in Encrypted Data

    NARCIS (Netherlands)

    Brinkman, Richard; Feng, L.; Doumen, J.M.; Hartel, Pieter H.; Jonker, Willem

    Sometimes there is a need to store sensitive data on an untrusted database server. Song Wagner and Perrig have introduced a way to search for the existence of a word in an encrypted textual document. The search speed is linear in the size of the document. It does not scale well for a large database.

  2. Efficient Tree Search in Encrypted Data

    NARCIS (Netherlands)

    Brinkman, Richard; Fernández-Medina, E.; Hernández Castro, J.C.; Feng, L.; Doumen, J.M.; García-Villalba, L.J.; Hartel, Pieter H.; Jonker, Willem

    Sometimes there is a need to store sensitive data on an untrusted database server. Song, Wagner and Perrig have introduced a way to search for the existence of a word in an encrypted textual document. The search speed is linear in the size of the document. It does not scale well for a large

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

  4. Cache-Oblivious Search Trees via Binary Trees of Small Height

    DEFF Research Database (Denmark)

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

    2002-01-01

    We propose a version of cache oblivious search trees which is simpler than the previous proposal of Bender, Demaine and Farach-Colton and has the same complexity bounds. In particular, our data structure avoids the use of weight balanced B-trees, and can be implemented as just a single array...... oblivious fashion, using the van Emde Boas layout of Prokop.We also investigate the practicality of cache obliviousness in the area of search trees, by providing an empirical comparison of different methods for laying out a search tree in memory....... of data elements, without the use of pointers. The structure also improves space utilization.For storing n elements, our proposal uses (1 + ε)n times the element size of memory, and performs searches in worst case O(logB n) memory transfers, updates in amortized O((log2 n)/(εB)) memory transfers...

  5. Computing a Clique Tree with the Algorithm Maximal Label Search

    Directory of Open Access Journals (Sweden)

    Anne Berry

    2017-01-01

    Full Text Available The algorithm MLS (Maximal Label Search is a graph search algorithm that generalizes the algorithms Maximum Cardinality Search (MCS, Lexicographic Breadth-First Search (LexBFS, Lexicographic Depth-First Search (LexDFS and Maximal Neighborhood Search (MNS. On a chordal graph, MLS computes a PEO (perfect elimination ordering of the graph. We show how the algorithm MLS can be modified to compute a PMO (perfect moplex ordering, as well as a clique tree and the minimal separators of a chordal graph. We give a necessary and sufficient condition on the labeling structure of MLS for the beginning of a new clique in the clique tree to be detected by a condition on labels. MLS is also used to compute a clique tree of the complement graph, and new cliques in the complement graph can be detected by a condition on labels for any labeling structure. We provide a linear time algorithm computing a PMO and the corresponding generators of the maximal cliques and minimal separators of the complement graph. On a non-chordal graph, the algorithm MLSM, a graph search algorithm computing an MEO and a minimal triangulation of the graph, is used to compute an atom tree of the clique minimal separator decomposition of any graph.

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

  7. Monte-Carlo Tree Search for Simulated Car Racing

    DEFF Research Database (Denmark)

    Fischer, Jacob; Falsted, Nikolaj; Vielwerth, Mathias

    2015-01-01

    Monte Carlo Tree Search (MCTS) has recently seen considerable success in playing certain types of games, most of which are discrete, fully observable zero-sum games. Consequently there is currently considerable interest within the research community in investigating what other games this algorithm...... of the action space. This combination allows the controller to effectively search the tree of potential future states. Results show that it is indeed possible to implement a competent MCTS-based racing controller. The controller generalizes to most road tracks as long as a warm-up period is provided....

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

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

  10. Optimal Finger Search Trees in the Pointer Machine

    DEFF Research Database (Denmark)

    Brodal, Gerth Stølting; Lagogiannis, George; Makris, Christos

    2003-01-01

    We develop a new finger search tree with worst-case constant update time in the Pointer Machine (PM) model of computation. This was a major problem in the field of Data Structures and was tantalizingly open for over twenty years while many attempts by researchers were made to solve it. The result...

  11. MDTS: automatic complex materials design using Monte Carlo tree search.

    Science.gov (United States)

    M Dieb, Thaer; Ju, Shenghong; Yoshizoe, Kazuki; Hou, Zhufeng; Shiomi, Junichiro; Tsuda, Koji

    2017-01-01

    Complex materials design is often represented as a black-box combinatorial optimization problem. In this paper, we present a novel python library called MDTS (Materials Design using Tree Search). Our algorithm employs a Monte Carlo tree search approach, which has shown exceptional performance in computer Go game. Unlike evolutionary algorithms that require user intervention to set parameters appropriately, MDTS has no tuning parameters and works autonomously in various problems. In comparison to a Bayesian optimization package, our algorithm showed competitive search efficiency and superior scalability. We succeeded in designing large Silicon-Germanium (Si-Ge) alloy structures that Bayesian optimization could not deal with due to excessive computational cost. MDTS is available at https://github.com/tsudalab/MDTS.

  12. Local search for the generalized tree alignment problem.

    Science.gov (United States)

    Varón, Andrés; Wheeler, Ward C

    2013-02-26

    A phylogeny postulates shared ancestry relationships among organisms in the form of a binary tree. Phylogenies attempt to answer an important question posed in biology: what are the ancestor-descendent relationships between organisms? At the core of every biological problem lies a phylogenetic component. The patterns that can be observed in nature are the product of complex interactions, constrained by the template that our ancestors provide. The problem of simultaneous tree and alignment estimation under Maximum Parsimony is known in combinatorial optimization as the Generalized Tree Alignment Problem (GTAP). The GTAP is the Steiner Tree Problem for the sequence edit distance. Like many biologically interesting problems, the GTAP is NP-Hard. Typically the Steiner Tree is presented under the Manhattan or the Hamming distances. Experimentally, the accuracy of the GTAP has been subjected to evaluation. Results show that phylogenies selected using the GTAP from unaligned sequences are competitive with the best methods and algorithms available. Here, we implement and explore experimentally existing and new local search heuristics for the GTAP using simulated and real data. The methods presented here improve by more than three orders of magnitude in execution time the best local search heuristics existing to date when applied to real data.

  13. USING PRECEDENTS FOR REDUCTION OF DECISION TREE BY GRAPH SEARCH

    Directory of Open Access Journals (Sweden)

    I. A. Bessmertny

    2015-01-01

    Full Text Available The paper considers the problem of mutual payment organization between business entities by means of clearing that is solved by search of graph paths. To reduce the decision tree complexity a method of precedents is proposed that consists in saving the intermediate solution during the moving along decision tree. An algorithm and example are presented demonstrating solution complexity coming close to a linear one. The tests carried out in civil aviation settlement system demonstrate approximately 30 percent shortage of real money transfer. The proposed algorithm is planned to be implemented also in other clearing organizations of the Russian Federation.

  14. Analysis of an iterated local search algorithm for vertex cover in sparse random graphs

    DEFF Research Database (Denmark)

    Witt, Carsten

    2012-01-01

    finds an optimal cover in polynomial time with a probability arbitrarily close to 1. This behavior relies on the absence of a giant component. As an additional insight into the randomized search, it is shown that the heuristic fails badly also on graphs consisting of a single tree component of maximum......Recently, various randomized search heuristics have been studied for the solution of the minimum vertex cover problem, in particular for sparse random instances according to the G(n,c/n) model, where c>0 is a constant. Methods from statistical physics suggest that the problem is easy if c......search heuristics on random graphs. For csearch heuristic...

  15. RNA search with decision trees and partial covariance models.

    Science.gov (United States)

    Smith, Jennifer A

    2009-01-01

    The use of partial covariance models to search for RNA family members in genomic sequence databases is explored. The partial models are formed from contiguous subranges of the overall RNA family multiple alignment columns. A binary decision-tree framework is presented for choosing the order to apply the partial models and the score thresholds on which to make the decisions. The decision trees are chosen to minimize computation time subject to the constraint that all of the training sequences are passed to the full covariance model for final evaluation. Computational intelligence methods are suggested to select the decision tree since the tree can be quite complex and there is no obvious method to build the tree in these cases. Experimental results from seven RNA families shows execution times of 0.066-0.268 relative to using the full covariance model alone. Tests on the full sets of known sequences for each family show that at least 95 percent of these sequences are found for two families and 100 percent for five others. Since the full covariance model is run on all sequences accepted by the partial model decision tree, the false alarm rate is at least as low as that of the full model alone.

  16. A parallel algorithm for random searches

    Science.gov (United States)

    Wosniack, M. E.; Raposo, E. P.; Viswanathan, G. M.; da Luz, M. G. E.

    2015-11-01

    We discuss a parallelization procedure for a two-dimensional random search of a single individual, a typical sequential process. To assure the same features of the sequential random search in the parallel version, we analyze the former spatial patterns of the encountered targets for different search strategies and densities of homogeneously distributed targets. We identify a lognormal tendency for the distribution of distances between consecutively detected targets. Then, by assigning the distinct mean and standard deviation of this distribution for each corresponding configuration in the parallel simulations (constituted by parallel random walkers), we are able to recover important statistical properties, e.g., the target detection efficiency, of the original problem. The proposed parallel approach presents a speedup of nearly one order of magnitude compared with the sequential implementation. This algorithm can be easily adapted to different instances, as searches in three dimensions. Its possible range of applicability covers problems in areas as diverse as automated computer searchers in high-capacity databases and animal foraging.

  17. Programming a Hearthstone agent using Monte Carlo Tree Search

    OpenAIRE

    Andersson, Markus Heikki; Hesselberg, Håkon Helgesen

    2016-01-01

    This thesis describes the effort of adapting Monte Carlo Tree Search (MCTS) to the game of Hearthstone, a card game with hidden information and stochastic elements. The focus is on discovering the suitability of MCTS for this environment, as well as which domain-specific adaptations are needed. An MCTS agent is developed for a Hearthstone simulator, which is used to conduct experiments to measure the agent's performance both against human and computer players. The implementation includes ...

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

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

  20. Monte-Carlo Tree Search in chess endgames

    OpenAIRE

    Kohne, Andraž

    2012-01-01

    The Monte-Carlo Tree Search (MCTS) algorithm has in recent years captured the attention of many researchers due to its notable success in the game of Go. In spite of this success, so far it has not been used much in the game of chess. In this thesis, we attempt to apply MCTS to chess endgames. The reason for this is the existence of chess tablebases, i.e. databases that provide an exact value of each chess board position in terms of distance to mate. With this information at disposal we ar...

  1. Improving multivariate Horner schemes with Monte Carlo tree search

    Science.gov (United States)

    Kuipers, J.; Plaat, A.; Vermaseren, J. A. M.; van den Herik, H. J.

    2013-11-01

    Optimizing the cost of evaluating a polynomial is a classic problem in computer science. For polynomials in one variable, Horner's method provides a scheme for producing a computationally efficient form. For multivariate polynomials it is possible to generalize Horner's method, but this leaves freedom in the order of the variables. Traditionally, greedy schemes like most-occurring variable first are used. This simple textbook algorithm has given remarkably efficient results. Finding better algorithms has proved difficult. In trying to improve upon the greedy scheme we have implemented Monte Carlo tree search, a recent search method from the field of artificial intelligence. This results in better Horner schemes and reduces the cost of evaluating polynomials, sometimes by factors up to two.

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

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

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

  5. Mastering the game of Go with deep neural networks and tree search.

    Science.gov (United States)

    Silver, David; Huang, Aja; Maddison, Chris J; Guez, Arthur; Sifre, Laurent; van den Driessche, George; Schrittwieser, Julian; Antonoglou, Ioannis; Panneershelvam, Veda; Lanctot, Marc; Dieleman, Sander; Grewe, Dominik; Nham, John; Kalchbrenner, Nal; Sutskever, Ilya; Lillicrap, Timothy; Leach, Madeleine; Kavukcuoglu, Koray; Graepel, Thore; Hassabis, Demis

    2016-01-28

    The game of Go has long been viewed as the most challenging of classic games for artificial intelligence owing to its enormous search space and the difficulty of evaluating board positions and moves. Here we introduce a new approach to computer Go that uses 'value networks' to evaluate board positions and 'policy networks' to select moves. These deep neural networks are trained by a novel combination of supervised learning from human expert games, and reinforcement learning from games of self-play. Without any lookahead search, the neural networks play Go at the level of state-of-the-art Monte Carlo tree search programs that simulate thousands of random games of self-play. We also introduce a new search algorithm that combines Monte Carlo simulation with value and policy networks. Using this search algorithm, our program AlphaGo achieved a 99.8% winning rate against other Go programs, and defeated the human European Go champion by 5 games to 0. This is the first time that a computer program has defeated a human professional player in the full-sized game of Go, a feat previously thought to be at least a decade away.

  6. Mastering the game of Go with deep neural networks and tree search

    Science.gov (United States)

    Silver, David; Huang, Aja; Maddison, Chris J.; Guez, Arthur; Sifre, Laurent; van den Driessche, George; Schrittwieser, Julian; Antonoglou, Ioannis; Panneershelvam, Veda; Lanctot, Marc; Dieleman, Sander; Grewe, Dominik; Nham, John; Kalchbrenner, Nal; Sutskever, Ilya; Lillicrap, Timothy; Leach, Madeleine; Kavukcuoglu, Koray; Graepel, Thore; Hassabis, Demis

    2016-01-01

    The game of Go has long been viewed as the most challenging of classic games for artificial intelligence owing to its enormous search space and the difficulty of evaluating board positions and moves. Here we introduce a new approach to computer Go that uses ‘value networks’ to evaluate board positions and ‘policy networks’ to select moves. These deep neural networks are trained by a novel combination of supervised learning from human expert games, and reinforcement learning from games of self-play. Without any lookahead search, the neural networks play Go at the level of state-of-the-art Monte Carlo tree search programs that simulate thousands of random games of self-play. We also introduce a new search algorithm that combines Monte Carlo simulation with value and policy networks. Using this search algorithm, our program AlphaGo achieved a 99.8% winning rate against other Go programs, and defeated the human European Go champion by 5 games to 0. This is the first time that a computer program has defeated a human professional player in the full-sized game of Go, a feat previously thought to be at least a decade away.

  7. PREFACE: The random search problem: trends and perspectives The random search problem: trends and perspectives

    Science.gov (United States)

    da Luz, Marcos G. E.; Grosberg, Alexander; Raposo, Ernesto P.; Viswanathan, Gandhi M.

    2009-10-01

    `I can't find my keys!' Who hasn't gone through this experience when leaving, in a hurry, to attend to some urgent matter? The keys could be in many different places. Unless one remembers where he or she has left the keys, the only solution is to look around, more or less randomly. Random searches are common because in many cases the locations of the specific targets are not known a priori. Indeed, such problems have been discussed in diverse contexts, attracting the interest of scientists from many fields, for example: the dynamical or stochastic search for a stable minimum in a complex energy landscape, relevant to systems such as glasses, protein (folding), and others; oil recovery from mature reservoirs; proteins searching for their specific target sites on DNA; animal foraging; survival at the edge of extinction due to low availability of energetic resources; automated searches of registers in high-capacity databases, search engine (e.g., `crawlers') that explore the internet; and even pizza delivery in a jammed traffic system of a medium-size town. In this way, the subject is interesting, challenging and has recently become an important scientific area of investigation. Although the applications are diverse, the underlying physical mechanisms are the same which will become clear in this special issue. Moreover, the inherent complexity of the problem, the abundance of ideas and methods found in this growing interdisciplinary field of research is studied in many areas of physics. In particular, the concepts and methods of statistical mechanics are particularly useful to the study of random searches. On one hand, it centres on how to find the global or local maxima of search efficiency functions with incomplete information. This is, of course, related to the long tradition in physics of using different conceptual and mathematical tools, such as variational methods, to extremize relevant quantities, e.g., energy, entropy and action. Such ideas and approaches are

  8. Monte-Carlo Tree Search in Settlers of Catan

    Science.gov (United States)

    Szita, István; Chaslot, Guillaume; Spronck, Pieter

    Games are considered important benchmark opportunities for artificial intelligence research. Modern strategic board games can typically be played by three or more people, which makes them suitable test beds for investigating multi-player strategic decision making. Monte-Carlo Tree Search (MCTS) is a recently published family of algorithms that achieved successful results with classical, two-player, perfect-information games such as Go. In this paper we apply MCTS to the multi-player, non-deterministic board game Settlers of Catan. We implemented an agent that is able to play against computer-controlled and human players. We show that MCTS can be adapted successfully to multi-agent environments, and present two approaches of providing the agent with a limited amount of domain knowledge. Our results show that the agent has a considerable playing strength when compared to game implementation with existing heuristics. So, we may conclude that MCTS is a suitable tool for achieving a strong Settlers of Catan player.

  9. Virtual Network Embedding via Monte Carlo Tree Search.

    Science.gov (United States)

    Haeri, Soroush; Trajkovic, Ljiljana

    2018-02-01

    Network virtualization helps overcome shortcomings of the current Internet architecture. The virtualized network architecture enables coexistence of multiple virtual networks (VNs) on an existing physical infrastructure. VN embedding (VNE) problem, which deals with the embedding of VN components onto a physical network, is known to be -hard. In this paper, we propose two VNE algorithms: MaVEn-M and MaVEn-S. MaVEn-M employs the multicommodity flow algorithm for virtual link mapping while MaVEn-S uses the shortest-path algorithm. They formalize the virtual node mapping problem by using the Markov decision process (MDP) framework and devise action policies (node mappings) for the proposed MDP using the Monte Carlo tree search algorithm. Service providers may adjust the execution time of the MaVEn algorithms based on the traffic load of VN requests. The objective of the algorithms is to maximize the profit of infrastructure providers. We develop a discrete event VNE simulator to implement and evaluate performance of MaVEn-M, MaVEn-S, and several recently proposed VNE algorithms. We introduce profitability as a new performance metric that captures both acceptance and revenue to cost ratios. Simulation results show that the proposed algorithms find more profitable solutions than the existing algorithms. Given additional computation time, they further improve embedding solutions.

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

  11. Playing Multi-Action Adversarial Games: Online Evolutionary Planning versus Tree Search

    DEFF Research Database (Denmark)

    Justesen, Niels; Mahlmann, Tobias; Risi, Sebastian

    2017-01-01

    We address the problem of playing turn-based multi-action adversarial games, which include many strategy games with extremely high branching factors as players take multiple actions each turn. This leads to the breakdown of standard tree search methods, including Monte Carlo Tree Search (MCTS......), as they become unable to reach a sufficient depth in the game tree. In this paper, we introduce Online Evolutionary Planning (OEP) to address this challenge, which searches for combinations of actions to perform during a single turn guided by a fitness function that evaluates the quality of a particular state...... of plans more efficiently than any of the tested tree search methods as it has a relative advantage when the number of actions per turn increases....

  12. Genetic algorithms as global random search methods

    Science.gov (United States)

    Peck, Charles C.; Dhawan, Atam P.

    1995-01-01

    Genetic algorithm behavior is described in terms of the construction and evolution of the sampling distributions over the space of candidate solutions. This novel perspective is motivated by analysis indicating that the schema theory is inadequate for completely and properly explaining genetic algorithm behavior. Based on the proposed theory, it is argued that the similarities of candidate solutions should be exploited directly, rather than encoding candidate solutions and then exploiting their similarities. Proportional selection is characterized as a global search operator, and recombination is characterized as the search process that exploits similarities. Sequential algorithms and many deletion methods are also analyzed. It is shown that by properly constraining the search breadth of recombination operators, convergence of genetic algorithms to a global optimum can be ensured.

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

  14. Dropout Rates and Response Times of an Occupation Search Tree in a Web Survey

    Directory of Open Access Journals (Sweden)

    Tijdens Kea

    2014-03-01

    Full Text Available Occupation is key in socioeconomic research. As in other survey modes, most web surveys use an open-ended question for occupation, though the absence of interviewers elicits unidentifiable or aggregated responses. Unlike other modes, web surveys can use a search tree with an occupation database. They are hardly ever used, but this may change due to technical advancements. This article evaluates a three-step search tree with 1,700 occupational titles, used in the 2010 multilingual WageIndicator web survey for UK, Belgium and Netherlands (22,990 observations. Dropout rates are high; in Step 1 due to unemployed respondents judging the question not to be adequate, and in Step 3 due to search tree item length. Median response times are substantial due to search tree item length, dropout in the next step and invalid occupations ticked. Overall the validity of the occupation data is rather good, 1.7-7.5% of the respondents completing the search tree have ticked an invalid occupation.

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

    Directory of Open Access Journals (Sweden)

    Alexander Safatli

    2015-06-01

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

  16. Creating, Searching, and Deleting KD Trees Using C++

    Science.gov (United States)

    2014-09-01

    MD): Army Research Laboratory (US); August 2013. Report No.: ARL-TN-559. 4. Vogel, H. A better way to construct the sunflower head. Mathematical...originator. Army Research Laboratory Aberdeen Proving Ground, MD 21005-5066 ARL-TN-0629 September 2014 Creating, Searching, and...5d. PROJECT NUMBER AH80 5e. TASK NUMBER 5f. WORK UNIT NUMBER 7. PERFORMING ORGANIZATION NAME(S) AND ADDRESS(ES) US Army Research Laboratory

  17. Concentrated Hitting Times of Randomized Search Heuristics with Variable Drift

    DEFF Research Database (Denmark)

    Lehre, Per Kristian; Witt, Carsten

    2014-01-01

    Drift analysis is one of the state-of-the-art techniques for the runtime analysis of randomized search heuristics (RSHs) such as evolutionary algorithms (EAs), simulated annealing etc. The vast majority of existing drift theorems yield bounds on the expected value of the hitting time for a target...

  18. Decentralized cooperative unmanned aerial vehicles conflict resolution by neural network-based tree search method

    Directory of Open Access Journals (Sweden)

    Jian Yang

    2016-09-01

    Full Text Available In this article, a tree search algorithm is proposed to find the near optimal conflict avoidance solutions for unmanned aerial vehicles. In the dynamic environment, the unmodeled elements, such as wind, would make UAVs deviate from nominal traces. It brings about difficulties for conflict detection and resolution. The back propagation neural networks are utilized to approximate the unmodeled dynamics of the environment. To satisfy the online planning requirement, the search length of the tree search algorithm would be limited. Therefore, the algorithm may not be able to reach the goal states in search process. The midterm reward function for assessing each node is devised, with consideration given to two factors, namely, the safe separation requirement and the mission of each unmanned aerial vehicle. The simulation examples and the comparisons with previous approaches are provided to illustrate the smooth and convincing behaviours of the proposed algorithm.

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

  20. Theory of Randomized Search Heuristics in Combinatorial Optimization

    DEFF Research Database (Denmark)

    such as time, money, or knowledge to obtain good specific algorithms. It is widely acknowledged that a solid mathematical foundation for such heuristics is needed. Most designers of RSHs, however, rather focused on mimicking processes in nature (such as evolution) rather than making the heuristics amenable......The rigorous mathematical analysis of randomized search heuristics(RSHs) with respect to their expected runtime is a growing research area where many results have been obtained in recent years. This class of heuristics includes well-known approaches such as Randomized Local Search (RLS...... to a mathematical analysis. This is different to the classical design of (randomized) algorithms which are developed with their theoretical analysis of runtime (and proof of correctness) in mind. Despite these obstacles, research from the last about 15 years has shown how to apply the methods for the probabilistic...

  1. Optimizing Event Selection with the Random Grid Search

    Energy Technology Data Exchange (ETDEWEB)

    Bhat, Pushpalatha C. [Fermilab; Prosper, Harrison B. [Florida State U.; Sekmen, Sezen [Kyungpook Natl. U.; Stewart, Chip [Broad Inst., Cambridge

    2017-06-29

    The random grid search (RGS) is a simple, but efficient, stochastic algorithm to find optimal cuts that was developed in the context of the search for the top quark at Fermilab in the mid-1990s. The algorithm, and associated code, have been enhanced recently with the introduction of two new cut types, one of which has been successfully used in searches for supersymmetry at the Large Hadron Collider. The RGS optimization algorithm is described along with the recent developments, which are illustrated with two examples from particle physics. One explores the optimization of the selection of vector boson fusion events in the four-lepton decay mode of the Higgs boson and the other optimizes SUSY searches using boosted objects and the razor variables.

  2. A Distributed Election and Spanning Tree Algorithm Based on Depth First Search Traversals

    DEFF Research Database (Denmark)

    Skyum, Sven

    The existence of an effective distributed traversal algorithm for a class of graphs has proven useful in connection with election problems for those classes. In this paper we show how a general traversal algorithm, such as depth first search, can be turned into an effective election algorithm using...... modular techniques. The presented method also constructs a spanning tree for the graph....

  3. Dropout rates and response times of an occupation search tree in a web survey

    NARCIS (Netherlands)

    Tijdens, K.

    2014-01-01

    Occupation is key in socioeconomic research. As in other survey modes, most web surveys use an open-ended question for occupation, though the absence of interviewers elicits unidentifiable or aggregated responses. Unlike other modes, web surveys can use a search tree with an occupation database.

  4. Modeling carbon allocation in trees: a search for principles.

    Science.gov (United States)

    Franklin, Oskar; Johansson, Jacob; Dewar, Roderick C; Dieckmann, Ulf; McMurtrie, Ross E; Brännström, Ake; Dybzinski, Ray

    2012-06-01

    We review approaches to predicting carbon and nitrogen allocation in forest models in terms of their underlying assumptions and their resulting strengths and limitations. Empirical and allometric methods are easily developed and computationally efficient, but lack the power of evolution-based approaches to explain and predict multifaceted effects of environmental variability and climate change. In evolution-based methods, allocation is usually determined by maximization of a fitness proxy, either in a fixed environment, which we call optimal response (OR) models, or including the feedback of an individual's strategy on its environment (game-theoretical optimization, GTO). Optimal response models can predict allocation in single trees and stands when there is significant competition only for one resource. Game-theoretical optimization can be used to account for additional dimensions of competition, e.g., when strong root competition boosts root allocation at the expense of wood production. However, we demonstrate that an OR model predicts similar allocation to a GTO model under the root-competitive conditions reported in free-air carbon dioxide enrichment (FACE) experiments. The most evolutionarily realistic approach is adaptive dynamics (AD) where the allocation strategy arises from eco-evolutionary dynamics of populations instead of a fitness proxy. We also discuss emerging entropy-based approaches that offer an alternative thermodynamic perspective on allocation, in which fitness proxies are replaced by entropy or entropy production. To help develop allocation models further, the value of wide-ranging datasets, such as FLUXNET, could be greatly enhanced by ancillary measurements of driving variables, such as water and soil nitrogen availability.

  5. Random search optimization based on genetic algorithm and discriminant function

    Science.gov (United States)

    Kiciman, M. O.; Akgul, M.; Erarslanoglu, G.

    1990-01-01

    The general problem of optimization with arbitrary merit and constraint functions, which could be convex, concave, monotonic, or non-monotonic, is treated using stochastic methods. To improve the efficiency of the random search methods, a genetic algorithm for the search phase and a discriminant function for the constraint-control phase were utilized. The validity of the technique is demonstrated by comparing the results to published test problem results. Numerical experimentation indicated that for cases where a quick near optimum solution is desired, a general, user-friendly optimization code can be developed without serious penalties in both total computer time and accuracy.

  6. Orthogonal Range Searching in Moderate Dimensions: k-d Trees and Range Trees Strike Back

    OpenAIRE

    Chan, Timothy M.

    2017-01-01

    We revisit the orthogonal range searching problem and the exact l_infinity nearest neighbor searching problem for a static set of n points when the dimension d is moderately large. We give the first data structure with near linear space that achieves truly sublinear query time when the dimension is any constant multiple of log n. Specifically, the preprocessing time and space are O(n^{1+delta}) for any constant delta>0, and the expected query time is n^{1-1/O(c log c)} for d = c log n. The ...

  7. A Fast Framework for Abrupt Change Detection Based on Binary Search Trees and Kolmogorov Statistic

    Directory of Open Access Journals (Sweden)

    Jin-Peng Qi

    2016-01-01

    Full Text Available Change-Point (CP detection has attracted considerable attention in the fields of data mining and statistics; it is very meaningful to discuss how to quickly and efficiently detect abrupt change from large-scale bioelectric signals. Currently, most of the existing methods, like Kolmogorov-Smirnov (KS statistic and so forth, are time-consuming, especially for large-scale datasets. In this paper, we propose a fast framework for abrupt change detection based on binary search trees (BSTs and a modified KS statistic, named BSTKS (binary search trees and Kolmogorov statistic. In this method, first, two binary search trees, termed as BSTcA and BSTcD, are constructed by multilevel Haar Wavelet Transform (HWT; second, three search criteria are introduced in terms of the statistic and variance fluctuations in the diagnosed time series; last, an optimal search path is detected from the root to leaf nodes of two BSTs. The studies on both the synthetic time series samples and the real electroencephalograph (EEG recordings indicate that the proposed BSTKS can detect abrupt change more quickly and efficiently than KS, t-statistic (t, and Singular-Spectrum Analyses (SSA methods, with the shortest computation time, the highest hit rate, the smallest error, and the highest accuracy out of four methods. This study suggests that the proposed BSTKS is very helpful for useful information inspection on all kinds of bioelectric time series signals.

  8. A best-first tree-searching approach for ML decoding in MIMO system

    KAUST Repository

    Shen, Chung-An

    2012-07-28

    In MIMO communication systems maximum-likelihood (ML) decoding can be formulated as a tree-searching problem. This paper presents a tree-searching approach that combines the features of classical depth-first and breadth-first approaches to achieve close to ML performance while minimizing the number of visited nodes. A detailed outline of the algorithm is given, including the required storage. The effects of storage size on BER performance and complexity in terms of search space are also studied. Our result demonstrates that with a proper choice of storage size the proposed method visits 40% fewer nodes than a sphere decoding algorithm at signal to noise ratio (SNR) = 20dB and by an order of magnitude at 0 dB SNR.

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

  10. Multi-tree Coding Method (MCM) for drainage networks supporting high-efficient search

    Science.gov (United States)

    Wang, Hao; Fu, Xudong; Wang, Guangqian

    2013-03-01

    River coding method for drainage networks plays an very important role in the physical simulation of river basins. In this study we developed a new river coding method named Multi-tree Coding Method (MCM), which has the following features: (1) it is established on a topological pattern reflecting the dendriform structure of drainage networks; (2) the multi-tree code can be effectively managed by the database to perform convenient topological search toward drainage networks using Structured Query Language (SQL); (3) the multi-tree code does not exhibit digital overflow problems in the computer, thus any resolution and scale drainage networks can easily be coded; and (4) it supports high-efficient search process. A river reach can be directly positioned in a drainage network under MCM, without the complex search process from all river reaches. This feature has great potential to improve the computational performance of basin models. We demonstrate here the efficiency and practicality of MCM by testing it in the Yalu Tsangpo river basin, Tibet. A drainage network with 140,745 digital reaches was extracted from the digital elevation model (DEM), and the multi-tree codes of all river reaches were obtained.

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

  12. Localization Transition Induced by Learning in Random Searches

    Science.gov (United States)

    Falcón-Cortés, Andrea; Boyer, Denis; Giuggioli, Luca; Majumdar, Satya N.

    2017-10-01

    We solve an adaptive search model where a random walker or Lévy flight stochastically resets to previously visited sites on a d -dimensional lattice containing one trapping site. Because of reinforcement, a phase transition occurs when the resetting rate crosses a threshold above which nondiffusive stationary states emerge, localized around the inhomogeneity. The threshold depends on the trapping strength and on the walker's return probability in the memoryless case. The transition belongs to the same class as the self-consistent theory of Anderson localization. These results show that similarly to many living organisms and unlike the well-studied Markovian walks, non-Markov movement processes can allow agents to learn about their environment and promise to bring adaptive solutions in search tasks.

  13. Optimization by GRASP greedy randomized adaptive search procedures

    CERN Document Server

    Resende, Mauricio G C

    2016-01-01

    This is the first book to cover GRASP (Greedy Randomized Adaptive Search Procedures), a metaheuristic that has enjoyed wide success in practice with a broad range of applications to real-world combinatorial optimization problems. The state-of-the-art coverage and carefully crafted pedagogical style lends this book highly accessible as an introductory text not only to GRASP, but also to combinatorial optimization, greedy algorithms, local search, and path-relinking, as well as to heuristics and metaheuristics, in general. The focus is on algorithmic and computational aspects of applied optimization with GRASP with emphasis given to the end-user, providing sufficient information on the broad spectrum of advances in applied optimization with GRASP. For the more advanced reader, chapters on hybridization with path-relinking and parallel and continuous GRASP present these topics in a clear and concise fashion. Additionally, the book offers a very complete annotated bibliography of GRASP and combinatorial optimizat...

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

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

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

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

  18. A tabu-search for minimising the carry-over effects value of a round ...

    African Journals Online (AJOL)

    The initial solution for the tabu-search algorithm was generated randomly by using a backtracking tree-search approach for constructing a starter, where branches are selected at random on each level of the tree. If a terminating node in the tree is reached, the search terminates if a starter has been constructed and restarts ...

  19. The Impact of Parametrization on Randomized Search Heuristics

    DEFF Research Database (Denmark)

    Gießen, Christian

    optimization algorithms. We consider the following topics. Escaping local optima using local search. We analyze memetic algorithms, i.e. evolutionary algorithms equipped with a local search after mutation. To this end we consider the (1+1) EA equipped with Standard Local Search (SLS) and Variable-Depth Search...

  20. Randomized discrepancy bounded local search for transmission expansion planning

    Energy Technology Data Exchange (ETDEWEB)

    Bent, Russell W [Los Alamos National Laboratory; Daniel, William B [Los Alamos National Laboratory

    2010-11-23

    In recent years the transmission network expansion planning problem (TNEP) has become increasingly complex. As the TNEP is a non-linear and non-convex optimization problem, researchers have traditionally focused on approximate models of power flows to solve the TNEP. Existing approaches are often tightly coupled to the approximation choice. Until recently these approximations have produced results that are straight-forward to adapt to the more complex (real) problem. However, the power grid is evolving towards a state where the adaptations are no longer easy (e.g. large amounts of limited control, renewable generation) and necessitates new approaches. Recent work on deterministic Discrepancy Bounded Local Search (DBLS) has shown it to be quite effective in addressing this question. DBLS encapsulates the complexity of power flow modeling in a black box that may be queried for information about the quality of proposed expansions. In this paper, we propose a randomization strategy that builds on DBLS and dramatically increases the computational efficiency of the algorithm.

  1. Fast inexact mapping using advanced tree exploration on backward search methods.

    Science.gov (United States)

    Salavert, José; Tomás, Andrés; Tárraga, Joaquín; Medina, Ignacio; Dopazo, Joaquín; Blanquer, Ignacio

    2015-01-28

    Short sequence mapping methods for Next Generation Sequencing consist on a combination of seeding techniques followed by local alignment based on dynamic programming approaches. Most seeding algorithms are based on backward search alignment, using the Burrows Wheeler Transform, the Ferragina and Manzini Index or Suffix Arrays. All these backward search algorithms have excellent performance, but their computational cost highly increases when allowing errors. In this paper, we discuss an inexact mapping algorithm based on pruning strategies for search tree exploration over genomic data. The proposed algorithm achieves a 13x speed-up over similar algorithms when allowing 6 base errors, including insertions, deletions and mismatches. This algorithm can deal with 400 bps reads with up to 9 errors in a high quality Illumina dataset. In this example, the algorithm works as a preprocessor that reduces by 55% the number of reads to be aligned. Depending on the aligner the overall execution time is reduced between 20-40%. Although not intended as a complete sequence mapping tool, the proposed algorithm could be used as a preprocessing step to modern sequence mappers. This step significantly reduces the number reads to be aligned, accelerating overall alignment time. Furthermore, this algorithm could be used for accelerating the seeding step of already available sequence mappers. In addition, an out-of-core index has been implemented for working with large genomes on systems without expensive memory configurations.

  2. Expected Fitness Gains of Randomized Search Heuristics for the Traveling Salesperson Problem.

    Science.gov (United States)

    Nallaperuma, Samadhi; Neumann, Frank; Sudholt, Dirk

    2017-01-01

    Randomized search heuristics are frequently applied to NP-hard combinatorial optimization problems. The runtime analysis of randomized search heuristics has contributed tremendously to our theoretical understanding. Recently, randomized search heuristics have been examined regarding their achievable progress within a fixed-time budget. We follow this approach and present a fixed-budget analysis for an NP-hard combinatorial optimization problem. We consider the well-known Traveling Salesperson Problem (TSP) and analyze the fitness increase that randomized search heuristics are able to achieve within a given fixed-time budget. In particular, we analyze Manhattan and Euclidean TSP instances and Randomized Local Search (RLS), (1+1) EA and (1+[Formula: see text]) EA algorithms for the TSP in a smoothed complexity setting, and derive the lower bounds of the expected fitness gain for a specified number of generations.

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

  4. Extremely Low Bit-Rate Nearest Neighbor Search Using a Set Compression Tree.

    Science.gov (United States)

    Arandjelović, Relja; Zisserman, Andrew

    2014-12-01

    The goal of this work is a data structure to support approximate nearest neighbor search on very large scale sets of vector descriptors. The criteria we wish to optimize are: (i) that the memory footprint of the representation should be very small (so that it fits into main memory); and (ii) that the approximation of the original vectors should be accurate. We introduce a novel encoding method, named a Set Compression Tree (SCT), that satisfies these criteria. It is able to accurately compress 1 million descriptors using only a few bits per descriptor. The large compression rate is achieved by not compressing on a per-descriptor basis, but instead by compressing the set of descriptors jointly. We describe the encoding, decoding and use for nearest neighbor search, all of which are quite straightforward to implement. The method, tested on standard benchmarks (SIFT1M and 80 Million Tiny Images), achieves superior performance to a number of state-of-the-art approaches, including Product Quantization, Locality Sensitive Hashing, Spectral Hashing, and Iterative Quantization. For example, SCT has a lower error using 5 bits than any of the other approaches, even when they use 16 or more bits per descriptor. We also include a comparison of all the above methods on the standard benchmarks.

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

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

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

  8. NV-tree: an efficient disk-based index for approximate search in very large high-dimensional collections.

    Science.gov (United States)

    Lejsek, Herwig; Asmundsson, Fridrik Heidar; Jónsson, Björn thór; Amsaleg, Laurent

    2009-05-01

    Over the last two decades, much research effort has been spent on nearest neighbor search in high-dimensional data sets. Most of the approaches published thus far have, however, only been tested on rather small collections. When large collections have been considered, high-performance environments have been used, in particular systems with a large main memory. Accessing data on disk has largely been avoided because disk operations are considered to be too slow. It has been shown, however, that using large amounts of memory is generally not an economic choice. Therefore, we propose the NV-tree, which is a very efficient disk-based data structure that can give good approximate answers to nearest neighbor queries with a single disk operation, even for very large collections of high-dimensional data. Using a single NV-tree, the returned results have high recall but contain a number of false positives. By combining two or three NV-trees, most of those false positives can be avoided while retaining the high recall. Finally, we compare the NV-tree to Locality Sensitive Hashing, a popular method for epsilon-distance search. We show that they return results of similar quality, but the NV-tree uses many fewer disk reads.

  9. Tree breeding for pest resistance for the next 50 years: the search for cross resistance?

    Science.gov (United States)

    Alvin D. Yanchuk

    2012-01-01

    Research activities aimed at developing resistance to pests (insect, pathogens, mammals) in forest trees can be documented back over 5 decades. While a substantial body of research has been published on resistances in forest trees, not much of this work has made its way into applied tree improvement programs. There are several reasons for this, e.g.: (i) a new...

  10. Detection of Spam Email by Combining Harmony Search Algorithm and Decision Tree

    Directory of Open Access Journals (Sweden)

    M. Z. Gashti

    2017-06-01

    Full Text Available Spam emails is probable the main problem faced by most e-mail users. There are many features in spam email detection and some of these features have little effect on detection and cause skew detection and classification of spam email. Thus, Feature Selection (FS is one of the key topics in spam email detection systems. With choosing the important and effective features in classification, its performance can be optimized. Selector features has the task of finding a subset of features to improve the accuracy of its predictions. In this paper, a hybrid of Harmony Search Algorithm (HSA and decision tree is used for selecting the best features and classification. The obtained results on Spam-base dataset show that the rate of recognition accuracy in the proposed model is 95.25% which is high in comparison with models such as SVM, NB, J48 and MLP. Also, the accuracy of the proposed model on the datasets of Ling-spam and PU1 is high in comparison with models such as NB, SVM and LR.

  11. Multitarget search on complex networks: A logarithmic growth of global mean random cover time

    Science.gov (United States)

    Weng, Tongfeng; Zhang, Jie; Small, Michael; Yang, Ji; Bijarbooneh, Farshid Hassani; Hui, Pan

    2017-09-01

    We investigate multitarget search on complex networks and derive an exact expression for the mean random cover time that quantifies the expected time a walker needs to visit multiple targets. Based on this, we recover and extend some interesting results of multitarget search on networks. Specifically, we observe the logarithmic increase of the global mean random cover time with the target number for a broad range of random search processes, including generic random walks, biased random walks, and maximal entropy random walks. We show that the logarithmic growth pattern is a universal feature of multi-target search on networks by using the annealed network approach and the Sherman-Morrison formula. Moreover, we find that for biased random walks, the global mean random cover time can be minimized, and that the corresponding optimal parameter also minimizes the global mean first passage time, pointing towards its robustness. Our findings further confirm that the logarithmic growth pattern is a universal law governing multitarget search in confined media.

  12. A Discrete Group Search Optimizer for Hybrid Flowshop Scheduling Problem with Random Breakdown

    National Research Council Canada - National Science Library

    Cui, Zhe; Gu, Xingsheng

    2014-01-01

    ...) together with a discrete group search optimizer algorithm (DGSO). In particular, two different working cases, preempt-resume case, and preempt-repeat case are considered under random breakdown...

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

  14. An adaptive random search for short term generation scheduling with network constraints.

    Directory of Open Access Journals (Sweden)

    J A Marmolejo

    Full Text Available This paper presents an adaptive random search approach to address a short term generation scheduling with network constraints, which determines the startup and shutdown schedules of thermal units over a given planning horizon. In this model, we consider the transmission network through capacity limits and line losses. The mathematical model is stated in the form of a Mixed Integer Non Linear Problem with binary variables. The proposed heuristic is a population-based method that generates a set of new potential solutions via a random search strategy. The random search is based on the Markov Chain Monte Carlo method. The main key of the proposed method is that the noise level of the random search is adaptively controlled in order to exploring and exploiting the entire search space. In order to improve the solutions, we consider coupling a local search into random search process. Several test systems are presented to evaluate the performance of the proposed heuristic. We use a commercial optimizer to compare the quality of the solutions provided by the proposed method. The solution of the proposed algorithm showed a significant reduction in computational effort with respect to the full-scale outer approximation commercial solver. Numerical results show the potential and robustness of our approach.

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

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

  17. A Search for Alternatives to Random Assignment to Treatment Groups.

    Science.gov (United States)

    Halasa, Ofelia

    In a public school setting administrators are frequently under local pressure to make a new project service available to all eligible children. However, comparable control groups for project evaluation are often absent, and although random assignment to treatment groups remains the most systematic method of providing controls, this is not often…

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

    Science.gov (United States)

    Smoly, Ilan; Carmel, Amir; Shemer-Avni, Yonat; Yeger-Lotem, Esti; Ziv-Ukelson, Michal

    2016-03-01

    Network querying is a powerful approach to mine molecular interaction networks. Most state-of-the-art network querying tools either confine the search to a prespecified topology in the form of some template subnetwork, or do not specify any topological constraints at all. Another approach is grammar-based queries, which are more flexible and expressive as they allow for expressing the topology of the sought pattern according to some grammar-based logic. Previous grammar-based network querying tools were confined to the identification of paths. In this article, we extend the patterns identified by grammar-based query approaches from paths to trees. For this, we adopt a higher order query descriptor in the form of a regular tree grammar (RTG). We introduce a novel problem and propose an algorithm to search a given graph for the k highest scoring subgraphs matching a tree accepted by an RTG. Our algorithm is based on the combination of dynamic programming with color coding, and includes an extension of previous k-best parsing optimization approaches to avoid isomorphic trees in the output. We implement the new algorithm and exemplify its application to mining viral infection patterns within molecular interaction networks. Our code is available online.

  19. Asymmetric Move Selection Strategies in Monte-Carlo Tree Search: Minimizing the Simple Regret at Max Nodes

    OpenAIRE

    Liu, Yun-Ching; Tsuruoka, Yoshimasa

    2016-01-01

    The combination of multi-armed bandit (MAB) algorithms with Monte-Carlo tree search (MCTS) has made a significant impact in various research fields. The UCT algorithm, which combines the UCB bandit algorithm with MCTS, is a good example of the success of this combination. The recent breakthrough made by AlphaGo, which incorporates convolutional neural networks with bandit algorithms in MCTS, also highlights the necessity of bandit algorithms in MCTS. However, despite the various investigation...

  20. A Comparison of Monte Carlo Tree Search and Rolling Horizon Optimization for Large Scale Dynamic Resource Allocation Problems

    Science.gov (United States)

    2015-05-01

    Topaloglu. 2010. Approximate dynamic programming for dynamic capacity allocation with multiple priority levels. IIE Transactions 43 129–142. doi:10.1080...Hayward, Philip Henderson. 2010. Monte Carlo tree search in hex. IEEE Transactions on Computational Intelligence and AI in Games 2 251–258. Auer, Peter...14–26. Bertsimas, Dimitris, Ebrahim Nasrabadi, Ioannis Ch. Paschalidis. 2015. Robust fluid processing networks. IEEE Transactions on Automatic

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

  2. Quest for Orthologs Entails Quest for Tree of Life: In Search of the Gene Stream.

    Science.gov (United States)

    Boeckmann, Brigitte; Marcet-Houben, Marina; Rees, Jonathan A; Forslund, Kristoffer; Huerta-Cepas, Jaime; Muffato, Matthieu; Yilmaz, Pelin; Xenarios, Ioannis; Bork, Peer; Lewis, Suzanna E; Gabaldón, Toni

    2015-07-01

    Quest for Orthologs (QfO) is a community effort with the goal to improve and benchmark orthology predictions. As quality assessment assumes prior knowledge on species phylogenies, we investigated the congruency between existing species trees by comparing the relationships of 147 QfO reference organisms from six Tree of Life (ToL)/species tree projects: The National Center for Biotechnology Information (NCBI) taxonomy, Opentree of Life, the sequenced species/species ToL, the 16S ribosomal RNA (rRNA) database, and trees published by Ciccarelli et al. (Ciccarelli FD, et al. 2006. Toward automatic reconstruction of a highly resolved tree of life. Science 311:1283-1287) and by Huerta-Cepas et al. (Huerta-Cepas J, Marcet-Houben M, Gabaldon T. 2014. A nested phylogenetic reconstruction approach provides scalable resolution in the eukaryotic Tree Of Life. PeerJ PrePrints 2:223) Our study reveals that each species tree suggests a different phylogeny: 87 of the 146 (60%) possible splits of a dichotomous and rooted tree are congruent, while all other splits are incongruent in at least one of the species trees. Topological differences are observed not only at deep speciation events, but also within younger clades, such as Hominidae, Rodentia, Laurasiatheria, or rosids. The evolutionary relationships of 27 archaea and bacteria are highly inconsistent. By assessing 458,108 gene trees from 65 genomes, we show that consistent species topologies are more often supported by gene phylogenies than contradicting ones. The largest concordant species tree includes 77 of the QfO reference organisms at the most. Results are summarized in the form of a consensus ToL (http://swisstree.vital-it.ch/species_tree) that can serve different benchmarking purposes. © The Author(s) 2015. Published by Oxford University Press on behalf of the Society for Molecular Biology and Evolution.

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

  4. Modal generation of the design parameters of an elastic spacecraft by the random search method

    Science.gov (United States)

    Titov, B. A.

    A method for the modal generation of the dynamic properties of an elastic spacecraft is proposed which is based on algorithms of random search in the space of design parameters. A practical implementation of this approach is illustrated by an example. It is shown that the modal parameter generation procedure based on the random search solves the problem of parameter selection. However, as in any other method, the accuracy of the computation of matrix elements is largely determined by the initial set of permissible values and the number of random samples in determining the subgradient of the objective function.

  5. Modelling sensory limitation: the role of tree selection, memory and information transfer in bats' roost searching strategies.

    Directory of Open Access Journals (Sweden)

    Ireneusz Ruczyński

    Full Text Available Sensory limitation plays an important role in the evolution of animal behaviour. Animals have to find objects of interest (e.g. food, shelters, predators. When sensory abilities are strongly limited, animals adjust their behaviour to maximize chances for success. Bats are nocturnal, live in complex environments, are capable of flight and must confront numerous perceptual challenges (e.g. limited sensory range, interfering clutter echoes. This makes them an excellent model for studying the role of compensating behaviours to decrease costs of finding resources. Cavity roosting bats are especially interesting because the availability of tree cavities is often limited, and their quality is vital for bats during the breeding season. From a bat's sensory point of view, cavities are difficult to detect and finding them requires time and energy. However, tree cavities are also long lasting, allowing information transfer among conspecifics. Here, we use a simple simulation model to explore the benefits of tree selection, memory and eavesdropping (compensation behaviours to searches for tree cavities by bats with short and long perception range. Our model suggests that memory and correct discrimination of tree suitability are the basic strategies decreasing the cost of roost finding, whereas perceptual range plays a minor role in this process. Additionally, eavesdropping constitutes a buffer that reduces the costs of finding new resources (such as roosts, especially when they occur in low density. We conclude that natural selection may promote different strategies of roost finding in relation to habitat conditions and cognitive skills of animals.

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

  7. Ansel Adams's Eucalyptus Tree, Fort Ross: Nature, Photography, and the Search for California

    OpenAIRE

    Adam Arenson

    2005-01-01

    This article considers the image of California evoked in the unusual Ansel Adams photograph Eucalyptus Tree, Fort Ross, California (1969), a Polaroid Land image of the garrison fence and an aged eucalyptus tree. Considering the participation of Russian occupation, Australian cross-pollination, Carleton Watkins's early photographs of redwoods, automotive and tourist images in the creation of this distinctive California place, the article argues that to understand Ansel Adams's work, we must no...

  8. On the expected duration of a search for a fixed pattern in random data

    DEFF Research Database (Denmark)

    Nielsen, Peter Tolstrup

    1973-01-01

    An expression is obtained for the expected duration of a search to find a givenL-ary sequence in a semi-infinite stream of randomL-ary data. The search time is found to be an increasing function of the lengths of the "bifices" of the pattern, where the term bifix denotes a sequence which is both ...... a prefix and a suffix....

  9. Online games: a novel approach to explore how partial information influences human random searches

    Science.gov (United States)

    Martínez-García, Ricardo; Calabrese, Justin M.; López, Cristóbal

    2017-01-01

    Many natural processes rely on optimizing the success ratio of a search process. We use an experimental setup consisting of a simple online game in which players have to find a target hidden on a board, to investigate how the rounds are influenced by the detection of cues. We focus on the search duration and the statistics of the trajectories traced on the board. The experimental data are explained by a family of random-walk-based models and probabilistic analytical approximations. If no initial information is given to the players, the search is optimized for cues that cover an intermediate spatial scale. In addition, initial information about the extension of the cues results, in general, in faster searches. Finally, strategies used by informed players turn into non-stationary processes in which the length of e ach displacement evolves to show a well-defined characteristic scale that is not found in non-informed searches.

  10. Quasi-steady-state analysis of two-dimensional random intermittent search processes

    KAUST Repository

    Bressloff, Paul C.

    2011-06-01

    We use perturbation methods to analyze a two-dimensional random intermittent search process, in which a searcher alternates between a diffusive search phase and a ballistic movement phase whose velocity direction is random. A hidden target is introduced within a rectangular domain with reflecting boundaries. If the searcher moves within range of the target and is in the search phase, it has a chance of detecting the target. A quasi-steady-state analysis is applied to the corresponding Chapman-Kolmogorov equation. This generates a reduced Fokker-Planck description of the search process involving a nonzero drift term and an anisotropic diffusion tensor. In the case of a uniform direction distribution, for which there is zero drift, and isotropic diffusion, we use the method of matched asymptotics to compute the mean first passage time (MFPT) to the target, under the assumption that the detection range of the target is much smaller than the size of the domain. We show that an optimal search strategy exists, consistent with previous studies of intermittent search in a radially symmetric domain that were based on a decoupling or moment closure approximation. We also show how the decoupling approximation can break down in the case of biased search processes. Finally, we analyze the MFPT in the case of anisotropic diffusion and find that anisotropy can be useful when the searcher starts from a fixed location. © 2011 American Physical Society.

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

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

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

  14. Fitness levels with tail bounds for the analysis of randomized search heuristics

    DEFF Research Database (Denmark)

    Witt, Carsten

    2014-01-01

    The fitness-level method, also called the method of f-based partitions, is an intuitive and widely used technique for the running time analysis of randomized search heuristics. It was originally defined to prove upper and lower bounds on the expected running time. Recently, upper tail bounds were...

  15. Optimizing Linear Functions with Randomized Search Heuristics - The Robustness of Mutation

    DEFF Research Database (Denmark)

    Witt, Carsten

    2012-01-01

    The analysis of randomized search heuristics on classes of functions is fundamental for the understanding of the underlying stochastic process and the development of suitable proof techniques. Recently, remarkable progress has been made in bounding the expected optimization time of the simple (1...

  16. Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions

    DEFF Research Database (Denmark)

    Witt, Carsten

    2013-01-01

    The analysis of randomized search heuristics on classes of functions is fundamental to the understanding of the underlying stochastic process and the development of suitable proof techniques. Recently, remarkable progress has been made in bounding the expected optimization time of a simple...

  17. Neural network based adaptive control of nonlinear plants using random search optimization algorithms

    Science.gov (United States)

    Boussalis, Dhemetrios; Wang, Shyh J.

    1992-01-01

    This paper presents a method for utilizing artificial neural networks for direct adaptive control of dynamic systems with poorly known dynamics. The neural network weights (controller gains) are adapted in real time using state measurements and a random search optimization algorithm. The results are demonstrated via simulation using two highly nonlinear systems.

  18. 3D Nearest Neighbour Search Using a Clustered Hierarchical Tree Structure

    DEFF Research Database (Denmark)

    Suhaibah, A.; Uznir, U.; Antón Castro, Francesc/François

    2016-01-01

    , with the immense number of urban datasets, the retrieval and analysis of nearest neighbour information and their efficiency will become more complex and crucial. In this paper, we present a technique to retrieve nearest neighbour information in 3D space using a clustered hierarchical tree structure. Based on our...

  19. Complexity of stochastic branch and bound for belief tree search in Bayesian reinforcement learning

    NARCIS (Netherlands)

    Dimitrakakis, C.

    2009-01-01

    There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most problems of interest, the optimal solution involves planning in an infinitely large tree. However, it is possible to

  20. Local search methods based on variable focusing for random K -satisfiability

    Science.gov (United States)

    Lemoy, Rémi; Alava, Mikko; Aurell, Erik

    2015-01-01

    We introduce variable focused local search algorithms for satisfiabiliity problems. Usual approaches focus uniformly on unsatisfied clauses. The methods described here work by focusing on random variables in unsatisfied clauses. Variants are considered where variables are selected uniformly and randomly or by introducing a bias towards picking variables participating in several unsatistified clauses. These are studied in the case of the random 3-SAT problem, together with an alternative energy definition, the number of variables in unsatisfied constraints. The variable-based focused Metropolis search (V-FMS) is found to be quite close in performance to the standard clause-based FMS at optimal noise. At infinite noise, instead, the threshold for the linearity of solution times with instance size is improved by picking preferably variables in several UNSAT clauses. Consequences for algorithmic design are discussed.

  1. AMS radiocarbon investigation of the African baobab: Searching for the oldest tree

    Energy Technology Data Exchange (ETDEWEB)

    Patrut, Adrian, E-mail: apatrut@gmail.com [Babes-Bolyai University, Department of Chemistry, Arany Janos 11, 400028 Cluj-Napoca (Romania); Reden, Karl F. von [Woods Hole Oceanographic Institution, Department of Geology and Geophysics, NOSAMS Facility, 360 Woods Hole Rd., Mailstop 8, Woods Hole, MA 02543 (United States); Mayne, Diana H. [Baobab Trust, P.O. Box 1566, Parklands 2121, Johannesburg (South Africa); Lowy, Daniel A. [FlexEl, LLC, 387 Technology Drive, College Park, MD 20742 (United States); Patrut, Roxana T. [Babes-Bolyai University, Department of Biology and Geology, Gh. Bilascu 44, 400015 Cluj-Napoca (Romania)

    2013-01-15

    The Glencoe baobab, a very large specimen from South Africa, split twice in 2009. Several wood samples were collected from the eastern cavity, from the outer part of the main section and also from the largest broken segment which was connected to this section. These wood samples were processed and investigated by AMS radiocarbon dating. The radiocarbon date of the oldest sample was found to be 1838 {+-} 21 BP, which corresponds to a calibrated age of 1835 {+-} 40 years. Thus, the Glencoe baobab becomes the oldest dated baobab and also the oldest angiosperm tree with accurate dating results. The distribution of dating results revealed that the Glencoe baobab is a multi-generation tree, with several standing or collapsed and partially fused stems, showing different ages.

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

  3. Searches for Randomized Controlled Trials of Drugs in MEDLINE and EMBASE Using Only Generic Drug Names Compared with Searches Applied in Current Practice in Systematic Reviews

    Science.gov (United States)

    Waffenschmidt, Siw; Guddat, Charlotte

    2015-01-01

    Background: It is unclear which terms should be included in bibliographic searches for randomized controlled trials (RCTs) of drugs, and identifying relevant drug terms can be extremely laborious. The aim of our analysis was to determine whether a bibliographic search using only the generic drug name produces sufficient results for the generation…

  4. Searching for Survivors through Random Human-Body Movement Outdoors by Continuous-Wave Radar Array.

    Science.gov (United States)

    Li, Chuantao; Chen, Fuming; Qi, Fugui; Liu, Miao; Li, Zhao; Liang, Fulai; Jing, Xijing; Lu, Guohua; Wang, Jianqi

    2016-01-01

    It is a major challenge to search for survivors after chemical or nuclear leakage or explosions. At present, biological radar can be used to achieve this goal by detecting the survivor's respiration signal. However, owing to the random posture of an injured person at a rescue site, the radar wave may directly irradiate the person's head or feet, in which it is difficult to detect the respiration signal. This paper describes a multichannel-based antenna array technology, which forms an omnidirectional detection system via 24-GHz Doppler biological radar, to address the random positioning relative to the antenna of an object to be detected. Furthermore, since the survivors often have random body movement such as struggling and twitching, the slight movements of the body caused by breathing are obscured by these movements. Therefore, a method is proposed to identify random human-body movement by utilizing multichannel information to calculate the background variance of the environment in combination with a constant-false-alarm-rate detector. The conducted outdoor experiments indicate that the system can realize the omnidirectional detection of random human-body movement and distinguish body movement from environmental interference such as movement of leaves and grass. The methods proposed in this paper will be a promising way to search for survivors outdoors.

  5. On the Runtime of Randomized Local Search and Simple Evolutionary Algorithms for Dynamic Makespan Scheduling

    DEFF Research Database (Denmark)

    Neumann, Frank; Witt, Carsten

    2015-01-01

    Evolutionary algorithms have been frequently used for dynamic optimization problems. With this paper, we contribute to the theoretical understanding of this research area. We present the first computational complexity analysis of evolutionary algorithms for a dynamic variant of a classical...... combinatorial optimization problem, namely makespan scheduling. We study the model of a strong adversary which is allowed to change one job at regular intervals. Furthermore, we investigate the setting of random changes. Our results show that randomized local search and a simple evolutionary algorithm are very...... effective in dynamically tracking changes made to the problem instance....

  6. In search of random uncorrelated particle motion (RUM) in a simple random flow field

    CERN Document Server

    Reeks, Michael W; Soldati, Alfredo

    2012-01-01

    DNS studies of dispersed particle motion in isotropic homogeneous turbulence [1] have revealed the existence of a component of random uncorrelated motion (RUM)dependent on the particle inertia {\\tau}p(normalised particle response time or Stoke number). This paper reports the presence of RUM in a simple linear random smoothly varying flow field of counter rotating vortices where the two-particle velocity correlation was measured as a function of spatial separation. Values of the correlation less than one for zero separation indicated the presence of RUM. In terms of Stokes number, the motion of the particles in one direction corresponds to either a heavily damped ({\\tau}p 0.25)harmonic oscillator. In the lightly damped case the particles overshoot the stagnation lines of the flow and are projected from one vortex to another (the so-called sling-shot effect). It is shown that RUM occurs only when {\\tau}p > 0.25, increasing monotonically with increasing Stokes number. Calculations of the particle pair separatio...

  7. Biclustering of gene expression data using reactive greedy randomized adaptive search procedure.

    Science.gov (United States)

    Dharan, Smitha; Nair, Achuthsankar S

    2009-01-30

    Biclustering algorithms belong to a distinct class of clustering algorithms that perform simultaneous clustering of both rows and columns of the gene expression matrix and can be a very useful analysis tool when some genes have multiple functions and experimental conditions are diverse. Cheng and Church have introduced a measure called mean squared residue score to evaluate the quality of a bicluster and has become one of the most popular measures to search for biclusters. In this paper, we review basic concepts of the metaheuristics Greedy Randomized Adaptive Search Procedure (GRASP)-construction and local search phases and propose a new method which is a variant of GRASP called Reactive Greedy Randomized Adaptive Search Procedure (Reactive GRASP) to detect significant biclusters from large microarray datasets. The method has two major steps. First, high quality bicluster seeds are generated by means of k-means clustering. In the second step, these seeds are grown using the Reactive GRASP, in which the basic parameter that defines the restrictiveness of the candidate list is self-adjusted, depending on the quality of the solutions found previously. We performed statistical and biological validations of the biclusters obtained and evaluated the method against the results of basic GRASP and as well as with the classic work of Cheng and Church. The experimental results indicate that the Reactive GRASP approach outperforms the basic GRASP algorithm and Cheng and Church approach. The Reactive GRASP approach for the detection of significant biclusters is robust and does not require calibration efforts.

  8. Multiple random walks on complex networks: A harmonic law predicts search time

    Science.gov (United States)

    Weng, Tongfeng; Zhang, Jie; Small, Michael; Hui, Pan

    2017-05-01

    We investigate multiple random walks traversing independently and concurrently on complex networks and introduce the concept of mean first parallel passage time (MFPPT) to quantify their search efficiency. The mean first parallel passage time represents the expected time required to find a given target by one or some of the multiple walkers. We develop a general theory that allows us to calculate the MFPPT analytically. Interestingly, we find that the global MFPPT follows a harmonic law with respect to the global mean first passage times of the associated walkers. Remarkably, when the properties of multiple walkers are identical, the global MFPPT decays in a power law manner with an exponent of unity, irrespective of network structure. These findings are confirmed by numerical and theoretical results on various synthetic and real networks. The harmonic law reveals a universal principle governing multiple random walks on networks that uncovers the contribution and role of the combined walkers in a target search. Our paradigm is also applicable to a broad range of random search processes.

  9. PARAMETRIC IDENTIFICATION OF STOCHASTIC SYSTEM BY NON-GRADIENT RANDOM SEARCHING

    Directory of Open Access Journals (Sweden)

    A. A. Lobaty

    2017-01-01

    Full Text Available At this moment we know a great variety of identification objects, tasks and methods and its significance is constantly increasing in various fields of science and technology.  The identification problem is dependent on a priori information about identification object, besides that  the existing approaches and methods of identification are determined by the form of mathematical models (deterministic, stochastic, frequency, temporal, spectral etc.. The paper considers a problem for determination of system parameters  (identification object which is assigned by the stochastic mathematical model including random functions of time. It has been shown  that while making optimization of the stochastic systems subject to random actions deterministic methods can be applied only for a limited approximate optimization of the system by taking into account average random effects and fixed structure of the system. The paper proposes an algorithm for identification of  parameters in a mathematical model of  the stochastic system by non-gradient random searching. A specific  feature  of the algorithm is its applicability  practically to mathematic models of any type because the applied algorithm does not depend on linearization and differentiability of functions included in the mathematical model of the system. The proposed algorithm  ensures searching of  an extremum for the specified quality criteria in terms of external uncertainties and limitations while using random searching of parameters for a mathematical model of the system. The paper presents results of the investigations on operational capability of the considered identification method  while using mathematical simulation of hypothetical control system with a priori unknown parameter values of the mathematical model. The presented results of the mathematical simulation obviously demonstrate the operational capability of the proposed identification method.

  10. Learning Dispatching Rules for Scheduling: A Synergistic View Comprising Decision Trees, Tabu Search and Simulation

    Directory of Open Access Journals (Sweden)

    Atif Shahzad

    2016-02-01

    Full Text Available A promising approach for an effective shop scheduling that synergizes the benefits of the combinatorial optimization, supervised learning and discrete-event simulation is presented. Though dispatching rules are in widely used by shop scheduling practitioners, only ordinary performance rules are known; hence, dynamic generation of dispatching rules is desired to make them more effective in changing shop conditions. Meta-heuristics are able to perform quite well and carry more knowledge of the problem domain, however at the cost of prohibitive computational effort in real-time. The primary purpose of this research lies in an offline extraction of this domain knowledge using decision trees to generate simple if-then rules that subsequently act as dispatching rules for scheduling in an online manner. We used similarity index to identify parametric and structural similarity in problem instances in order to implicitly support the learning algorithm for effective rule generation and quality index for relative ranking of the dispatching decisions. Maximum lateness is used as the scheduling objective in a job shop scheduling environment.

  11. Improving search over Electronic Health Records using UMLS-based query expansion through random walks.

    Science.gov (United States)

    Martinez, David; Otegi, Arantxa; Soroa, Aitor; Agirre, Eneko

    2014-10-01

    Most of the information in Electronic Health Records (EHRs) is represented in free textual form. Practitioners searching EHRs need to phrase their queries carefully, as the record might use synonyms or other related words. In this paper we show that an automatic query expansion method based on the Unified Medicine Language System (UMLS) Metathesaurus improves the results of a robust baseline when searching EHRs. The method uses a graph representation of the lexical units, concepts and relations in the UMLS Metathesaurus. It is based on random walks over the graph, which start on the query terms. Random walks are a well-studied discipline in both Web and Knowledge Base datasets. Our experiments over the TREC Medical Record track show improvements in both the 2011 and 2012 datasets over a strong baseline. Our analysis shows that the success of our method is due to the automatic expansion of the query with extra terms, even when they are not directly related in the UMLS Metathesaurus. The terms added in the expansion go beyond simple synonyms, and also add other kinds of topically related terms. Expansion of queries using related terms in the UMLS Metathesaurus beyond synonymy is an effective way to overcome the gap between query and document vocabularies when searching for patient cohorts. Copyright © 2014 Elsevier Inc. All rights reserved.

  12. CALL FOR PAPERS: Special issue on the random search problem: trends and perspectives

    Science.gov (United States)

    da Luz, Marcos G. E.; Grosberg, Alexander Y.; Raposo, Ernesto P.; Viswanathan, Gandhi M.

    2008-11-01

    This is a call for contributions to a special issue of Journal of Physics A: Mathematical and Theoretical dedicated to the subject of the random search problem. The motivation behind this special issue is to summarize in a single comprehensive publication, the main aspects (past and present), latest developments, different viewpoints and the directions being followed in this multidisciplinary field. We hope that such a special issue could become a particularly valuable reference for the broad scientific community working with the general random search problem. The Editorial Board has invited Marcos G E da Luz, Alexander Y Grosberg, Ernesto P Raposo and Gandhi M Viswanathan to serve as Guest Editors for the special issue. The general question of how to optimize the search for specific target objects in either continuous or discrete environments when the information available is limited is of significant importance in a broad range of fields. Representative examples include ecology (animal foraging, dispersion of populations), geology (oil recovery from mature reservoirs), information theory (automated researchers of registers in high-capacity database), molecular biology (proteins searching for their sites, e.g., on DNA ), etc. One reason underlying the richness of the random search problem relates to the `ignorance' of the locations of the randomly located `targets'. A statistical approach to the search problem can deal adequately with incomplete information and so stochastic strategies become advantageous. The general problem of how to search efficiently for randomly located target sites can thus be quantitatively described using the concepts and methods of statistical physics and stochastic processes. Scope Thus far, to the best of our knowledge, no recent textbook or review article in a physics journal has appeared on this topic. This makes a special issue with review and research articles attractive to those interested in acquiring a general introduction to the

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

  14. 3D NEAREST NEIGHBOUR SEARCH USING A CLUSTERED HIERARCHICAL TREE STRUCTURE

    Directory of Open Access Journals (Sweden)

    A. Suhaibah

    2016-06-01

    Full Text Available Locating and analysing the location of new stores or outlets is one of the common issues facing retailers and franchisers. This is due to assure that new opening stores are at their strategic location to attract the highest possible number of customers. Spatial information is used to manage, maintain and analyse these store locations. However, since the business of franchising and chain stores in urban areas runs within high rise multi-level buildings, a three-dimensional (3D method is prominently required in order to locate and identify the surrounding information such as at which level of the franchise unit will be located or is the franchise unit located is at the best level for visibility purposes. One of the common used analyses used for retrieving the surrounding information is Nearest Neighbour (NN analysis. It uses a point location and identifies the surrounding neighbours. However, with the immense number of urban datasets, the retrieval and analysis of nearest neighbour information and their efficiency will become more complex and crucial. In this paper, we present a technique to retrieve nearest neighbour information in 3D space using a clustered hierarchical tree structure. Based on our findings, the proposed approach substantially showed an improvement of response time analysis compared to existing approaches of spatial access methods in databases. The query performance was tested using a dataset consisting of 500,000 point locations building and franchising unit. The results are presented in this paper. Another advantage of this structure is that it also offers a minimal overlap and coverage among nodes which can reduce repetitive data entry.

  15. Optimization of Wind Farm Layout: A Refinement Method by Random Search

    DEFF Research Database (Denmark)

    Feng, Ju; Shen, Wen Zhong

    2013-01-01

    Wind farm layout optimization is to find the optimal positions of wind turbines inside a wind farm, so as to maximize and/or minimize a single objective or multiple objectives, while satisfying certain constraints. Most of the works in the literature divide the wind farm into cells in which...... turbines can be placed, hence, simplifying the problem from with continuous variables to with discrete variables. In this paper, a refinement method, based on continuous formulation, by using random search is proposed to improve the optimization results based on discrete formulations. Two sets...

  16. A Discrete Group Search Optimizer for Hybrid Flowshop Scheduling Problem with Random Breakdown

    Directory of Open Access Journals (Sweden)

    Zhe Cui

    2014-01-01

    Full Text Available The scheduling problems have been discussed in the literature extensively under the assumption that the machines are permanently available without any breakdown. However, in the real manufacturing environments, the machines could be unavailable inevitably for many reasons. In this paper, the authors introduce the hybrid flowshop scheduling problem with random breakdown (RBHFS together with a discrete group search optimizer algorithm (DGSO. In particular, two different working cases, preempt-resume case, and preempt-repeat case are considered under random breakdown. The proposed DGSO algorithm adopts the vector representation and several discrete operators, such as insert, swap, differential evolution, destruction, and construction in the producers, scroungers, and rangers phases. In addition, an orthogonal test is applied to configure the adjustable parameters in the DGSO algorithm. The computational results in both cases indicate that the proposed algorithm significantly improves the performances compared with other high performing algorithms in the literature.

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

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

  19. A best-first soft/hard decision tree searching MIMO decoder for a 4 × 4 64-QAM system

    KAUST Repository

    Shen, Chungan

    2012-08-01

    This paper presents the algorithm and VLSI architecture of a configurable tree-searching approach that combines the features of classical depth-first and breadth-first methods. Based on this approach, techniques to reduce complexity while providing both hard and soft outputs decoding are presented. Furthermore, a single programmable parameter allows the user to tradeoff throughput versus BER performance. The proposed multiple-input-multiple-output decoder supports a 4 × 4 64-QAM system and was synthesized with 65-nm CMOS technology at 333 MHz clock frequency. For the hard output scheme the design can achieve an average throughput of 257.8 Mbps at 24 dB signal-to-noise ratio (SNR) with area equivalent to 54.2 Kgates and a power consumption of 7.26 mW. For the soft output scheme it achieves an average throughput of 83.3 Mbps across the SNR range of interest with an area equivalent to 64 Kgates and a power consumption of 11.5 mW. © 2011 IEEE.

  20. Hybrid geometric-random template-placement algorithm for gravitational wave searches from compact binary coalescences

    Science.gov (United States)

    Roy, Soumen; Sengupta, Anand S.; Thakor, Nilay

    2017-05-01

    Astrophysical compact binary systems consisting of neutron stars and black holes are an important class of gravitational wave (GW) sources for advanced LIGO detectors. Accurate theoretical waveform models from the inspiral, merger, and ringdown phases of such systems are used to filter detector data under the template-based matched-filtering paradigm. An efficient grid over the parameter space at a fixed minimal match has a direct impact on the overall time taken by these searches. We present a new hybrid geometric-random template placement algorithm for signals described by parameters of two masses and one spin magnitude. Such template banks could potentially be used in GW searches from binary neutron stars and neutron star-black hole systems. The template placement is robust and is able to automatically accommodate curvature and boundary effects with no fine-tuning. We also compare these banks against vanilla stochastic template banks and show that while both are equally efficient in the fitting-factor sense, the bank sizes are ˜25 % larger in the stochastic method. Further, we show that the generation of the proposed hybrid banks can be sped up by nearly an order of magnitude over the stochastic bank. Generic issues related to optimal implementation are discussed in detail. These improvements are expected to directly reduce the computational cost of gravitational wave searches.

  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. A comparison of three design tree based search algorithms for the detection of engineering parts constructed with CATIA V5 in large databases

    Directory of Open Access Journals (Sweden)

    Robin Roj

    2014-07-01

    Full Text Available This paper presents three different search engines for the detection of CAD-parts in large databases. The analysis of the contained information is performed by the export of the data that is stored in the structure trees of the CAD-models. A preparation program generates one XML-file for every model, which in addition to including the data of the structure tree, also owns certain physical properties of each part. The first search engine is specializes in the discovery of standard parts, like screws or washers. The second program uses certain user input as search parameters, and therefore has the ability to perform personalized queries. The third one compares one given reference part with all parts in the database, and locates files that are identical, or similar to, the reference part. All approaches run automatically, and have the analysis of the structure tree in common. Files constructed with CATIA V5, and search engines written with Python have been used for the implementation. The paper also includes a short comparison of the advantages and disadvantages of each program, as well as a performance test.

  3. Determination of slope safety factor with analytical solution and searching critical slip surface with genetic-traversal random method.

    Science.gov (United States)

    Niu, Wen-jie

    2014-01-01

    In the current practice, to determine the safety factor of a slope with two-dimensional circular potential failure surface, one of the searching methods for the critical slip surface is Genetic Algorithm (GA), while the method to calculate the slope safety factor is Fellenius' slices method. However GA needs to be validated with more numeric tests, while Fellenius' slices method is just an approximate method like finite element method. This paper proposed a new method to determine the minimum slope safety factor which is the determination of slope safety factor with analytical solution and searching critical slip surface with Genetic-Traversal Random Method. The analytical solution is more accurate than Fellenius' slices method. The Genetic-Traversal Random Method uses random pick to utilize mutation. A computer automatic search program is developed for the Genetic-Traversal Random Method. After comparison with other methods like slope/w software, results indicate that the Genetic-Traversal Random Search Method can give very low safety factor which is about half of the other methods. However the obtained minimum safety factor with Genetic-Traversal Random Search Method is very close to the lower bound solutions of slope safety factor given by the Ansys software.

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

  5. Random Search with Memory in Patchy Media: Exploration-Exploitation Tradeoff

    CERN Document Server

    Chupeau, M; Redner, S

    2016-01-01

    How to best exploit patchy resources? This long-standing question belongs to the extensively studied class of explore/exploit problems that arise in a wide range of situations, from animal foraging, to robotic exploration, and to human decision processes. Despite its broad relevance, the issue of optimal exploitation has previously only been tackled through two paradigmatic limiting models---patch-use and random search---that do not account for the interplay between searcher motion within patches and resource depletion. Here, we bridge this gap by introducing a minimal patch exploitation model that incorporates this coupling: the searcher depletes the resources along its random-walk trajectory within a patch and travels to a new patch after it takes $\\mathcal{S}$ consecutive steps without finding resources. We compute the distribution of the amount of resources $F_t$ consumed by time $t$ for this non-Markovian random walker and show that exploring multiple patches is beneficial. In one dimension, we analytica...

  6. Method of particle trajectory recognition in particle flows of high particle concentration using a candidate trajectory tree process with variable search areas

    Science.gov (United States)

    Shaffer, Franklin D.

    2013-03-12

    The application relates to particle trajectory recognition from a Centroid Population comprised of Centroids having an (x, y, t) or (x, y, f) coordinate. The method is applicable to visualization and measurement of particle flow fields of high particle. In one embodiment, the centroids are generated from particle images recorded on camera frames. The application encompasses digital computer systems and distribution mediums implementing the method disclosed and is particularly applicable to recognizing trajectories of particles in particle flows of high particle concentration. The method accomplishes trajectory recognition by forming Candidate Trajectory Trees and repeated searches at varying Search Velocities, such that initial search areas are set to a minimum size in order to recognize only the slowest, least accelerating particles which produce higher local concentrations. When a trajectory is recognized, the centroids in that trajectory are removed from consideration in future searches.

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

  8. Solving the wind farm layout optimization problem using random search algorithm

    DEFF Research Database (Denmark)

    Feng, Ju; Shen, Wen Zhong

    2015-01-01

    Wind farm (WF) layout optimization is to find the optimal positions of wind turbines (WTs) inside a WF, so as to maximize and/or minimize a single objective or multiple objectives, while satisfying certain constraints. In this work, a random search (RS) algorithm based on continuous formulation...... by expert guesses or other optimization methods, and as an optimization tool to find the optimal layout of WF with a certain number of WTs. A new strategy to evaluate layouts is also used, which can largely save the computation cost. This method is first applied to a widely studied ideal test problem....... In this application, it is also found that in order to get consistent and reliable optimization results, up to 360 or more sectors for wind direction have to be used. Finally, considering the inevitable inter-annual variations in the wind conditions, the robustness of the optimized layouts against wind condition...

  9. Stalking the fourth domain in metagenomic data: searching for, discovering, and interpreting novel, deep branches in marker gene phylogenetic trees.

    Directory of Open Access Journals (Sweden)

    Dongying Wu

    Full Text Available BACKGROUND: Most of our knowledge about the ancient evolutionary history of organisms has been derived from data associated with specific known organisms (i.e., organisms that we can study directly such as plants, metazoans, and culturable microbes. Recently, however, a new source of data for such studies has arrived: DNA sequence data generated directly from environmental samples. Such metagenomic data has enormous potential in a variety of areas including, as we argue here, in studies of very early events in the evolution of gene families and of species. METHODOLOGY/PRINCIPAL FINDINGS: We designed and implemented new methods for analyzing metagenomic data and used them to search the Global Ocean Sampling (GOS expedition data set for novel lineages in three gene families commonly used in phylogenetic studies of known and unknown organisms: small subunit rRNA and the recA and rpoB superfamilies. Though the methods available could not accurately identify very deeply branched ss-rRNAs (largely due to difficulties in making robust sequence alignments for novel rRNA fragments, our analysis revealed the existence of multiple novel branches in the recA and rpoB gene families. Analysis of available sequence data likely from the same genomes as these novel recA and rpoB homologs was then used to further characterize the possible organismal source of the novel sequences. CONCLUSIONS/SIGNIFICANCE: Of the novel recA and rpoB homologs identified in the metagenomic data, some likely come from uncharacterized viruses while others may represent ancient paralogs not yet seen in any cultured organism. A third possibility is that some come from novel cellular lineages that are only distantly related to any organisms for which sequence data is currently available. If there exist any major, but so-far-undiscovered, deeply branching lineages in the tree of life, we suggest that methods such as those described herein currently offer the best way to search for them.

  10. Pure random search for ambient sensor distribution optimisation in a smart home environment.

    Science.gov (United States)

    Poland, Michael P; Nugent, Chris D; Wang, Hui; Chen, Liming

    2011-01-01

    Smart homes are living spaces facilitated with technology to allow individuals to remain in their own homes for longer, rather than be institutionalised. Sensors are the fundamental physical layer with any smart home, as the data they generate is used to inform decision support systems, facilitating appropriate actuator actions. Positioning of sensors is therefore a fundamental characteristic of a smart home. Contemporary smart home sensor distribution is aligned to either a) a total coverage approach; b) a human assessment approach. These methods for sensor arrangement are not data driven strategies, are unempirical and frequently irrational. This Study hypothesised that sensor deployment directed by an optimisation method that utilises inhabitants' spatial frequency data as the search space, would produce more optimal sensor distributions vs. the current method of sensor deployment by engineers. Seven human engineers were tasked to create sensor distributions based on perceived utility for 9 deployment scenarios. A Pure Random Search (PRS) algorithm was then tasked to create matched sensor distributions. The PRS method produced superior distributions in 98.4% of test cases (n=64) against human engineer instructed deployments when the engineers had no access to the spatial frequency data, and in 92.0% of test cases (n=64) when engineers had full access to these data. These results thus confirmed the hypothesis.

  11. A simple heuristic for Internet-based evidence search in primary care: a randomized controlled trial.

    Science.gov (United States)

    Eberbach, Andreas; Becker, Annette; Rochon, Justine; Finkemeler, Holger; Wagner, Achim; Donner-Banzhoff, Norbert

    2016-01-01

    General practitioners (GPs) are confronted with a wide variety of clinical questions, many of which remain unanswered. In order to assist GPs in finding quick, evidence-based answers, we developed a learning program (LP) with a short interactive workshop based on a simple three-step-heuristic to improve their search and appraisal competence (SAC). We evaluated the LP effectiveness with a randomized controlled trial (RCT). Participants (intervention group [IG] n=20; control group [CG] n=31) rated acceptance and satisfaction and also answered 39 knowledge questions to assess their SAC. We controlled for previous knowledge in content areas covered by the test. Main outcome - SAC: within both groups, the pre-post test shows significant (P=0.00) improvements in correctness (IG 15% vs CG 11%) and confidence (32% vs 26%) to find evidence-based answers. However, the SAC difference was not significant in the RCT. Most workshop participants rated "learning atmosphere" (90%), "skills acquired" (90%), and "relevancy to my practice" (86%) as good or very good. The LP-recommendations were implemented by 67% of the IG, whereas 15% of the CG already conformed to LP recommendations spontaneously (odds ratio 9.6, P=0.00). After literature search, the IG showed a (not significantly) higher satisfaction regarding "time spent" (IG 80% vs CG 65%), "quality of information" (65% vs 54%), and "amount of information" (53% vs 47%). Long-standing established GPs have a good SAC. Despite high acceptance, strong learning effects, positive search experience, and significant increase of SAC in the pre-post test, the RCT of our LP showed no significant difference in SAC between IG and CG. However, we suggest that our simple decision heuristic merits further investigation.

  12. Random intermittent search and the tug-of-war model of motor-driven transport

    KAUST Repository

    Newby, Jay

    2010-04-16

    We formulate the \\'tug-of-war\\' model of microtubule cargo transport by multiple molecular motors as an intermittent random search for a hidden target. A motor complex consisting of multiple molecular motors with opposing directional preference is modeled using a discrete Markov process. The motors randomly pull each other off of the microtubule so that the state of the motor complex is determined by the number of bound motors. The tug-of-war model prescribes the state transition rates and corresponding cargo velocities in terms of experimentally measured physical parameters. We add space to the resulting Chapman-Kolmogorov (CK) equation so that we can consider delivery of the cargo to a hidden target at an unknown location along the microtubule track. The target represents some subcellular compartment such as a synapse in a neuron\\'s dendrites, and target delivery is modeled as a simple absorption process. Using a quasi-steady-state (QSS) reduction technique we calculate analytical approximations of the mean first passage time (MFPT) to find the target. We show that there exists an optimal adenosine triphosphate (ATP) concentration that minimizes the MFPT for two different cases: (i) the motor complex is composed of equal numbers of kinesin motors bound to two different microtubules (symmetric tug-of-war model) and (ii) the motor complex is composed of different numbers of kinesin and dynein motors bound to a single microtubule (asymmetric tug-of-war model). © 2010 IOP Publishing Ltd.

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

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

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

  16. A simple heuristic for Internet-based evidence search in primary care: a randomized controlled trial

    Directory of Open Access Journals (Sweden)

    Eberbach A

    2016-08-01

    Full Text Available Andreas Eberbach,1 Annette Becker,1 Justine Rochon,2 Holger Finkemeler,1Achim Wagner,3 Norbert Donner-Banzhoff1 1Department of Family and Community Medicine, Philipp University of Marburg, Marburg, Germany; 2Institute of Medical Biometry and Informatics, University of Heidelberg, Heidelberg, Germany; 3Department of Sport Medicine, Justus-Liebig-University of Giessen, Giessen, Germany Background: General practitioners (GPs are confronted with a wide variety of clinical questions, many of which remain unanswered. Methods: In order to assist GPs in finding quick, evidence-based answers, we developed a learning program (LP with a short interactive workshop based on a simple ­three-step-heuristic to improve their search and appraisal competence (SAC. We evaluated the LP ­effectiveness with a randomized controlled trial (RCT. Participants (intervention group [IG] n=20; ­control group [CG] n=31 rated acceptance and satisfaction and also answered 39 ­knowledge ­questions to assess their SAC. We controlled for previous knowledge in content areas covered by the test. Results: Main outcome – SAC: within both groups, the pre–post test shows significant (P=0.00 improvements in correctness (IG 15% vs CG 11% and confidence (32% vs 26% to find evidence-based answers. However, the SAC difference was not significant in the RCT. Other measures: Most workshop participants rated “learning atmosphere” (90%, “skills acquired” (90%, and “relevancy to my practice” (86% as good or very good. The ­LP-recommendations were implemented by 67% of the IG, whereas 15% of the CG already conformed to LP recommendations spontaneously (odds ratio 9.6, P=0.00. After literature search, the IG showed a (not significantly higher satisfaction regarding “time spent” (IG 80% vs CG 65%, “quality of information” (65% vs 54%, and “amount of information” (53% vs 47%.Conclusion: Long-standing established GPs have a good SAC. Despite high acceptance, strong

  17. Decision making in family medicine: randomized trial of the effects of the InfoClinique and Trip database search engines.

    Science.gov (United States)

    Labrecque, Michel; Ratté, Stéphane; Frémont, Pierre; Cauchon, Michel; Ouellet, Jérôme; Hogg, William; McGowan, Jessie; Gagnon, Marie-Pierre; Njoya, Merlin; Légaré, France

    2013-10-01

    To compare the ability of users of 2 medical search engines, InfoClinique and the Trip database, to provide correct answers to clinical questions and to explore the perceived effects of the tools on the clinical decision-making process. Randomized trial. Three family medicine units of the family medicine program of the Faculty of Medicine at Laval University in Quebec city, Que. Fifteen second-year family medicine residents. Residents generated 30 structured questions about therapy or preventive treatment (2 questions per resident) based on clinical encounters. Using an Internet platform designed for the trial, each resident answered 20 of these questions (their own 2, plus 18 of the questions formulated by other residents, selected randomly) before and after searching for information with 1 of the 2 search engines. For each question, 5 residents were randomly assigned to begin their search with InfoClinique and 5 with the Trip database. The ability of residents to provide correct answers to clinical questions using the search engines, as determined by third-party evaluation. After answering each question, participants completed a questionnaire to assess their perception of the engine's effect on the decision-making process in clinical practice. Of 300 possible pairs of answers (1 answer before and 1 after the initial search), 254 (85%) were produced by 14 residents. Of these, 132 (52%) and 122 (48%) pairs of answers concerned questions that had been assigned an initial search with InfoClinique and the Trip database, respectively. Both engines produced an important and similar absolute increase in the proportion of correct answers after searching (26% to 62% for InfoClinique, for an increase of 36%; 24% to 63% for the Trip database, for an increase of 39%; P = .68). For all 30 clinical questions, at least 1 resident produced the correct answer after searching with either search engine. The mean (SD) time of the initial search for each question was 23.5 (7

  18. Comparing patient characteristics, type of intervention, control, and outcome (PICO) queries with unguided searching: a randomized controlled crossover trial

    NARCIS (Netherlands)

    Hoogendam, A.; Vries Robbé, P.F. de; Overbeke, A.J.P.M.

    2012-01-01

    BACKGROUND: Translating a question into a query using patient characteristics, type of intervention, control, and outcome (PICO) should help answer therapeutic questions in PubMed searches. The authors performed a randomized crossover trial to determine whether the PICO format was useful for quick

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

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

  1. Finding paths in tree graphs with a quantum walk

    Science.gov (United States)

    Koch, Daniel; Hillery, Mark

    2018-01-01

    We analyze the potential for different types of searches using the formalism of scattering random walks on quantum computers. Given a particular type of graph consisting of nodes and connections, a "tree maze," we would like to find a selected final node as quickly as possible, faster than any classical search algorithm. We show that this can be done using a quantum random walk, both through numerical calculations as well as by using the eigenvectors and eigenvalues of the quantum system.

  2. Comparing patient characteristics, type of intervention, control, and outcome (PICO) queries with unguided searching: a randomized controlled crossover trial.

    Science.gov (United States)

    Hoogendam, Arjen; de Vries Robbé, Pieter F; Overbeke, A John P M

    2012-04-01

    Translating a question into a query using patient characteristics, type of intervention, control, and outcome (PICO) should help answer therapeutic questions in PubMed searches. The authors performed a randomized crossover trial to determine whether the PICO format was useful for quick searches of PubMed. Twenty-two residents and specialists working at the Radboud University Nijmegen Medical Centre were trained in formulating PICO queries and then presented with a randomized set of questions derived from Cochrane reviews. They were asked to use the best query possible in a five-minute search, using standard and PICO queries. Recall and precision were calculated for both standard and PICO queries. Twenty-two physicians created 434 queries using both techniques. Average precision was 4.02% for standard queries and 3.44% for PICO queries (difference nonsignificant, t(21) = -0.56, P = 0.58). Average recall was 12.27% for standard queries and 13.62% for PICO queries (difference nonsignificant, t(21) = -0.76, P = 0.46). PICO queries do not result in better recall or precision in time-limited searches. Standard queries containing enough detail are sufficient for quick searches.

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

  4. Searching for answers to clinical questions using google versus evidence-based summary resources: a randomized controlled crossover study.

    Science.gov (United States)

    Kim, Sarang; Noveck, Helaine; Galt, James; Hogshire, Lauren; Willett, Laura; O'Rourke, Kerry

    2014-06-01

    To compare the speed and accuracy of answering clinical questions using Google versus summary resources. In 2011 and 2012, 48 internal medicine interns from two classes at Rutgers University Robert Wood Johnson Medical School, who had been trained to use three evidence-based summary resources, performed four-minute computer searches to answer 10 clinical questions. Half were randomized to initiate searches for answers to questions 1 to 5 using Google; the other half initiated searches using a summary resource. They then crossed over and used the other resource for questions 6 to 10. They documented the time spent searching and the resource where the answer was found. Time to correct response and percentage of correct responses were compared between groups using t test and general estimating equations. Of 480 questions administered, interns found answers for 393 (82%). Interns initiating searches in Google used a wider variety of resources than those starting with summary resources. No significant difference was found in mean time to correct response (138.5 seconds for Google versus 136.1 seconds for summary resource; P = .72). Mean correct response rate was 58.4% for Google versus 61.5% for summary resource (mean difference -3.1%; 95% CI -10.3% to 4.2%; P = .40). The authors found no significant differences in speed or accuracy between searches initiated using Google versus summary resources. Although summary resources are considered to provide the highest quality of evidence, improvements to allow for better speed and accuracy are needed.

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

  6. The Index-Based Subgraph Matching Algorithm (ISMA): Fast Subgraph Enumeration in Large Networks Using Optimized Search Trees

    Science.gov (United States)

    Demeyer, Sofie; Michoel, Tom; Fostier, Jan; Audenaert, Pieter; Pickavet, Mario; Demeester, Piet

    2013-01-01

    Subgraph matching algorithms are designed to find all instances of predefined subgraphs in a large graph or network and play an important role in the discovery and analysis of so-called network motifs, subgraph patterns which occur more often than expected by chance. We present the index-based subgraph matching algorithm (ISMA), a novel tree-based algorithm. ISMA realizes a speedup compared to existing algorithms by carefully selecting the order in which the nodes of a query subgraph are investigated. In order to achieve this, we developed a number of data structures and maximally exploited symmetry characteristics of the subgraph. We compared ISMA to a naive recursive tree-based algorithm and to a number of well-known subgraph matching algorithms. Our algorithm outperforms the other algorithms, especially on large networks and with large query subgraphs. An implementation of ISMA in Java is freely available at http://sourceforge.net/projects/isma/. PMID:23620730

  7. Multi-objective random search algorithm for simultaneously optimizing wind farm layout and number of turbines

    DEFF Research Database (Denmark)

    Feng, Ju; Shen, Wen Zhong; Xu, Chang

    2016-01-01

    the total power production, which is calculated by considering the wake effects using the Jensen wake model combined with the local wind distribution. The other is to minimize the total electrical cable length. This length is assumed to be the total length of the minimal spanning tree that connects all...

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

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

  10. Search Result Clustering via Randomized Partitioning of Query-Induced Subgraphs

    Directory of Open Access Journals (Sweden)

    A. Bradic

    2009-06-01

    Full Text Available In this paper, we present an approach to search result clustering, using partitioning of underlying link graph. We define the notion of "query-induced subgraph" and formulate the problem of search result clustering as a problem of efficient partitioning of a given subgraph into topic-related clusters. Also, we propose a novel algorithm for approximative partitioning of such a graph, which results in a cluster quality comparable to the one obtained by deterministic algorithms, while operating in a more efficient computation time, suitable for practical implementations. Finally, we present a practical clustering search engine developed as a part of this research and use it to get results about real-world performance of proposed concepts.

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

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

  13. Taxon ordering in phylogenetic trees by means of evolutionary algorithms

    Directory of Open Access Journals (Sweden)

    Cerutti Francesco

    2011-07-01

    Full Text Available Abstract Background In in a typical "left-to-right" phylogenetic tree, the vertical order of taxa is meaningless, as only the branch path between them reflects their degree of similarity. To make unresolved trees more informative, here we propose an innovative Evolutionary Algorithm (EA method to search the best graphical representation of unresolved trees, in order to give a biological meaning to the vertical order of taxa. Methods Starting from a West Nile virus phylogenetic tree, in a (1 + 1-EA we evolved it by randomly rotating the internal nodes and selecting the tree with better fitness every generation. The fitness is a sum of genetic distances between the considered taxon and the r (radius next taxa. After having set the radius to the best performance, we evolved the trees with (λ + μ-EAs to study the influence of population on the algorithm. Results The (1 + 1-EA consistently outperformed a random search, and better results were obtained setting the radius to 8. The (λ + μ-EAs performed as well as the (1 + 1, except the larger population (1000 + 1000. Conclusions The trees after the evolution showed an improvement both of the fitness (based on a genetic distance matrix, then close taxa are actually genetically close, and of the biological interpretation. Samples collected in the same state or year moved close each other, making the tree easier to interpret. Biological relationships between samples are also easier to observe.

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

  15. GRASP (Greedy Randomized Adaptive Search Procedures) applied to optimization of petroleum products distribution in pipeline networks; GRASP (Greedy Randomized Adaptative Search Procedures) aplicado ao 'scheduling' de redes de distribuicao de petroleo e derivados

    Energy Technology Data Exchange (ETDEWEB)

    Conte, Viviane Cristhyne Bini; Arruda, Lucia Valeria Ramos de; Yamamoto, Lia [Universidade Tecnologica Federal do Parana (UTFPR), Curitiba, PR (Brazil)

    2008-07-01

    Planning and scheduling of the pipeline network operations aim the most efficient use of the resources resulting in a better performance of the network. A petroleum distribution pipeline network is composed by refineries, sources and/or storage parks, connected by a set of pipelines, which operate the transportation of petroleum and derivatives among adjacent areas. In real scenes, this problem is considered a combinatorial problem, which has difficult solution, which makes necessary methodologies of the resolution that present low computational time. This work aims to get solutions that attempt the demands and minimize the number of batch fragmentations on the sent operations of products for the pipelines in a simplified model of a real network, through by application of the local search metaheuristic GRASP. GRASP does not depend of solutions of previous iterations and works in a random way so it allows the search for the solution in an ampler and diversified search space. GRASP utilization does not demand complex calculation, even the construction stage that requires more computational effort, which provides relative rapidity in the attainment of good solutions. GRASP application on the scheduling of the operations of this network presented feasible solutions in a low computational time. (author)

  16. In Search of Meaning: Are School Rampage Shootings Random and Senseless Violence?

    Science.gov (United States)

    Madfis, Eric

    2017-01-02

    This article discusses Joel Best's ( 1999 ) notion of random violence and applies his concepts of pointlessness, patternlessness, and deterioration to the reality about multiple-victim school shootings gleaned from empirical research about the phenomenon. Best describes how violence is rarely random, as scholarship reveals myriad observable patterns, lots of discernable motives and causes, and often far too much fear-mongering over how bad society is getting and how violent we are becoming. In contrast, it is vital that the media, scholars, and the public better understand crime patterns, criminal motivations, and the causes of fluctuating crime rates. As an effort toward such progress, this article reviews the academic literature on school rampage shootings and explores the extent to which these attacks are and are not random acts of violence.

  17. A parallel buffer tree

    DEFF Research Database (Denmark)

    Sitchinava, Nodar; Zeh, Norbert

    2012-01-01

    We present the parallel buffer tree, a parallel external memory (PEM) data structure for batched search problems. This data structure is a non-trivial extension of Arge's sequential buffer tree to a private-cache multiprocessor environment and reduces the number of I/O operations by the number...... of available processor cores compared to its sequential counterpart, thereby taking full advantage of multicore parallelism. The parallel buffer tree is a search tree data structure that supports the batched parallel processing of a sequence of N insertions, deletions, membership queries, and range queries...

  18. Novel Degree Constrained Minimum Spanning Tree Algorithm Based on an Improved Multicolony Ant Algorithm

    Directory of Open Access Journals (Sweden)

    Xuemei Sun

    2015-01-01

    Full Text Available Degree constrained minimum spanning tree (DCMST refers to constructing a spanning tree of minimum weight in a complete graph with weights on edges while the degree of each node in the spanning tree is no more than d (d ≥ 2. The paper proposes an improved multicolony ant algorithm for degree constrained minimum spanning tree searching which enables independent search for optimal solutions among various colonies and achieving information exchanges between different colonies by information entropy. Local optimal algorithm is introduced to improve constructed spanning tree. Meanwhile, algorithm strategies in dynamic ant, random perturbations ant colony, and max-min ant system are adapted in this paper to optimize the proposed algorithm. Finally, multiple groups of experimental data show the superiority of the improved algorithm in solving the problems of degree constrained minimum spanning tree.

  19. Stochastic foundations in movement ecology anomalous diffusion, front propagation and random searches

    CERN Document Server

    Méndez, Vicenç; Bartumeus, Frederic

    2014-01-01

    This book presents the fundamental theory for non-standard diffusion problems in movement ecology. Lévy processes and anomalous diffusion have shown to be both powerful and useful tools for qualitatively and quantitatively describing a wide variety of spatial population ecological phenomena and dynamics, such as invasion fronts and search strategies. Adopting a self-contained, textbook-style approach, the authors provide the elements of statistical physics and stochastic processes on which the modeling of movement ecology is based and systematically introduce the physical characterization of ecological processes at the microscopic, mesoscopic and macroscopic levels. The explicit definition of these levels and their interrelations is particularly suitable to coping with the broad spectrum of space and time scales involved in bio-ecological problems.   Including numerous exercises (with solutions), this text is aimed at graduate students and newcomers in this field at the interface of theoretical ecology, mat...

  20. Normal and tumoral melanocytes exhibit q-Gaussian random search patterns.

    Directory of Open Access Journals (Sweden)

    Priscila C A da Silva

    Full Text Available In multicellular organisms, cell motility is central in all morphogenetic processes, tissue maintenance, wound healing and immune surveillance. Hence, failures in its regulation potentiates numerous diseases. Here, cell migration assays on plastic 2D surfaces were performed using normal (Melan A and tumoral (B16F10 murine melanocytes in random motility conditions. The trajectories of the centroids of the cell perimeters were tracked through time-lapse microscopy. The statistics of these trajectories was analyzed by building velocity and turn angle distributions, as well as velocity autocorrelations and the scaling of mean-squared displacements. We find that these cells exhibit a crossover from a normal to a super-diffusive motion without angular persistence at long time scales. Moreover, these melanocytes move with non-Gaussian velocity distributions. This major finding indicates that amongst those animal cells supposedly migrating through Lévy walks, some of them can instead perform q-Gaussian walks. Furthermore, our results reveal that B16F10 cells infected by mycoplasmas exhibit essentially the same diffusivity than their healthy counterparts. Finally, a q-Gaussian random walk model was proposed to account for these melanocytic migratory traits. Simulations based on this model correctly describe the crossover to super-diffusivity in the cell migration tracks.

  1. Normal and tumoral melanocytes exhibit q-Gaussian random search patterns.

    Science.gov (United States)

    da Silva, Priscila C A; Rosembach, Tiago V; Santos, Anésia A; Rocha, Márcio S; Martins, Marcelo L

    2014-01-01

    In multicellular organisms, cell motility is central in all morphogenetic processes, tissue maintenance, wound healing and immune surveillance. Hence, failures in its regulation potentiates numerous diseases. Here, cell migration assays on plastic 2D surfaces were performed using normal (Melan A) and tumoral (B16F10) murine melanocytes in random motility conditions. The trajectories of the centroids of the cell perimeters were tracked through time-lapse microscopy. The statistics of these trajectories was analyzed by building velocity and turn angle distributions, as well as velocity autocorrelations and the scaling of mean-squared displacements. We find that these cells exhibit a crossover from a normal to a super-diffusive motion without angular persistence at long time scales. Moreover, these melanocytes move with non-Gaussian velocity distributions. This major finding indicates that amongst those animal cells supposedly migrating through Lévy walks, some of them can instead perform q-Gaussian walks. Furthermore, our results reveal that B16F10 cells infected by mycoplasmas exhibit essentially the same diffusivity than their healthy counterparts. Finally, a q-Gaussian random walk model was proposed to account for these melanocytic migratory traits. Simulations based on this model correctly describe the crossover to super-diffusivity in the cell migration tracks.

  2. Heuristic methods using variable neighborhood random local search for the clustered traveling salesman problem

    Directory of Open Access Journals (Sweden)

    Mário Mestria

    2014-11-01

    Full Text Available In this paper, we propose new heuristic methods for solver the Clustered Traveling Salesman Problem (CTSP. The CTSP is a generalization of the Traveling Salesman Problem (TSP in which the set of vertices is partitioned into disjoint clusters and objective is to find a minimum cost Hamiltonian cycle such that the vertices of each cluster are visited contiguously. We develop two Variable Neighborhood Random Descent with Iterated Local for solver the CTSP. The heuristic methods proposed were tested in types of instances with data at different level of granularity for the number of vertices and clusters. The computational results showed that the heuristic methods outperform recent existing methods in the literature and they are competitive with an exact algorithm using the Parallel CPLEX software.

  3. On random search: Collection kinetics of Paramecia into a trap embedded in a closed domain

    Science.gov (United States)

    Deforet, Maxime; Duplat, Jérôme; Vandenberghe, Nicolas; Villermaux, Emmanuel

    2010-06-01

    We study the kinetics of a large number of organisms initially spread uniformly in a circular two-dimensional medium, at the center of which a smaller circular trap has been introduced. We take advantage of the acidophily of Paramecium caudatum, which, coming from a neutral medium, penetrates a region of moderate acidity but moves back in the opposite situation when it meets a sharp negative acidity gradient to quantify its rate of irreversible aggregation into a spot of acidified medium in water. Two regimes are distinguished: A ballistic regime characteristic of "fresh" paramecia where the organisms swim in a straight path with a well defined velocity and a Brownian regime characteristic of older paramecia where the mean free path of the organisms is smaller than the system size. Both regimes are characterized by distinct aggregation laws. They both result from a pure random trapping process that appears to have no adaptive strategy.

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

  5. A Novel Randomized Search Technique for Multiple Mobile Robot Paths Planning In Repetitive Dynamic Environment

    Directory of Open Access Journals (Sweden)

    Vahid Behravesh

    2012-08-01

    Full Text Available Presented article is studying the issue of path navigating for numerous robots. Our presented approach is based on both priority and the robust method for path finding in repetitive dynamic. Presented model can be generally implementable and useable: We do not assume any restriction regarding the quantity of levels of freedom for robots, and robots of diverse kinds can be applied at the same time. We proposed a random method and hill-climbing technique in the area based on precedence plans, which is used to determine a solution to a given trajectory planning problem and to make less the extent of total track. Our method plans trajectories for particular robots in the setting-time scope. Therefore, in order to specifying the interval of constant objects similar to other robots and the extent of the tracks which is traversed. For measuring the hazard for robots to conflict with each other it applied a method based on probability of the movements of robots. This algorithm applied to real robots with successful results. The proposed method performed and judged on both real robots and in simulation. We performed sequence of100tests with 8 robots for comparing with coordination method and current performances are effective. However, maximizing the performance is still possible. These performances estimations performed on Windows operating system and 3GHz Intel Pentium IV with and compiles with GCC 3.4. We used our PCGA robot for all experiments.  For a large environment of 19×15m2where we accomplished 40tests, our model is competent to plan high-quality paths in a severely short time (less than a second. Moreover, this article utilized lookup tables to keep expenses the formerly navigated robots made, increasing the number of robots don’t expand computation time.

  6. How breast cancer patients want to search for and retrieve information from stories of other patients on the internet: an online randomized controlled experiment.

    Science.gov (United States)

    Overberg, Regina; Otten, Wilma; de Man, Andries; Toussaint, Pieter; Westenbrink, Judith; Zwetsloot-Schonk, Bertie

    2010-03-09

    Other patients' stories on the Internet can give patients information, support, reassurance, and practical advice. We examined which search facility for online stories resulted in patients' satisfaction and search success. This study was a randomized controlled experiment with a 2x2 factorial design conducted online. We facilitated access to 170 stories of breast cancer patients in four ways based on two factors: (1) no versus yes search by story topic, and (2) no versus yes search by writer profile. Dutch speaking women with breast cancer were recruited. Women who gave informed consent were randomly assigned to one of four groups. After searching for stories, women were offered a questionnaire relating to satisfaction with the search facility, the stories retrieved, and impact of the stories on coping with breast cancer. Of 353 enrolled women, 182 (51.6%) completed the questionnaire: control group (n = 37), story topics group (n = 49), writer profile group (n = 51), and combination group (n = 45). Questionnaire completers were evenly distributed over the four groups (chi(2) (3) = 3.7, P = .30). Women who had access to the story topics search facility (yes vs no): were more positive about (mean scores 4.0 vs 3.6, P = .001) and more satisfied with the search facility (mean scores 7.3 vs 6.3, P search options (mean scores 2.3 vs 2.1, P = .04); were better enabled to find desired information (mean scores 3.3 vs 2.8, P = .001); were more likely to recommend the search facility to others or intend to use it themselves (mean scores 4.1 vs 3.5, P search (yes vs no): being more positive about (mean scores 3.9 vs 3.6, P = .005) and more satisfied with the search facility (mean scores 7.1 vs 6.5, P =. 01), and being more positive about how retrieved stories were displayed (mean scores 3.8 vs 2.9, P search facility, an interaction effect was found (P = .03): at least one of the two search facilities was needed for satisfaction. Having access to the story topics search

  7. 基于动态二进制的改进型树型搜索算法%Improved tree search algorithm based on dynamic binary

    Institute of Scientific and Technical Information of China (English)

    杨颖; 戴彬

    2012-01-01

    As the key technology of internet of things, RFID technology have been spread to every field of life and production, and how to improve the anti-collision ability of RFID system and reduce the total recognition time has become an urgent tasks. This paper put forward an improved tree search algorithm based on dynamic binary to simplify instructions which the reader sends and collision detection process, and employs stack save EPC labels which have been received by readers, so that traffic between reader and lable is maximized and the recognition speed of labels is effectively improved. The simulation results show that compared with the conventional deterministic label anti-collision algorithms, the presented algorithm can greatly improve the search performance, especially in the case of greater number of labels, and it has a good application prospect.%RFID技术作为物联网应用的核心关键技术,已经普及到日常生产和生活的各个领域,然而如何提高RFID系统的防冲突能力,减少总识别时间已成为当前急需解决的关键问题.为此,提出了一个基于动态二进制的改进型树型搜索算法.该算法通过简化阅读器发送的指令和冲突检测过程,并利用栈来保存已经被阅读器接收到的标签EPC数据,以便最大化地降低阅读器与标签之间的通信量,从而有效地提高标签的识别速度.仿真结果表明,相比于常规的确定性标签防冲突算法,该算法显著提高了性能,尤其在待识别标签数量较大的情况下,具有良好的应用前景.

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

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

  10. Rectilinear Full Steiner Tree Generation

    DEFF Research Database (Denmark)

    Zachariasen, Martin

    1999-01-01

    The fastest exact algorithm (in practice) for the rectilinear Steiner tree problem in the plane uses a two-phase scheme: First, a small but sufficient set of full Steiner trees (FSTs) is generated and then a Steiner minimum tree is constructed from this set by using simple backtrack search, dynamic...

  11. The TS-Tree

    DEFF Research Database (Denmark)

    Assent, Ira; Krieger, Ralph; Afschari, Farzad

    2008-01-01

    Continuous growth in sensor data and other temporal data increases the importance of retrieval and similarity search in time series data. Efficient time series query processing is crucial for interactive applications. Existing multidimensional indexes like the R-tree provide efficient querying......, the efficiency benefits of indexing are lost. In this paper, we propose the TS-tree (time series tree), an index structure for efficient time series retrieval and similarity search. Exploiting inherent properties of time series quantization and dimensionality reduction, the TS-tree indexes high-dimensional data...... in an overlap-free manner. During query processing, powerful pruning via quantized separator and meta data information greatly reduces the number of pages which have to be accessed, resulting in substantial speed-up. In thorough experiments on synthetic and real world time series data we demonstrate that our TS-tree...

  12. Top Quark Produced Through the Electroweak Force: Discovery Using the Matrix Element Analysis and Search for Heavy Gauge Bosons Using Boosted Decision Trees

    Energy Technology Data Exchange (ETDEWEB)

    Pangilinan, Monica [Brown Univ., Providence, RI (United States)

    2010-05-01

    The top quark produced through the electroweak channel provides a direct measurement of the Vtb element in the CKM matrix which can be viewed as a transition rate of a top quark to a bottom quark. This production channel of top quark is also sensitive to different theories beyond the Standard Model such as heavy charged gauged bosons termed W'. This thesis measures the cross section of the electroweak produced top quark using a technique based on using the matrix elements of the processes under consideration. The technique is applied to 2.3 fb-1 of data from the D0 detector. From a comparison of the matrix element discriminants between data and the signal and background model using Bayesian statistics, we measure the cross section of the top quark produced through the electroweak mechanism σ(p$\\bar{p}$ → tb + X, tqb + X) = 4.30-1.20+0.98 pb. The measured result corresponds to a 4.9σ Gaussian-equivalent significance. By combining this analysis with other analyses based on the Bayesian Neural Network (BNN) and Boosted Decision Tree (BDT) method, the measured cross section is 3.94 ± 0.88 pb with a significance of 5.0σ, resulting in the discovery of electroweak produced top quarks. Using this measured cross section and constraining |Vtb| < 1, the 95% confidence level (C.L.) lower limit is |Vtb| > 0.78. Additionally, a search is made for the production of W' using the same samples from the electroweak produced top quark. An analysis based on the BDT method is used to separate the signal from expected backgrounds. No significant excess is found and 95% C.L. upper limits on the production cross section are set for W' with masses within 600-950 GeV. For four general models of W{prime} boson production using decay channel W' → t$\\bar{p}$, the lower mass limits are the following: M(W'L with SM couplings) > 840 GeV; M(W'R) > 880 GeV or 890 GeV if the

  13. Electronic search strategies to identify reports of cluster randomized trials in MEDLINE: low precision will improve with adherence to reporting standards

    Directory of Open Access Journals (Sweden)

    Grimshaw Jeremy M

    2010-02-01

    Full Text Available Abstract Background Cluster randomized trials (CRTs present unique methodological and ethical challenges. Researchers conducting systematic reviews of CRTs (e.g., addressing methodological or ethical issues require efficient electronic search strategies (filters or hedges to identify trials in electronic databases such as MEDLINE. According to the CONSORT statement extension to CRTs, the clustered design should be clearly identified in titles or abstracts; however, variability in terminology may make electronic identification challenging. Our objectives were to (a evaluate sensitivity ("recall" and precision of a well-known electronic search strategy ("randomized controlled trial" as publication type with respect to identifying CRTs, (b evaluate the feasibility of new search strategies targeted specifically at CRTs, and (c determine whether CRTs are appropriately identified in titles or abstracts of reports and whether there has been improvement over time. Methods We manually examined a wide range of health journals to identify a gold standard set of CRTs. Search strategies were evaluated against the gold standard set, as well as an independent set of CRTs included in previous systematic reviews. Results The existing strategy (randomized controlled trial.pt is sensitive (93.8% for identifying CRTs, but has relatively low precision (9%, number needed to read 11; the number needed to read can be halved to 5 (precision 18.4% by combining with cluster design-related terms using the Boolean operator AND; combining with the Boolean operator OR maximizes sensitivity (99.4% but would require 28.6 citations read to identify one CRT. Only about 50% of CRTs are clearly identified as cluster randomized in titles or abstracts; approximately 25% can be identified based on the reported units of randomization but are not amenable to electronic searching; the remaining 25% cannot be identified except through manual inspection of the full-text article. The

  14. Electronic search strategies to identify reports of cluster randomized trials in MEDLINE: low precision will improve with adherence to reporting standards.

    Science.gov (United States)

    Taljaard, Monica; McGowan, Jessie; Grimshaw, Jeremy M; Brehaut, Jamie C; McRae, Andrew; Eccles, Martin P; Donner, Allan

    2010-02-16

    Cluster randomized trials (CRTs) present unique methodological and ethical challenges. Researchers conducting systematic reviews of CRTs (e.g., addressing methodological or ethical issues) require efficient electronic search strategies (filters or hedges) to identify trials in electronic databases such as MEDLINE. According to the CONSORT statement extension to CRTs, the clustered design should be clearly identified in titles or abstracts; however, variability in terminology may make electronic identification challenging. Our objectives were to (a) evaluate sensitivity ("recall") and precision of a well-known electronic search strategy ("randomized controlled trial" as publication type) with respect to identifying CRTs, (b) evaluate the feasibility of new search strategies targeted specifically at CRTs, and (c) determine whether CRTs are appropriately identified in titles or abstracts of reports and whether there has been improvement over time. We manually examined a wide range of health journals to identify a gold standard set of CRTs. Search strategies were evaluated against the gold standard set, as well as an independent set of CRTs included in previous systematic reviews. The existing strategy (randomized controlled trial.pt) is sensitive (93.8%) for identifying CRTs, but has relatively low precision (9%, number needed to read 11); the number needed to read can be halved to 5 (precision 18.4%) by combining with cluster design-related terms using the Boolean operator AND; combining with the Boolean operator OR maximizes sensitivity (99.4%) but would require 28.6 citations read to identify one CRT. Only about 50% of CRTs are clearly identified as cluster randomized in titles or abstracts; approximately 25% can be identified based on the reported units of randomization but are not amenable to electronic searching; the remaining 25% cannot be identified except through manual inspection of the full-text article. The proportion of trials clearly identified has

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

  16. From Family Trees to Decision Trees.

    Science.gov (United States)

    Trobian, Helen R.

    This paper is a preliminary inquiry by a non-mathematician into graphic methods of sequential planning and ways in which hierarchical analysis and tree structures can be helpful in developing interest in the use of mathematical modeling in the search for creative solutions to real-life problems. Highlights include a discussion of hierarchical…

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

  18. A Family-Based Evolutional Approach for Kernel Tree Selection in SVMs

    Science.gov (United States)

    Methasate, Ithipan; Theeramunkong, Thanaruk

    Finding a kernel mapping function for support vector machines (SVMs) is a key step towards construction of a high-performanced SVM-based classifier. While some recent methods exploited an evolutional approach to construct a suitable multifunction kernel, most of them searched randomly and diversely. In this paper, the concept of a family of identical-structured kernel trees is proposed to enable exploration of structure space using genetic programming whereas to pursue investigation of parameter space on a certain tree using evolution strategy. To control balance between structure and parameter search towards an optimal kernel, simulated annealing is introduced. By experiments on a number of benchmark datasets in the UCI and text classification collection, the proposed method is shown to be able to find a better optimal solution than other search methods, including grid search and gradient search.

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

  20. Tree structure-based bit-to-symbol mapping for multidimensional modulation format

    Science.gov (United States)

    Zhaoxi, Li; Yujuan, Si; Guijun, Hu

    2017-06-01

    Bit-to-symbol mapping is one of the key issues in multidimensional modulation. In an effort to resolve this issue, a tree structure based bit-to-symbol mapping scheme is proposed. By constructing a tree structure of constellation points, any neighboring constellation points become nearest-neighbor constellation points with minimum Euclidean distance, which in turn, changes the bit-to-symbol mapping problem in multidimensional signal modulation from random to orderly. Then, through the orderly distribution of labels, the minimum Hamming distance between the nearest neighboring constellation points is ensured, eventually achieving bit-to-symbol mapping optimization for multidimensional signals. Simulation analysis indicates that, compared with random search mapping, tree mapping can effectively improve the bit error rate performance of multidimensional signal modulation without multiple searching, reducing the computational cost.

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

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

  3. SPRIT: Identifying horizontal gene transfer in rooted phylogenetic trees

    Directory of Open Access Journals (Sweden)

    Fredriksson Robert

    2010-02-01

    Full Text Available Abstract Background Phylogenetic trees based on sequences from a set of taxa can be incongruent due to horizontal gene transfer (HGT. By identifying the HGT events, we can reconcile the gene trees and derive a taxon tree that adequately represents the species' evolutionary history. One HGT can be represented by a rooted Subtree Prune and Regraft (RSPR operation and the number of RSPRs separating two trees corresponds to the minimum number of HGT events. Identifying the minimum number of RSPRs separating two trees is NP-hard, but the problem can be reduced to fixed parameter tractable. A number of heuristic and two exact approaches to identifying the minimum number of RSPRs have been proposed. This is the first implementation delivering an exact solution as well as the intermediate trees connecting the input trees. Results We present the SPR Identification Tool (SPRIT, a novel algorithm that solves the fixed parameter tractable minimum RSPR problem and its GPL licensed Java implementation. The algorithm can be used in two ways, exhaustive search that guarantees the minimum RSPR distance and a heuristic approach that guarantees finding a solution, but not necessarily the minimum one. We benchmarked SPRIT against other software in two different settings, small to medium sized trees i.e. five to one hundred taxa and large trees i.e. thousands of taxa. In the small to medium tree size setting with random artificial incongruence, SPRIT's heuristic mode outperforms the other software by always delivering a solution with a low overestimation of the RSPR distance. In the large tree setting SPRIT compares well to the alternatives when benchmarked on finding a minimum solution within a reasonable time. SPRIT presents both the minimum RSPR distance and the intermediate trees. Conclusions When used in exhaustive search mode, SPRIT identifies the minimum number of RSPRs needed to reconcile two incongruent rooted trees. SPRIT also performs quick approximations

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

  5. Compressed Data Structures for Range Searching

    DEFF Research Database (Denmark)

    Bille, Philip; Gørtz, Inge Li; Vind, Søren Juhl

    2015-01-01

    matrices and web graphs. Our contribution is twofold. First, we show how to compress geometric repetitions that may appear in standard range searching data structures (such as K-D trees, Quad trees, Range trees, R-trees, Priority R-trees, and K-D-B trees), and how to implement subsequent range queries......We study the orthogonal range searching problem on points that have a significant number of geometric repetitions, that is, subsets of points that are identical under translation. Such repetitions occur in scenarios such as image compression, GIS applications and in compactly representing sparse...... that supports range searching....

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

  7. Fragmentation trees reloaded.

    Science.gov (United States)

    Böcker, Sebastian; Dührkop, Kai

    2016-01-01

    Untargeted metabolomics commonly uses liquid chromatography mass spectrometry to measure abundances of metabolites; subsequent tandem mass spectrometry is used to derive information about individual compounds. One of the bottlenecks in this experimental setup is the interpretation of fragmentation spectra to accurately and efficiently identify compounds. Fragmentation trees have become a powerful tool for the interpretation of tandem mass spectrometry data of small molecules. These trees are determined from the data using combinatorial optimization, and aim at explaining the experimental data via fragmentation cascades. Fragmentation tree computation does not require spectral or structural databases. To obtain biochemically meaningful trees, one needs an elaborate optimization function (scoring). We present a new scoring for computing fragmentation trees, transforming the combinatorial optimization into a Maximum A Posteriori estimator. We demonstrate the superiority of the new scoring for two tasks: both for the de novo identification of molecular formulas of unknown compounds, and for searching a database for structurally similar compounds, our method SIRIUS 3, performs significantly better than the previous version of our method, as well as other methods for this task. SIRIUS 3 can be a part of an untargeted metabolomics workflow, allowing researchers to investigate unknowns using automated computational methods.Graphical abstractWe present a new scoring for computing fragmentation trees from tandem mass spectrometry data based on Bayesian statistics. The best scoring fragmentation tree most likely explains the molecular formula of the measured parent ion.

  8. Searches for physics beyond the Standard Model at the Tevatron

    Indian Academy of Sciences (India)

    independent searches. Here we report recent updates of new physics searches. In order to simplify .... The CDF Collaboration searches for RS gravitons in the diphoton and dielectron final ..... The search uses a boosted decision tree discriminant.

  9. Boosted Decision Tree Optimization for the ATLAS search of ttH production in the 2l same-sign channel

    CERN Document Server

    Rojas Huamani, Jairo Martin

    2017-01-01

    The main goal is to have a direct measurement of the Yukawa coupling of the Higgs boson to the top quark which is only possible in the production process → ttH + . In this analysis, final states with 2 same sign leptons (neutrinos not counted) have been used in order to estimate the expected significance of the ttH process. A study using Boosted Decision Trees was done using Monte Carlo simulation equivalent to a luminosity of 36.5 fb-1 at √s=13 TeV, characteristics of the years 2015 and 2016 of Run-2 at LHC. The focus of my summer student program was to investigate the performance of the BDT, mainly: To avoid building of a rigid and possible overtrained BTD (Boosted Decision Tree) in charge of identifying pp→ttH+X process by removing systematically the number of variables used in the analysis. Look the expected sensitivity’s dependence on different parameters that takes in account the BDT.

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

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

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

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

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

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

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

  17. Keyword Search in Databases

    CERN Document Server

    Yu, Jeffrey Xu; Chang, Lijun

    2009-01-01

    It has become highly desirable to provide users with flexible ways to query/search information over databases as simple as keyword search like Google search. This book surveys the recent developments on keyword search over databases, and focuses on finding structural information among objects in a database using a set of keywords. Such structural information to be returned can be either trees or subgraphs representing how the objects, that contain the required keywords, are interconnected in a relational database or in an XML database. The structural keyword search is completely different from

  18. A Proposal of Introducing Clustering Technology to R^*-tree

    OpenAIRE

    Feng, Yaokai; Makinouchi, Akifumi

    2002-01-01

    As a famous member of R-tree family, R^*-tree is widely used in multimedia databases and spatial databases, in which NN (Nearest Neighbor) search is very popular. Based on the observation that the objects are not well-clustered in R^*-tree leaf nodes, this paper proposes an approach to improve NN search performance of R^*-tree by introducing clustering technology to R^*-tree. The experimental result indicates that our improved R^*-tree has much better NN search performance than the original R...

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

  20. A spin transfer torque magnetoresistance random access memory-based high-density and ultralow-power associative memory for fully data-adaptive nearest neighbor search with current-mode similarity evaluation and time-domain minimum searching

    Science.gov (United States)

    Ma, Yitao; Miura, Sadahiko; Honjo, Hiroaki; Ikeda, Shoji; Hanyu, Takahiro; Ohno, Hideo; Endoh, Tetsuo

    2017-04-01

    A high-density nonvolatile associative memory (NV-AM) based on spin transfer torque magnetoresistive random access memory (STT-MRAM), which achieves highly concurrent and ultralow-power nearest neighbor search with full adaptivity of the template data format, has been proposed and fabricated using the 90 nm CMOS/70 nm perpendicular-magnetic-tunnel-junction hybrid process. A truly compact current-mode circuitry is developed to realize flexibly controllable and high-parallel similarity evaluation, which makes the NV-AM adaptable to any dimensionality and component-bit of template data. A compact dual-stage time-domain minimum searching circuit is also developed, which can freely extend the system for more template data by connecting multiple NM-AM cores without additional circuits for integrated processing. Both the embedded STT-MRAM module and the computing circuit modules in this NV-AM chip are synchronously power-gated to completely eliminate standby power and maximally reduce operation power by only activating the currently accessed circuit blocks. The operations of a prototype chip at 40 MHz are demonstrated by measurement. The average operation power is only 130 µW, and the circuit density is less than 11 µm2/bit. Compared with the latest conventional works in both volatile and nonvolatile approaches, more than 31.3% circuit area reductions and 99.2% power improvements are achieved, respectively. Further power performance analyses are discussed, which verify the special superiority of the proposed NV-AM in low-power and large-memory-based VLSIs.

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

  2. Random search for shared chromosomal regions in four affected individuals: the assignment of a new hereditary ataxia locus

    Energy Technology Data Exchange (ETDEWEB)

    Nikali, K.; Suomalainen, A.; Koskinen, T.; Peltonen, L. [Univ. of Helsinki (Finland); Terwilliger, J. [Univ. of Oxford (United Kingdom); Weissenbach, J. [Genethon, Evry (France)

    1995-05-01

    Infantile-onset spinocerebellar ataxia (IOSCA) is an autosomal recessively inherited progressive neurological disorder of unknown etiology. This ataxia, identified so far only in the genetically isolated Finnish population, does not share gene locus with any of the previously identified hereditary ataxias, and a random mapping approach was adopted to assign the IOSCA locus. Based on the assumption of one founder mutation, a primary screening of the genome was performed using samples from just four affected individuals in two consanguineous pedigrees. The identification of a shared chromosomal region in these four patients provided the first evidence that the IOSCA gene locus is on chromosome 10q23.3-q24.1, which was confirmed by conventional linkage analysis in the complete family material. Strong linkage disequilibrium observed between IOSCA and the linked markers was utilized to define accurately the critical chromosomal region. The results showed the power of linkage disequilibrium in the locus assignment of diseases with very limited family materials. 30 refs., 3 figs., 2 tabs.

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

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

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

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

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

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

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

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

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

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

  13. Enhanced tree-classifier performance by inversion with application to pap smear screening data

    Science.gov (United States)

    Chen, E. T. Y.; Lee, James; Nelson, Alan C.

    1993-07-01

    In this paper, we present an inversion method to enhance a binary decision tree classifier using boundary search of training samples. We want to enhance the training at those points which are close to the boundaries. Selection of these points is based on the Euclidean distance from those centroids close to classification boundaries. The enhanced training using these selected data was compared with training using randomly selected samples. We also applied this method to improve the classification of pap smear screening data.

  14. Snapscreen: TV-stream frame search with projectively distorted and noisy query

    Science.gov (United States)

    Skoryukina, Natalya; Chernov, Timofey; Bulatov, Konstantin; Nikolaev, Dmitry P.; Arlazarov, Vladimir

    2017-03-01

    In this work we describe an approach to real-time image search in large databases robust to variety of query distortions such as lighting alterations, projective distortions or digital noise. The approach is based on the extraction of keypoints and their descriptors, random hierarchical clustering trees for preliminary search and RANSAC for refining search and result scoring. The algorithm is implemented in Snapscreen system which allows determining a TV-channel and a TV-show from a picture acquired with mobile device. The implementation is enhanced using preceding localization of screen region. Results for the real-world data with different modifications of the system are presented.

  15. Self-adjusting binary search trees: an investigation of their space and time efficiency in texture analysis of magnetic resonance images using the spatial gray-level dependence method

    Science.gov (United States)

    Svolos, Andreas I.; Todd-Pokropek, Andrew

    1998-06-01

    Texture feature extraction is a fundamental stage in texture analysis. Therefore, the reduction of its computational time and memory requirements should be an aim of continuous research. The Spatial Gray Level Dependence Method (SGLDM) is one of the most significant statistical texture description methods, especially in medical image analysis. However, the co-occurrence matrix is inefficient in terms of time and memory requirements. This is due to its dependency on the number of grey levels in the entire image. Its inefficiency puts up barriers to the wider utilization of the SGLDM in a real application environment. This paper investigates the space and time efficiency of self-adjusting binary search trees, in replacing the co-occurrence matrix. These dynamic data structures store only the significant textural information extracted from an image region by the SGLDM. Furthermore, they have the ability to restructure themselves in order to adapt to the co-occurrence distribution of the grey levels in the analyzed region. This results in a better time performance for texture feature extraction. The proposed approach is applied to a number of magnetic resonance images of the human brain and the human femur. A comparison with the co-occurrence matrix, in terms of space and computational time, is performed.

  16. Using tree diversity to compare phylogenetic heuristics.

    Science.gov (United States)

    Sul, Seung-Jin; Matthews, Suzanne; Williams, Tiffani L

    2009-04-29

    Evolutionary trees are family trees that represent the relationships between a group of organisms. Phylogenetic heuristics are used to search stochastically for the best-scoring trees in tree space. Given that better tree scores are believed to be better approximations of the true phylogeny, traditional evaluation techniques have used tree scores to determine the heuristics that find the best scores in the fastest time. We develop new techniques to evaluate phylogenetic heuristics based on both tree scores and topologies to compare Pauprat and Rec-I-DCM3, two popular Maximum Parsimony search algorithms. Our results show that although Pauprat and Rec-I-DCM3 find the trees with the same best scores, topologically these trees are quite different. Furthermore, the Rec-I-DCM3 trees cluster distinctly from the Pauprat trees. In addition to our heatmap visualizations of using parsimony scores and the Robinson-Foulds distance to compare best-scoring trees found by the two heuristics, we also develop entropy-based methods to show the diversity of the trees found. Overall, Pauprat identifies more diverse trees than Rec-I-DCM3. Overall, our work shows that there is value to comparing heuristics beyond the parsimony scores that they find. Pauprat is a slower heuristic than Rec-I-DCM3. However, our work shows that there is tremendous value in using Pauprat to reconstruct trees-especially since it finds identical scoring but topologically distinct trees. Hence, instead of discounting Pauprat, effort should go in improving its implementation. Ultimately, improved performance measures lead to better phylogenetic heuristics and will result in better approximations of the true evolutionary history of the organisms of interest.

  17. A suffix tree or not a suffix tree?

    DEFF Research Database (Denmark)

    Starikovskaya, Tatiana; Vildhøj, Hjalte Wedel

    2015-01-01

    search. In this paper, we prove that τ is a suffix tree if and only if it is realized by a string S of length n-1, and we give a linear-time algorithm for inferring S when the first letter on each edge is known. This generalizes the work of I et al. (2014) [15]. [All rights reserved Elsevier].......In this paper we study the structure of suffix trees. Given an unlabeled tree τ on n nodes and suffix links of its internal nodes, we ask the question “Is τ a suffix tree?”, i.e., is there a string S whose suffix tree has the same topological structure as τ? We place no restrictions on S......, in particular we do not require that S ends with a unique symbol. This corresponds to considering the more general definition of implicit or extended suffix trees. Such general suffix trees have many applications and are for example needed to allow efficient updates when suffix trees are built online. Deciding...

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

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

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

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

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

  3. A qualitative multi-attribute model for the selection of the private hydropower plant investments in Turkey: By foundation of the search results clustering engine (Carrot2, hydropower plant clustering, DEXi and DEXiTree

    Directory of Open Access Journals (Sweden)

    Burak Omer Saracoglu

    2016-03-01

    Full Text Available Purpose: The electricity demand in Turkey has been increasing for a while. Hydropower is one of the major electricity generation types to compensate this electricity demand in Turkey. Private investors (domestic and foreign in the hydropower electricity generation sector have been looking for the most appropriate and satisfactory new private hydropower investment (PHPI options and opportunities in Turkey. This study aims to present a qualitative multi-attribute decision making (MADM model, that is easy, straightforward, and fast for the selection of the most satisfactory reasonable PHPI options during the very early investment stages (data and information poorness on projects. Design/methodology/approach: The data and information of the PHPI options was gathered from the official records on the official websites. A wide and deep literature review was conducted for the MADM models and for the hydropower industry. The attributes of the model were identified, selected, clustered and evaluated by the expert decision maker (EDM opinion and by help of an open source search results clustering engine (Carrot2 (helpful for also comprehension. The PHPI options were clustered according to their installed capacities main property to analyze the options in the most appropriate, decidable, informative, understandable and meaningful way. A simple clustering algorithm for the PHPI options was executed in the current study. A template model for the selection of the most satisfactory PHPI options was built in the DEXi (Decision EXpert for Education and the DEXiTree software. Findings: The basic attributes for the selection of the PHPI options were presented and afterwards the aggregate attributes were defined by the bottom-up structuring for the early investment stages. The attributes were also analyzed by help of Carrot2. The most satisfactory PHPI options in Turkey in the big options data set were selected for each PHPI options cluster by the EDM evaluations in

  4. Applying ligands profiling using multiple extended electron distribution based field templates and feature trees similarity searching in the discovery of new generation of urea-based antineoplastic kinase inhibitors.

    Directory of Open Access Journals (Sweden)

    Eman M Dokla

    Full Text Available This study provides a comprehensive computational procedure for the discovery of novel urea-based antineoplastic kinase inhibitors while focusing on diversification of both chemotype and selectivity pattern. It presents a systematic structural analysis of the different binding motifs of urea-based kinase inhibitors and the corresponding configurations of the kinase enzymes. The computational model depends on simultaneous application of two protocols. The first protocol applies multiple consecutive validated virtual screening filters including SMARTS, support vector-machine model (ROC = 0.98, Bayesian model (ROC = 0.86 and structure-based pharmacophore filters based on urea-based kinase inhibitors complexes retrieved from literature. This is followed by hits profiling against different extended electron distribution (XED based field templates representing different kinase targets. The second protocol enables cancericidal activity verification by using the algorithm of feature trees (Ftrees similarity searching against NCI database. Being a proof-of-concept study, this combined procedure was experimentally validated by its utilization in developing a novel series of urea-based derivatives of strong anticancer activity. This new series is based on 3-benzylbenzo[d]thiazol-2(3H-one scaffold which has interesting chemical feasibility and wide diversification capability. Antineoplastic activity of this series was assayed in vitro against NCI 60 tumor-cell lines showing very strong inhibition of GI(50 as low as 0.9 uM. Additionally, its mechanism was unleashed using KINEX™ protein kinase microarray-based small molecule inhibitor profiling platform and cell cycle analysis showing a peculiar selectivity pattern against Zap70, c-src, Mink1, csk and MeKK2 kinases. Interestingly, it showed activity on syk kinase confirming the recent studies finding of the high activity of diphenyl urea containing compounds against this kinase. Allover, the new series

  5. Initialization and Restart in Stochastic Local Search: Computing a Most Probable Explanation in Bayesian Networks

    Science.gov (United States)

    Mengshoel, Ole J.; Wilkins, David C.; Roth, Dan

    2010-01-01

    For hard computational problems, stochastic local search has proven to be a competitive approach to finding optimal or approximately optimal problem solutions. Two key research questions for stochastic local search algorithms are: Which algorithms are effective for initialization? When should the search process be restarted? In the present work we investigate these research questions in the context of approximate computation of most probable explanations (MPEs) in Bayesian networks (BNs). We introduce a novel approach, based on the Viterbi algorithm, to explanation initialization in BNs. While the Viterbi algorithm works on sequences and trees, our approach works on BNs with arbitrary topologies. We also give a novel formalization of stochastic local search, with focus on initialization and restart, using probability theory and mixture models. Experimentally, we apply our methods to the problem of MPE computation, using a stochastic local search algorithm known as Stochastic Greedy Search. By carefully optimizing both initialization and restart, we reduce the MPE search time for application BNs by several orders of magnitude compared to using uniform at random initialization without restart. On several BNs from applications, the performance of Stochastic Greedy Search is competitive with clique tree clustering, a state-of-the-art exact algorithm used for MPE computation in BNs.

  6. Using evolutionary tools to search for novel psychoactive plants

    DEFF Research Database (Denmark)

    Halse-Gramkow, Morten; Ernst, Madeleine; Rønsted, Nina

    2016-01-01

    Bioprospecting is the search for valuable products from natural sources. Given that most species are poorly known, a key question is where to search. Ethnodirected bioprospecting approaches use traditional knowledge in the process of selecting plants to screen for desired properties...... and phylogenetic distribution of psychoactive plants. We compiled a database of 501 psychoactive plant species and their properties from published sources. We mapped these plant attributes on a phylogenetic tree of all land plant genera and showed that psychoactive properties are not randomly distributed...... on the phylogeny of land plants; instead certain plant lineages show overabundance of psychoactive properties. Furthermore, employing a "hot nodes" approach to identify these lineages, we can narrow down our search for novel psychoactive plants to 8.5% of all plant genera for psychoactivity in general and 1...

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  6. Anonymity for key-trees with adaptive adversaries

    NARCIS (Netherlands)

    Beye, M.; Veugen, P.J.M.

    2012-01-01

    Hash-lock authentication protocols for Radio Frequency IDentification (RFID) tags incur heavy search on the server. Key-trees have been proposed as a way to reduce search times, but because partial keys in such trees are shared, key compromise affects several tags. Buttyán [4] and Beye and Veugen

  7. Privacy for Key-Trees with Adaptive Adversaries

    NARCIS (Netherlands)

    Beye, M.; Veugen, P.J.M.

    2011-01-01

    Hash-lock authentication protocols for Radio Frequency IDentification (RFID) tags incur heavy search on the server. Key-trees have been proposed as a way to reduce search times, but because partial keys in such trees are shared, key compromise affects several tags. Butty´an [3] and Beye and Veugen

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

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

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

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

  12. Anatomical modeling of the bronchial tree

    Science.gov (United States)

    Hentschel, Gerrit; Klinder, Tobias; Blaffert, Thomas; Bülow, Thomas; Wiemker, Rafael; Lorenz, Cristian

    2010-02-01

    The bronchial tree is of direct clinical importance in the context of respective diseases, such as chronic obstructive pulmonary disease (COPD). It furthermore constitutes a reference structure for object localization in the lungs and it finally provides access to lung tissue in, e.g., bronchoscope based procedures for diagnosis and therapy. This paper presents a comprehensive anatomical model for the bronchial tree, including statistics of position, relative and absolute orientation, length, and radius of 34 bronchial segments, going beyond previously published results. The model has been built from 16 manually annotated CT scans, covering several branching variants. The model is represented as a centerline/tree structure but can also be converted in a surface representation. Possible model applications are either to anatomically label extracted bronchial trees or to improve the tree extraction itself by identifying missing segments or sub-trees, e.g., if located beyond a bronchial stenosis. Bronchial tree labeling is achieved using a naïve Bayesian classifier based on the segment properties contained in the model in combination with tree matching. The tree matching step makes use of branching variations covered by the model. An evaluation of the model has been performed in a leaveone- out manner. In total, 87% of the branches resulting from preceding airway tree segmentation could be correctly labeled. The individualized model enables the detection of missing branches, allowing a targeted search, e.g., a local rerun of the tree-segmentation segmentation.

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

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

  15. VC-dimension of univariate decision trees.

    Science.gov (United States)

    Yildiz, Olcay Taner

    2015-02-01

    In this paper, we give and prove the lower bounds of the Vapnik-Chervonenkis (VC)-dimension of the univariate decision tree hypothesis class. The VC-dimension of the univariate decision tree depends on the VC-dimension values of its subtrees and the number of inputs. Via a search algorithm that calculates the VC-dimension of univariate decision trees exhaustively, we show that our VC-dimension bounds are tight for simple trees. To verify that the VC-dimension bounds are useful, we also use them to get VC-generalization bounds for complexity control using structural risk minimization in decision trees, i.e., pruning. Our simulation results show that structural risk minimization pruning using the VC-dimension bounds finds trees that are more accurate as those pruned using cross validation.

  16. Searching with iterated maps

    Science.gov (United States)

    Elser, V.; Rankenburg, I.; Thibault, P.

    2007-01-01

    In many problems that require extensive searching, the solution can be described as satisfying two competing constraints, where satisfying each independently does not pose a challenge. As an alternative to tree-based and stochastic searching, for these problems we propose using an iterated map built from the projections to the two constraint sets. Algorithms of this kind have been the method of choice in a large variety of signal-processing applications; we show here that the scope of these algorithms is surprisingly broad, with applications as diverse as protein folding and Sudoku. PMID:17202267

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

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

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

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

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

  2. Distance-driven adaptive trees in biological metric spaces: uninformed accretion does not prevent convergence.

    Science.gov (United States)

    Kergosien, Yannick Louis

    2009-12-13

    We present several variants of a stochastic algorithm which all evolve tree-structured sets adapted to the geometry of general target subsets in metric spaces, and we briefly discuss their relevance to biological modelling. In all variants, one repeatedly draws random points from the target (step 1), each time selecting from the tree to be grown the point which is closest to the point just randomly drawn (step 2), then adding to the tree a new point in the vicinity of that closest point (step 3 or accretion step). The algorithms differ in their accretion rule, which can use the position of the target point drawn, or not. The informed case relates to the early behaviour of self-organizing maps that mimic somatotopy. It is simple enough to be studied analytically near its branching points, which generally follow some unsuccessful bifurcations. Further modifying step 2 leads to a fast version of the algorithm that builds oblique binary search trees, and we show how to use it in high-dimensional spaces to address a problem relevant to interventional medical imaging and artificial vision. In the case of an uninformed accretion rule, some adaptation also takes place, the behaviour near branching points is computationally very similar to the informed case, and we discuss its interpretations within the Darwinian paradigm.

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

  4. Barking up the wrong tree: injuries due to falls from trees in Solomon Islands.

    Science.gov (United States)

    Negin, Joel; Vizintin, Pavle; Houasia, Patrick; Martiniuk, Alexandra L C

    2014-12-11

    To investigate tree-related injuries in Solomon Islands by the types of trees involved, who is affected and the types of injuries caused. Descriptive case series of all cases of injuries related to trees presenting to the National Referral Hospital in Honiara from 1994 to 2011. Data were collected by the attending clinician using a Trauma Epidemiology form, which provides information on age, sex, cause of injury and type of fracture. Number of injuries by tree type, sex and age. Of the 7651 injuries in the database, 1107 (14%) were caused by falls from trees. Falls from coconut trees led to the highest number of injuries, followed by falls from mango, guava, apple and nut trees. Overall, 85% of injuries occurred in individuals aged trees, 77% of patients were aged tree types. Overall, 71% of injuries occurred among males. Of all injuries, 92% were fractures, 3% were dislocations and 5% were non-fracture, non-dislocation injuries. The arm (including wrist, elbow and hand) was the most common location of injury across all tree types. Distal radius fractures in the forearm were particularly common, as were ulna fractures. While mangos and guavas are undeniably delicious, the quest for their flesh can be hazardous. Children will always climb trees, but the search for food among children in lower-income settings may lead to higher rates of injury.

  5. Search Patterns

    CERN Document Server

    Morville, Peter

    2010-01-01

    What people are saying about Search Patterns "Search Patterns is a delight to read -- very thoughtful and thought provoking. It's the most comprehensive survey of designing effective search experiences I've seen." --Irene Au, Director of User Experience, Google "I love this book! Thanks to Peter and Jeffery, I now know that search (yes, boring old yucky who cares search) is one of the coolest ways around of looking at the world." --Dan Roam, author, The Back of the Napkin (Portfolio Hardcover) "Search Patterns is a playful guide to the practical concerns of search interface design. It cont

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

  7. Fast Structural Search in Phylogenetic Databases

    Directory of Open Access Journals (Sweden)

    William H. Piel

    2005-01-01

    Full Text Available As the size of phylogenetic databases grows, the need for efficiently searching these databases arises. Thanks to previous and ongoing research, searching by attribute value and by text has become commonplace in these databases. However, searching by topological or physical structure, especially for large databases and especially for approximate matches, is still an art. We propose structural search techniques that, given a query or pattern tree P and a database of phylogenies D, find trees in D that are sufficiently close to P . The “closeness” is a measure of the topological relationships in P that are found to be the same or similar in a tree D in D. We develop a filtering technique that accelerates searches and present algorithms for rooted and unrooted trees where the trees can be weighted or unweighted. Experimental results on comparing the similarity measure with existing tree metrics and on evaluating the efficiency of the search techniques demonstrate that the proposed approach is promising

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

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

  10. Algorithms for optimal dyadic decision trees

    Energy Technology Data Exchange (ETDEWEB)

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

    2009-01-01

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

  11. Personalized Search

    CERN Document Server

    AUTHOR|(SzGeCERN)749939

    2015-01-01

    As the volume of electronically available information grows, relevant items become harder to find. This work presents an approach to personalizing search results in scientific publication databases. This work focuses on re-ranking search results from existing search engines like Solr or ElasticSearch. This work also includes the development of Obelix, a new recommendation system used to re-rank search results. The project was proposed and performed at CERN, using the scientific publications available on the CERN Document Server (CDS). This work experiments with re-ranking using offline and online evaluation of users and documents in CDS. The experiments conclude that the personalized search result outperform both latest first and word similarity in terms of click position in the search result for global search in CDS.

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

  13. Visual search

    NARCIS (Netherlands)

    Toet, A.; Bijl, P.

    2003-01-01

    Visual search, with or without the aid of optical or electro-optical instruments, plays a significant role in various types of military and civilian operations (e.g., reconnaissance, surveillance, and search and rescue). Advance knowledge of human visual search and target acquisition performance is

  14. Controlling the weights of simulation particles: adaptive particle management using k-d trees

    Science.gov (United States)

    Teunissen, Jannis; Ebert, Ute

    2014-02-01

    In particle simulations, the weights of particles determine how many physical particles they represent. Adaptively adjusting these weights can greatly improve the efficiency of the simulation, without creating severe nonphysical artifacts. We present a new method for the pairwise merging of particles, in which two particles are combined into one. To find particles that are ‘close' to each other, we use a k-d tree data structure. With a k-d tree, close neighbors can be searched for efficiently, and independently of the mesh used in the simulation. The merging can be done in different ways, conserving for example momentum or energy. We introduce probabilistic schemes, which set properties for the merged particle using random numbers. The effect of various merge schemes on the energy distribution, the momentum distribution and the grid moments is compared. We also compare their performance in the simulation of the two-stream instability.

  15. A hybrid search algorithm for swarm robots searching in an unknown environment.

    Science.gov (United States)

    Li, Shoutao; Li, Lina; Lee, Gordon; Zhang, Hao

    2014-01-01

    This paper proposes a novel method to improve the efficiency of a swarm of robots searching in an unknown environment. The approach focuses on the process of feeding and individual coordination characteristics inspired by the foraging behavior in nature. A predatory strategy was used for searching; hence, this hybrid approach integrated a random search technique with a dynamic particle swarm optimization (DPSO) search algorithm. If a search robot could not find any target information, it used a random search algorithm for a global search. If the robot found any target information in a region, the DPSO search algorithm was used for a local search. This particle swarm optimization search algorithm is dynamic as all the parameters in the algorithm are refreshed synchronously through a communication mechanism until the robots find the target position, after which, the robots fall back to a random searching mode. Thus, in this searching strategy, the robots alternated between two searching algorithms until the whole area was covered. During the searching process, the robots used a local communication mechanism to share map information and DPSO parameters to reduce the communication burden and overcome hardware limitations. If the search area is very large, search efficiency may be greatly reduced if only one robot searches an entire region given the limited resources available and time constraints. In this research we divided the entire search area into several subregions, selected a target utility function to determine which subregion should be initially searched and thereby reduced the residence time of the target to improve search efficiency.

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

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

  18. Species tree inference by minimizing deep coalescences.

    Directory of Open Access Journals (Sweden)

    Cuong Than

    2009-09-01

    Full Text Available In a 1997 seminal paper, W. Maddison proposed minimizing deep coalescences, or MDC, as an optimization criterion for inferring the species tree from a set of incongruent gene trees, assuming the incongruence is exclusively due to lineage sorting. In a subsequent paper, Maddison and Knowles provided and implemented a search heuristic for optimizing the MDC criterion, given a set of gene trees. However, the heuristic is not guaranteed to compute optimal solutions, and its hill-climbing search makes it slow in practice. In this paper, we provide two exact solutions to the problem of inferring the species tree from a set of gene trees under the MDC criterion. In other words, our solutions are guaranteed to find the tree that minimizes the total number of deep coalescences from a set of gene trees. One solution is based on a novel integer linear programming (ILP formulation, and another is based on a simple dynamic programming (DP approach. Powerful ILP solvers, such as CPLEX, make the first solution appealing, particularly for very large-scale instances of the problem, whereas the DP-based solution eliminates dependence on proprietary tools, and its simplicity makes it easy to integrate with other genomic events that may cause gene tree incongruence. Using the exact solutions, we analyze a data set of 106 loci from eight yeast species, a data set of 268 loci from eight Apicomplexan species, and several simulated data sets. We show that the MDC criterion provides very accurate estimates of the species tree topologies, and that our solutions are very fast, thus allowing for the accurate analysis of genome-scale data sets. Further, the efficiency of the solutions allow for quick exploration of sub-optimal solutions, which is important for a parsimony-based criterion such as MDC, as we show. We show that searching for the species tree in the compatibility graph of the clusters induced by the gene trees may be sufficient in practice, a finding that helps

  19. Learning Type Extension Trees for Metal Bonding State Prediction

    DEFF Research Database (Denmark)

    Frasconi, Paolo; Jaeger, Manfred; Passerini, Andrea

    2008-01-01

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

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

  1. Verification of Snapshotable Trees using Access Permissions and Typestate

    DEFF Research Database (Denmark)

    Mehnert, Hannes; Aldrich, Jonathan

    2012-01-01

    We use access permissions and typestate to specify and ver- ify a Java library that implements snapshotable search trees, as well as some client code. We formalize our approach in the Plural tool, a sound modular typestate checking tool. We describe the challenges to verify- ing snapshotable trees...

  2. Formalized Verification of Snapshotable Trees: Separation and Sharing

    DEFF Research Database (Denmark)

    Mehnert, Hannes; Sieczkowski, Filip; Birkedal, Lars

    2012-01-01

    We use separation logic to specify and verify a Java program that implements snapshotable search trees, fully formalizing the speci- cation and verication in the Coq proof assistant. We achieve local and modular reasoning about a tree and its snapshots and their iterators, al- though...

  3. Worst-Case Efficient Range Searching

    DEFF Research Database (Denmark)

    Arge, Lars Allan

    2009-01-01

    In this tutorial we will describe some of the recent advances in the development of worst-case efficient range search indexing structures, that is, structures for storing a set of data points such that the points in a axis-parallel (hyper-) query rectangle can be found efficiently (with as few disk...... discuss the external priority search tree [8], which solves a restricted version of the two-dimensional version of the problem where the query rectangle is unbounded on one side. This structure is then used in a range tree index structure [8, 21] that answers general two-dimensional queries in the same......, 17], as well as recent index structures for higher-dimensional range search indexing [1]. We end by mentioning various R-tree variant [7, 18, 15] that can be used to solve the extended version of range search indexing where the queries as well as the data are (hyper-) rectangles. More comprehensive...

  4. Varied Search Protocols Lead to Clinically Relevant Results. A review of: Patel, Manesh R., Connie M. Schardt, Linda L. Sanders, and Sheri A. Keitz. “Randomized Trial for Answers to Clinical Questions: Evaluating a Pre‐Appraised Versus a MEDLINE Search Protocol.” Journal of the Medical Library Association 94.4 (2006: 382‐6.

    Directory of Open Access Journals (Sweden)

    Marcy L. Brown

    2008-03-01

    Full Text Available Objective – To determine the success rate of electronic resources for answering clinical questions by comparing speed, validity, and applicability of two different protocols for searching the medical literature.Design – Randomized trial with results judged by blinded panel.Setting – Duke University Medical Center in Durham, North Carolina, United States ofAmerica.Subjects – Thirty‐two 2nd and 3rd year internal medicine residents on an eight week general medicine rotation at the Duke University Medical Center.Methods – Two search protocols were developed:Protocol A: Participants searched MEDLINE first, and then searched pre‐appraised resources if needed.Protocol B: Participants searched pre‐appraised resources first, which included UpToDate, ACP JournalClub, Cochrane Database of Systematic Reviews, and DARE. The residents then searched MEDLINE if an answer could not be found in the 66 initial group of pre‐appraised resources. Residents were randomised by computer-assisted block order into four blocks of eight residents each. Two blocks were assigned to Protocol A, and two to Protocol B. Each day, residents developed at least one clinical question related to caring for patients. The questions were transcribed onto pocket-sized cards, with the answer sought later using the assigned protocol. If answers weren’t found using either protocol, searches were permitted in other available resources. When an article that answered a question was found, the resident recorded basic information about the question and the answer as well as the time required to find the answer (less than five minutes; between five and ten minutes; or more than ten minutes. Residents were to select answers that were “methodologically sound and clinically important” (384. Ten faculty members formally trained in evidence‐based medicine (EBM reviewed a subset of therapy‐related questions and answers. The reviewers, who were blinded to the search protocols

  5. Local Path Planning of Driverless Car Navigation Based on Jump Point Search Method Under Urban Environment

    Directory of Open Access Journals (Sweden)

    Kaijun Zhou

    2017-09-01

    Full Text Available The Jump Point Search (JPS algorithm is adopted for local path planning of the driverless car under urban environment, and it is a fast search method applied in path planning. Firstly, a vector Geographic Information System (GIS map, including Global Positioning System (GPS position, direction, and lane information, is built for global path planning. Secondly, the GIS map database is utilized in global path planning for the driverless car. Then, the JPS algorithm is adopted to avoid the front obstacle, and to find an optimal local path for the driverless car in the urban environment. Finally, 125 different simulation experiments in the urban environment demonstrate that JPS can search out the optimal and safety path successfully, and meanwhile, it has a lower time complexity compared with the Vector Field Histogram (VFH, the Rapidly Exploring Random Tree (RRT, A*, and the Probabilistic Roadmaps (PRM algorithms. Furthermore, JPS is validated usefully in the structured urban environment.

  6. The efficiency of different search strategies in estimating parsimony jackknife, bootstrap, and Bremer support

    Directory of Open Access Journals (Sweden)

    Müller Kai F

    2005-10-01

    Full Text Available Abstract Background For parsimony analyses, the most common way to estimate confidence is by resampling plans (nonparametric bootstrap, jackknife, and Bremer support (Decay indices. The recent literature reveals that parameter settings that are quite commonly employed are not those that are recommended by theoretical considerations and by previous empirical studies. The optimal search strategy to be applied during resampling was previously addressed solely via standard search strategies available in PAUP*. The question of a compromise between search extensiveness and improved support accuracy for Bremer support received even less attention. A set of experiments was conducted on different datasets to find an empirical cut-off point at which increased search extensiveness does not significantly change Bremer support and jackknife or bootstrap proportions any more. Results For the number of replicates needed for accurate estimates of support in resampling plans, a diagram is provided that helps to address the question whether apparently different support values really differ significantly. It is shown that the use of random addition cycles and parsimony ratchet iterations during bootstrapping does not translate into higher support, nor does any extension of the search extensiveness beyond the rather moderate effort of TBR (tree bisection and reconnection branch swapping plus saving one tree per replicate. Instead, in case of very large matrices, saving more than one shortest tree per iteration and using a strict consensus tree of these yields decreased support compared to saving only one tree. This can be interpreted as a small risk of overestimating support but should be more than compensated by other factors that counteract an enhanced type I error. With regard to Bremer support, a rule of thumb can be derived stating that not much is gained relative to the surplus computational effort when searches are extended beyond 20 ratchet iterations per

  7. Audio stream classification for multimedia database search

    Science.gov (United States)

    Artese, M.; Bianco, S.; Gagliardi, I.; Gasparini, F.

    2013-03-01

    Search and retrieval of huge archives of Multimedia data is a challenging task. A classification step is often used to reduce the number of entries on which to perform the subsequent search. In particular, when new entries of the database are continuously added, a fast classification based on simple threshold evaluation is desirable. In this work we present a CART-based (Classification And Regression Tree [1]) classification framework for audio streams belonging to multimedia databases. The database considered is the Archive of Ethnography and Social History (AESS) [2], which is mainly composed of popular songs and other audio records describing the popular traditions handed down generation by generation, such as traditional fairs, and customs. The peculiarities of this database are that it is continuously updated; the audio recordings are acquired in unconstrained environment; and for the non-expert human user is difficult to create the ground truth labels. In our experiments, half of all the available audio files have been randomly extracted and used as training set. The remaining ones have been used as test set. The classifier has been trained to distinguish among three different classes: speech, music, and song. All the audio files in the dataset have been previously manually labeled into the three classes above defined by domain experts.

  8. An Efficient Trajectory Data Index Integrating R-tree, Hash and B*-tree

    Directory of Open Access Journals (Sweden)

    GONG Jun

    2015-05-01

    Full Text Available To take into account all of efficiency and query capability, this paper presents a new trajectory data index named HBSTR-tree. In HBSTR-tree, trajectory sample points are collectively stored into trajectory nodes sequentially. Hash table is adopted to index the most recent trajectory nodes of mobile targets, and trajectory nodes will not be inserted into spatio-temporal R-tree until full, which can enhance generation performance in this way. Meantime, one-dimensional index of trajectory nodes in the form of B*-tree is built. Therefore, HBSTR-tree can satisfy both spatio-temporal query and target trajectory query. In order to improve search efficiency, a new criterion for spatio-temporal R-tree and one new node-selection sub-algorithm are put forward, which further optimize insertion algorithm of spatio-temporal R-tree. Furthermore, a database storage scheme for spatio-temporal R-tree is also brought up. Experimental results prove that HBSTR-tree outperforms current methods in several aspects such as generation efficiency, query performance and supported query types, and then supports real-time updates and efficient accesses of huge trajectory database.

  9. Top-k Keyword Search Over Graphs Based On Backward Search

    Directory of Open Access Journals (Sweden)

    Zeng Jia-Hui

    2017-01-01

    Full Text Available Keyword search is one of the most friendly and intuitive information retrieval methods. Using the keyword search to get the connected subgraph has a lot of application in the graph-based cognitive computation, and it is a basic technology. This paper focuses on the top-k keyword searching over graphs. We implemented a keyword search algorithm which applies the backward search idea. The algorithm locates the keyword vertices firstly, and then applies backward search to find rooted trees that contain query keywords. The experiment shows that query time is affected by the iteration number of the algorithm.

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

    CERN Document Server

    Tunkelang, Daniel

    2009-01-01

    We live in an information age that requires us, more than ever, to represent, access, and use information. Over the last several decades, we have developed a modern science and technology for information retrieval, relentlessly pursuing the vision of a "memex" that Vannevar Bush proposed in his seminal article, "As We May Think." Faceted search plays a key role in this program. Faceted search addresses weaknesses of conventional search approaches and has emerged as a foundation for interactive information retrieval. User studies demonstrate that faceted search provides more

  12. Airway Tree Extraction with Locally Optimal Paths

    DEFF Research Database (Denmark)

    Lo, Pechin Chien Pau; Sporring, Jon; Pedersen, Jesper Johannes Holst

    2009-01-01

    This paper proposes a method to extract the airway tree from CT images by continually extending the tree with locally optimal paths. This is in contrast to commonly used region growing based approaches that only search the space of the immediate neighbors. The result is a much more robust method...... for tree extraction that can overcome local occlusions. The cost function for obtaining the optimal paths takes into account of an airway probability map as well as measures of airway shape and orientation derived from multi-scale Hessian eigen analysis on the airway probability. Significant improvements...... were achieved compared to a region growing based method, with up to 36% longer trees at a slight increase of false positive rate....

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

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

  15. New Methods and Tools for the World Wide Web Search

    OpenAIRE

    Ceric, Vlatko

    2000-01-01

    Explosive growth of the World Wide Web as well as its heterogeneity call for powerful and easy to use search tools capable to provide the user with a moderate number of relevant answers. This paper presents analysis of key aspects of recently developed Web search methods and tools: visual representation of subject trees, interactive user interfaces, linguistic approaches, image search, ranking and grouping of search results, database search, and scientific information retrieval. Current trend...

  16. Full Elastic Waveform Search Engine for Near Surface Imaging

    Science.gov (United States)

    Zhang, J.; Zhang, X.

    2014-12-01

    For processing land seismic data, the near-surface problem is often very complex and may severely affect our capability to image the subsurface. The current state-of-the-art technology for near surface imaging is the early arrival waveform inversion that solves an acoustic wave-equation problem. However, fitting land seismic data with acoustic wavefield is sometimes invalid. On the other hand, performing elastic waveform inversion is very time-consuming. Similar to a web search engine, we develop a full elastic waveform search engine that includes a large database with synthetic elastic waveforms accounting for a wide range of interval velocity models in the CMP domain. With each CMP gather of real data as an entry, the search engine applies Multiple-Randomized K-Dimensional (MRKD) tree method to find approximate best matches to the entry in about a second. Interpolation of the velocity models at CMP positions creates 2D or 3D Vp, Vs, and density models for the near surface area. The method does not just return one solution; it gives a series of best matches in a solution space. Therefore, the results can help us to examine the resolution and nonuniqueness of the final solution. Further, this full waveform search method can avoid the issues of initial model and cycle skipping that the method of full waveform inversion is difficult to deal with.

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

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

  19. Advanced Search

    African Journals Online (AJOL)

    Items 151 - 200 of 500 ... Search tips: Search terms are case-insensitive; Common words are ignored; By default only articles containing all terms in the query are returned (i.e., AND is implied); Combine multiple words with OR to find articles containing either term; e.g., education OR research; Use parentheses to create more ...

  20. Search Results

    African Journals Online (AJOL)

    Search tips: Search terms are case-insensitive; Common words are ignored; By default only articles containing all terms in the query are returned (i.e., AND is implied); Combine multiple words with OR to find articles containing either term; e.g., education OR research; Use parentheses to create more complex queries; e.g., ...

  1. Advanced Search

    African Journals Online (AJOL)

    Search tips: Search terms are case-insensitive; Common words are ignored; By default only articles containing all terms in the query are returned (i.e., AND is implied); Combine multiple words with OR to find articles containing either term; e.g., education OR research; Use parentheses to create more complex queries; e.g., ...

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

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

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

  6. Increasing the quantity and quality of searching for current best evidence to answer clinical questions: protocol and intervention design of the MacPLUS FS Factorial Randomized Controlled Trials.

    Science.gov (United States)

    Agoritsas, Thomas; Iserman, Emma; Hobson, Nicholas; Cohen, Natasha; Cohen, Adam; Roshanov, Pavel S; Perez, Miguel; Cotoi, Chris; Parrish, Rick; Pullenayegum, Eleanor; Wilczynski, Nancy L; Iorio, Alfonso; Haynes, R Brian

    2014-09-20

    Finding current best evidence for clinical decisions remains challenging. With 3,000 new studies published every day, no single evidence-based resource provides all answers or is sufficiently updated. McMaster Premium LiteratUre Service--Federated Search (MacPLUS FS) addresses this issue by looking in multiple high quality resources simultaneously and displaying results in a one-page pyramid with the most clinically useful at the top. Yet, additional logistical and educational barriers need to be addressed to enhance point-of-care evidence retrieval. This trial seeks to test three innovative interventions, among clinicians registered to MacPLUS FS, to increase the quantity and quality of searching for current best evidence to answer clinical questions. In a user-centered approach, we designed three interventions embedded in MacPLUS FS: (A) a web-based Clinical Question Recorder; (B) an Evidence Retrieval Coach composed of eight short educational videos; (C) an Audit, Feedback and Gamification approach to evidence retrieval, based on the allocation of 'badges' and 'reputation scores.' We will conduct a randomized factorial controlled trial among all the 904 eligible medical doctors currently registered to MacPLUS FS at the hospitals affiliated with McMaster University, Canada. Postgraduate trainees (n=429) and clinical faculty/staff (n=475) will be randomized to each of the three following interventions in a factorial design (AxBxC). Utilization will be continuously recorded through clinicians’ accounts that track logins and usage, down to the level of individual keystrokes. The primary outcome is the rate of searches per month per user during the six months of follow-up. Secondary outcomes, measured through the validated Impact Assessment Method questionnaire, include: utility of answers found (meeting clinicians’ information needs), use (application in practice), and perceived usefulness on patient outcomes. Built on effective models for the point

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

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

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

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

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

  12. DEVELOPMENT OF A MANAGEMENT SYSTEM OF ROADSIDE TREES USING RFID AND ONTOLOGY

    Science.gov (United States)

    Yabuki, Nobuyoshi; Kikushige, Yuki; Fukuda, Tomohiro; Ebashi, Yumeka

    It is necessary to make scientific and systematic diagnosis for roadside trees, which are essential for comfortable urban environment, in order to keep them in healthy conditions because they may not be planted adequately. Therefore, in this research, a Roadside Tree Diagnosis Support System (RTDSS) was developed using Radio Frequency IDentification (RFID) and Personal Digital Assistants (PDA) to facilitate diagnosis based on the Visual Tree Assessment (VTA) method. The system was used on a trial basis to real roadside trees by tree surgeons and was highly evaluated. Since governmental or municipal agencies, which develop and maintain the databases of roadside trees, tend to use different terminologies, units and tree registration systems, it is difficult to compare or combine two or more roadside tree databases. Thus, the ontology of roadside tree management was developed to compare and analyze various roadside tree databases. Two different databases were developed and testing of the developed ontology system successfully showed proper searching result over different terminologies.

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

    Science.gov (United States)

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

    2017-09-30

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

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

  15. How eco-evolutionary principles can guide tree breeding and tree biotechnology for enhanced productivity.

    Science.gov (United States)

    Franklin, Oskar; Palmroth, Sari; Näsholm, Torgny

    2014-11-01

    Tree breeding and biotechnology can enhance forest productivity and help alleviate the rising pressure on forests from climate change and human exploitation. While many physiological processes and genes are targeted in search of genetically improved tree productivity, an overarching principle to guide this search is missing. Here, we propose a method to identify the traits that can be modified to enhance productivity, based on the differences between trees shaped by natural selection and 'improved' trees with traits optimized for productivity. We developed a tractable model of plant growth and survival to explore such potential modifications under a range of environmental conditions, from non-water limited to severely drought-limited sites. We show how key traits are controlled by a trade-off between productivity and survival, and that productivity can be increased at the expense of long-term survival by reducing isohydric behavior (stomatal regulation of leaf water potential) and allocation to defense against pests compared with native trees. In contrast, at dry sites occupied by naturally drought-resistant trees, the model suggests a better strategy may be to select trees with slightly lower wood density than the native trees and to augment isohydric behavior and allocation to defense. Thus, which traits to modify, and in which direction, depend on the original tree species or genotype, the growth environment and wood-quality versus volume production preferences. In contrast to this need for customization of drought and pest resistances, consistent large gains in productivity for all genotypes can be obtained if root traits can be altered to reduce competition for water and nutrients. Our approach illustrates the potential of using eco-evolutionary theory and modeling to guide plant breeding and genetic technology in selecting target traits in the quest for higher forest productivity. © The Author 2014. Published by Oxford University Press. All rights reserved

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

  17. Autonomous search

    CERN Document Server

    Hamadi, Youssef; Saubion, Frédéric

    2012-01-01

    Autonomous combinatorial search (AS) represents a new field in combinatorial problem solving. Its major standpoint and originality is that it considers that problem solvers must be capable of self-improvement operations. This is the first book dedicated to AS.

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

  19. A survey of decision tree classifier methodology

    Science.gov (United States)

    Safavian, S. R.; Landgrebe, David

    1991-01-01

    Decision tree classifiers (DTCs) are used successfully in many diverse areas such as radar signal classification, character recognition, remote sensing, medical diagnosis, expert systems, and speech recognition. Perhaps the most important feature of DTCs is their capability to break down a complex decision-making process into a collection of simpler decisions, thus providing a solution which is often easier to interpret. A survey of current methods is presented for DTC designs and the various existing issues. After considering potential advantages of DTCs over single-state classifiers, subjects of tree structure design, feature selection at each internal node, and decision and search strategies are discussed.

  20. A survey of decision tree classifier methodology

    Science.gov (United States)

    Safavian, S. Rasoul; Landgrebe, David

    1990-01-01

    Decision Tree Classifiers (DTC's) are used successfully in many diverse areas such as radar signal classification, character recognition, remote sensing, medical diagnosis, expert systems, and speech recognition. Perhaps, the most important feature of DTC's is their capability to break down a complex decision-making process into a collection of simpler decisions, thus providing a solution which is often easier to interpret. A survey of current methods is presented for DTC designs and the various existing issue. After considering potential advantages of DTC's over single stage classifiers, subjects of tree structure design, feature selection at each internal node, and decision and search strategies are discussed.

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

  2. An IPv6 routing lookup algorithm using weight-balanced tree based on prefix value for virtual router

    Science.gov (United States)

    Chen, Lingjiang; Zhou, Shuguang; Zhang, Qiaoduo; Li, Fenghua

    2016-10-01

    Virtual router enables the coexistence of different networks on the same physical facility and has lately attracted a great deal of attention from researchers. As the number of IPv6 addresses is rapidly increasing in virtual routers, designing an efficient IPv6 routing lookup algorithm is of great importance. In this paper, we present an IPv6 lookup algorithm called weight-balanced tree (WBT). WBT merges Forwarding Information Bases (FIBs) of virtual routers into one spanning tree, and compresses the space cost. WBT's average time complexity and the worst case time complexity of lookup and update process are both O(logN) and space complexity is O(cN) where N is the size of routing table and c is a constant. Experiments show that WBT helps reduce more than 80% Static Random Access Memory (SRAM) cost in comparison to those separation schemes. WBT also achieves the least average search depth comparing with other homogeneous algorithms.

  3. Enhanced Approximate Nearest Neighbor via Local Area Focused Search.

    Energy Technology Data Exchange (ETDEWEB)

    Gonzales, Antonio [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Blazier, Nicholas Paul [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

    2017-02-01

    Approximate Nearest Neighbor (ANN) algorithms are increasingly important in machine learning, data mining, and image processing applications. There is a large family of space- partitioning ANN algorithms, such as randomized KD-Trees, that work well in practice but are limited by an exponential increase in similarity comparisons required to optimize recall. Additionally, they only support a small set of similarity metrics. We present Local Area Fo- cused Search (LAFS), a method that enhances the way queries are performed using an existing ANN index. Instead of a single query, LAFS performs a number of smaller (fewer similarity comparisons) queries and focuses on a local neighborhood which is refined as candidates are identified. We show that our technique improves performance on several well known datasets and is easily extended to general similarity metrics using kernel projection techniques.

  4. $A$ searches

    CERN Document Server

    Beacham, James

    The Standard Model of particle physics encompasses three of the four known fundamental forces of nature, and has remarkably withstood all of the experimental tests of its predictions, a fact solidified by the discovery, in 2012, of the Higgs boson. However, it cannot be the complete picture. Many measurements have been made that hint at physics beyond the Standard Model, and the main task of the high- energy experimental physics community is to conduct searches for new physics in as many di↵erent places and regimes as possible. I present three searches for new phenomena in three di↵erent high-energy collider experiments, namely, a search for events with at least three photons in the final state, which is sensitive to an exotic decay of a Higgs boson into four photons via intermediate pseudoscalar particles, a, with ATLAS, at the Large Hadron Collider; a search for a dark photon, also known as an A0 , with APEX, at Thomas Je↵erson National Accelerator Facility; and a search for a Higgs decaying into four...

  5. Structural empirical evaluation of job search monitoring

    OpenAIRE

    van den Berg, Gerard J.; Klaauw, Bas van der

    2015-01-01

    To evaluate search effort monitoring of unemployed workers, it is important to take account of post-unemployment wages and job-to-job mobility. We structurally estimate a job search model with endogenous job search effort by the unemployed along various search channels that deals with this. The data are from an experiment in the Netherlands in which the extent of monitoring is randomized. They include registers of post-unemployment outcomes like wages and job mobility, and survey data on meas...

  6. GRFT - Genetic Records Family Tree Web Applet.

    Science.gov (United States)

    Pimentel, Samuel; Walbot, Virginia; Fernandes, John

    2011-01-01

    Current software for storing and displaying records of genetic crosses does not provide an easy way to determine the lineage of an individual. The genetic records family tree (GRFT) applet processes records of genetic crosses and allows researchers to quickly visualize lineages using a family tree construct and to access other information from these records using any Internet browser. Users select from three display features: (1) a family tree view which displays a color-coded family tree for an individual, (2) a sequential list of crosses, and (3) a list of crosses matching user-defined search criteria. Each feature contains options to specify the number of records shown and the latter two contain an option to filter results by the owner of the cross. The family tree feature is interactive, displaying a popup box with genetic information when the user mouses over an individual and allowing the user to draw a new tree by clicking on any individual in the current tree. The applet is written in JavaScript and reads genetic records from a tab-delimited text file on the server, so it is cross-platform, can be accessed by anyone with an Internet connection, and supports almost instantaneous generation of new trees and table lists. Researchers can use the tool with their own genetic cross records for any sexually reproducing organism. No additional software is required and with only minor modifications to the script, researchers can add their own custom columns. GRFT's speed, versatility, and low overhead make it an effective and innovative visualization method for genetic records. A sample tool is available at http://stanford.edu/walbot/grft-sample.html.

  7. The valuative tree

    CERN Document Server

    Favre, Charles

    2004-01-01

    This volume is devoted to a beautiful object, called the valuative tree and designed as a powerful tool for the study of singularities in two complex dimensions. Its intricate yet manageable structure can be analyzed by both algebraic and geometric means. Many types of singularities, including those of curves, ideals, and plurisubharmonic functions, can be encoded in terms of positive measures on the valuative tree. The construction of these measures uses a natural tree Laplace operator of independent interest.

  8. Maximal buttonings of trees

    Directory of Open Access Journals (Sweden)

    Short Ian

    2014-05-01

    Full Text Available A buttoning of a tree that has vertices v1, v2, . . . , vn is a closed walk that starts at v1 and travels along the shortest path in the tree to v2, and then along the shortest path to v3, and so forth, finishing with the shortest path from vn to v1. Inspired by a problem about buttoning a shirt inefficiently, we determine the maximum length of buttonings of trees

  9. A theory of game trees, based on solution trees

    NARCIS (Netherlands)

    W.H.L.M. Pijls (Wim); A. de Bruin (Arie); A. Plaat (Aske)

    1996-01-01

    textabstractIn this paper a complete theory of game tree algorithms is presented, entirely based upon the notion of a solution tree. Two types of solution trees are distinguished: max and min solution trees respectively. We show that most game tree algorithms construct a superposition of a max and a

  10. Morocco - Fruit Tree Productivity

    Data.gov (United States)

    Millennium Challenge Corporation — Date Tree Irrigation Project: The specific objectives of this evaluation are threefold: - Performance evaluation of project activities, like the mid-term evaluation,...

  11. Transgenic Forest Trees

    Directory of Open Access Journals (Sweden)

    Ertuğrul Filiz

    2011-11-01

    Full Text Available Biotechnological methods are used in many areas nowadays and one of these areas is applications of biotechnology in forest trees. Biotechnological methods are used frequently on vital issues such as gaining resistance against diseases and herbicide of forest trees, increasing tree growth rates and development of resistance against environmental stresses (drought, salinity, climate change etc.. Also, for improving the quality of wood that reducing lignin content and increasing the amount of cellulose draws attention. This together with applications, positive and negative effects of transgenic trees to the environment is discussed and it was tried to be provided on the auditing legal regulations concerned with these studies.

  12. SNP selection and classification of genome-wide SNP data using stratified sampling random forests.

    Science.gov (United States)

    Wu, Qingyao; Ye, Yunming; Liu, Yang; Ng, Michael K

    2012-09-01

    For high dimensional genome-wide association (GWA) case-control data of complex disease, there are usually a large portion of single-nucleotide polymorphisms (SNPs) that are irrelevant with the disease. A simple random sampling method in random forest using default mtry parameter to choose feature subspace, will select too many subspaces without informative SNPs. Exhaustive searching an optimal mtry is often required in order to include useful and relevant SNPs and get rid of vast of non-informative SNPs. However, it is too time-consuming and not favorable in GWA for high-dimensional data. The main aim of this paper is to propose a stratified sampling method for feature subspace selection to generate decision trees in a random forest for GWA high-dimensional data. Our idea is to design an equal-width discretization scheme for informativeness to divide SNPs into multiple groups. In feature subspace selection, we randomly select the same number of SNPs from each group and combine them to form a subspace to generate a decision tree. The advantage of this stratified sampling procedure can make sure each subspace contains enough useful SNPs, but can avoid a very high computational cost of exhaustive search of an optimal mtry, and maintain the randomness of a random forest. We employ two genome-wide SNP data sets (Parkinson case-control data comprised of 408 803 SNPs and Alzheimer case-control data comprised of 380 157 SNPs) to demonstrate that the proposed stratified sampling method is effective, and it can generate better random forest with higher accuracy and lower error bound than those by Breiman's random forest generation method. For Parkinson data, we also show some interesting genes identified by the method, which may be associated with neurological disorders for further biological investigations.

  13. Misuse of randomization

    DEFF Research Database (Denmark)

    Liu, Jianping; Kjaergard, Lise Lotte; Gluud, Christian

    2002-01-01

    The quality of randomization of Chinese randomized trials on herbal medicines for hepatitis B was assessed. Search strategy and inclusion criteria were based on the published protocol. One hundred and seventy-six randomized clinical trials (RCTs) involving 20,452 patients with chronic hepatitis B....../150) of the studies were imbalanced at the 0.05 level of probability for the two treatments and 13.3% (20/150) imbalanced at the 0.01 level in the randomization. It is suggested that there may exist misunderstanding of the concept and the misuse of randomization based on the review....

  14. Higgs and SUSY searches at future colliders

    Indian Academy of Sciences (India)

    scalar A does not have any tree level couplings toV V . Hence, looking for the · - and bb final state becomes very important for the search of the MSSM scalars. As far as the lightest CP even neutral Higgsh¼ is concerned, the major effects on the search prospects are three : 1. The change in gg —h¼ production cross-section ...

  15. Social network sampling using spanning trees

    Science.gov (United States)

    Jalali, Zeinab S.; Rezvanian, Alireza; Meybodi, Mohammad Reza

    2016-12-01

    Due to the large scales and limitations in accessing most online social networks, it is hard or infeasible to directly access them in a reasonable amount of time for studying and analysis. Hence, network sampling has emerged as a suitable technique to study and analyze real networks. The main goal of sampling online social networks is constructing a small scale sampled network which preserves the most important properties of the original network. In this paper, we propose two sampling algorithms for sampling online social networks using spanning trees. The first proposed sampling algorithm finds several spanning trees from randomly chosen starting nodes; then the edges in these spanning trees are ranked according to the number of times that each edge has appeared in the set of found spanning trees in the given network. The sampled network is then constructed as a sub-graph of the original network which contains a fraction of nodes that are incident on highly ranked edges. In order to avoid traversing the entire network, the second sampling algorithm is proposed using partial spanning trees. The second sampling algorithm is similar to the first algorithm except that it uses partial spanning trees. Several experiments are conducted to examine the performance of the proposed sampling algorithms on well-known real networks. The obtained results in comparison with other popular sampling methods demonstrate the efficiency of the proposed sampling algorithms in terms of Kolmogorov-Smirnov distance (KSD), skew divergence distance (SDD) and normalized distance (ND).

  16. Are trees long-lived?

    Science.gov (United States)

    Kevin T. Smith

    2009-01-01

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

  17. TreeCmp: Comparison of Trees in Polynomial Time

    Science.gov (United States)

    Bogdanowicz, Damian; Giaro, Krzysztof; Wróbel, Borys

    2012-01-01

    When a phylogenetic reconstruction does not result in one tree but in several, tree metrics permit finding out how far the reconstructed trees are from one another. They also permit to assess the accuracy of a reconstruction if a true tree is known. TreeCmp implements eight metrics that can be calculated in polynomial time for arbitrary (not only bifurcating) trees: four for unrooted (Matching Split metric, which we have recently proposed, Robinson-Foulds, Path Difference, Quartet) and four for rooted trees (Matching Cluster, Robinson-Foulds cluster, Nodal Splitted and Triple). TreeCmp is the first implementation of Matching Split/Cluster metrics and the first efficient and convenient implementation of Nodal Splitted. It allows to compare relatively large trees. We provide an example of the application of TreeCmp to compare the accuracy of ten approaches to phylogenetic reconstruction with trees up to 5000 external nodes, using a measure of accuracy based on normalized similarity between trees.

  18. Temporal variation in the composition of ant assemblages (Hymenoptera, Formicidae on trees in the Pantanal floodplain, Mato Grosso do Sul, Brazil

    Directory of Open Access Journals (Sweden)

    Stela de Almeida Soares

    2013-03-01

    Full Text Available Temporal variation in the composition of ant assemblages (Hymenoptera, Formicidae on trees in the Pantanal floodplain, Mato Grosso do Sul, Brazil. In this paper we investigate how seasonal flooding influences the composition of assemblages of ants foraging on trees in the Pantanal of Mato Grosso do Sul. During the flood in the Pantanal, a large area is covered by floods that are the main forces that regulate the pattern of diversity in these areas. However, the effects of such natural disturbances in the ant communities are poorly known. In this sense, the objective of this study was to evaluate the effect of temporal variation in assemblages of ants foraging on trees in the Pantanal of Miranda. Samples were collected during a year in two adjacent areas, one who suffered flooding during the wet period and another that did not suffer flooding throughout the year. In 10 sites for each evaluated habitat, five pitfall traps were installed at random in trees 25 m apart from each other. In the habitat with flooding, the highest richness was observed during the flooding period, while there was no significant change in richness in the area that does not suffer flooding. The diversity of species between the two evaluated habitats varied significantly during the two seasons. Most ants sampled belong to species that forage and nest in soil. This suggests that during the flood in flooded habitats, ants that did not migrate to higher areas without flooding adopt the strategy to search for resources in the tree canopy.

  19. Individual tree control

    Science.gov (United States)

    Harvey A. Holt

    1989-01-01

    Controlling individual unwanted trees in forest stands is a readily accepted method for improving the value of future harvests. The practice is especially important in mixed hardwood forests where species differ considerably in value and within species individual trees differ in quality. Individual stem control is a mechanical or chemical weeding operation that...

  20. Tree biology and dendrochemistry

    Science.gov (United States)

    Kevin T. Smith; Walter C. Shortle

    1996-01-01

    Dendrochemistry, the interpretation of elemental analysis of dated tree rings, can provide a temporal record of environmental change. Using the dendrochemical record requires an understanding of tree biology. In this review, we pose four questions concerning assumptions that underlie recent dendrochemical research: 1) Does the chemical composition of the wood directly...

  1. Trees Are Terrific!

    Science.gov (United States)

    Braus, Judy, Ed.

    1992-01-01

    Ranger Rick's NatureScope is a creative education series dedicated to inspiring in children an understanding and appreciation of the natural world while developing the skills they will need to make responsible decisions about the environment. Contents are organized into the following sections: (1) "What Makes a Tree a Tree?," including…

  2. Structural Equation Model Trees

    Science.gov (United States)

    Brandmaier, Andreas M.; von Oertzen, Timo; McArdle, John J.; Lindenberger, Ulman

    2013-01-01

    In the behavioral and social sciences, structural equation models (SEMs) have become widely accepted as a modeling tool for the relation between latent and observed variables. SEMs can be seen as a unification of several multivariate analysis techniques. SEM Trees combine the strengths of SEMs and the decision tree paradigm by building tree…

  3. Matching Subsequences in Trees

    DEFF Research Database (Denmark)

    Bille, Philip; Gørtz, Inge Li

    2009-01-01

    Given two rooted, labeled trees P and T the tree path subsequence problem is to determine which paths in P are subsequences of which paths in T. Here a path begins at the root and ends at a leaf. In this paper we propose this problem as a useful query primitive for XML data, and provide new...

  4. Uncovering dynamic fault trees

    NARCIS (Netherlands)

    Junges, Sebastian; Guck, Dennis; Katoen, Joost P.; Stoelinga, Mariëlle Ida Antoinette

    Fault tree analysis is a widespread industry standard for assessing system reliability. Standard (static) fault trees model the failure behaviour of systems in dependence of their component failures. To overcome their limited expressive power, common dependability patterns, such as spare management,

  5. Grading hardwood trees

    Science.gov (United States)

    Robert L. Brisbin

    1989-01-01

    Tree grading provides a way to evaluate the quality characteristics and value of standing hardwood trees. This is important because the differences in price between high-quality and low-quality end products can be very large. Since hardwood timber varies greatly in quality and value among species, within species, and even within specific geographic areas, timber...

  6. CSI for Trees

    Science.gov (United States)

    Rubino, Darrin L.; Hanson, Deborah

    2009-01-01

    The circles and patterns in a tree's stem tell a story, but that story can be a mystery. Interpreting the story of tree rings provides a way to heighten the natural curiosity of students and help them gain insight into the interaction of elements in the environment. It also represents a wonderful opportunity to incorporate the nature of science.…

  7. Searching circular DNA strands

    Energy Technology Data Exchange (ETDEWEB)

    Eliazar, Iddo [Department of Technology Management, Holon Institute of Technology, Holon 58102 (Israel); Koren, Tal [School of Chemistry, Raymond and Beverly Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv 69978 (Israel); Klafter, Joseph [School of Chemistry, Raymond and Beverly Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv 69978 (Israel)

    2007-02-14

    We introduce and explore a model of an ensemble of enzymes searching, in parallel, a circular DNA strand for a target site. The enzymes performing the search combine local scanning-conducted by a 1D motion along the strand-and random relocations on the strand-conducted via a confined motion in the medium containing the strand. Both the local scan mechanism and the relocation mechanism are considered general. The search durations are analysed, and their limiting probability distributions-for long DNA strands-are obtained in closed form. The results obtained (i) encompass the cases of single, parallel and massively parallel searches, taking place in the presence of either finite-mean or heavy-tailed relocation times, (ii) are applicable to a wide spectrum of local scan mechanisms including linear, Brownian, selfsimilar, and sub-diffusive motions (iii) provide a quantitative theoretical justification for the necessity of the relocation mechanism, and (iv) facilitate the derivation of optimal relocation strategies.

  8. Internet Search Engines

    OpenAIRE

    Fatmaa El Zahraa Mohamed Abdou

    2004-01-01

    A general study about the internet search engines, the study deals main 7 points; the differance between search engines and search directories, components of search engines, the percentage of sites covered by search engines, cataloging of sites, the needed time for sites appearance in search engines, search capabilities, and types of search engines.

  9. Tree damage and mycotrophy

    Energy Technology Data Exchange (ETDEWEB)

    Heyser, W.; Iken, J.; Meyer, F.H.

    1988-10-22

    Tree species that are particularly endangered in our forests are characterized by the fact that they live in an obligatory symbiosis with ectomycorrhiza fungii. In verifying which tree species appear to be more damaged or less severely damaged, a conspicuous phenomenon noted was that the tree species exhibiting slight symptoms of damage or none at all included such ones as form mycorrhizas facultatively or dispense with mycorrhizas, e.g. Acer, Aesculus, Fraxinus, Populus, Salix. Given that trees in municipal gardens reflect the development and extent of damage in a way similar to forests, and given also that much greater numbers of tree species are often cultured in parks of this type, the latter were considered particularly suited to examine the question of whether a relationship exists between mycotrophy and the severity of damage.

  10. Triplet supertree heuristics for the tree of life.

    Science.gov (United States)

    Lin, Harris T; Burleigh, J Gordon; Eulenstein, Oliver

    2009-01-30

    There is much interest in developing fast and accurate supertree methods to infer the tree of life. Supertree methods combine smaller input trees with overlapping sets of taxa to make a comprehensive phylogenetic tree that contains all of the taxa in the input trees. The intrinsically hard triplet supertree problem takes a collection of input species trees and seeks a species tree (supertree) that maximizes the number of triplet subtrees that it shares with the input trees. However, the utility of this supertree problem has been limited by a lack of efficient and effective heuristics. We introduce fast hill-climbing heuristics for the triplet supertree problem that perform a step-wise search of the tree space, where each step is guided by an exact solution to an instance of a local search problem. To realize time efficient heuristics we designed the first nontrivial algorithms for two standard search problems, which greatly improve on the time complexity to the best known (naïve) solutions by a factor of n and n2 (the number of taxa in the supertree). These algorithms enable large-scale supertree analyses based on the triplet supertree problem that were previously not possible. We implemented hill-climbing heuristics that are based on our new algorithms, and in analyses of two published supertree data sets, we demonstrate that our new heuristics outperform other standard supertree methods in maximizing the number of triplets shared with the input trees. With our new heuristics, the triplet supertree problem is now computationally more tractable for large-scale supertree analyses, and it provides a potentially more accurate alternative to existing supertree methods.

  11. Using the minimum spanning tree to trace mass segregation

    NARCIS (Netherlands)

    Allison, R.J.; Goodwin, S.P.; Parker, R.J.; Portegies Zwart, S.F.; de Grijs, R.; Kouwenhoven, M.B.N.

    2009-01-01

    We present a new method to detect and quantify mass segregation in star clusters. It compares the minimum spanning tree (MST) of massive stars with that of random stars. If mass segregation is present, the MST length of the most massive stars will be shorter than that of random stars. This

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

  13. Incorporating opponent models into adversary search

    Energy Technology Data Exchange (ETDEWEB)

    Carmel, D.; Markovitch, S. [Technion, Haifa (Israel)

    1996-12-31

    This work presents a generalized theoretical framework that allows incorporation of opponent models into adversary search. We present the M* algorithm, a generalization of minimax that uses an arbitrary opponent model to simulate the opponent`s search. The opponent model is a recursive structure consisting of the opponent`s evaluation function and its model of the player. We demonstrate experimentally the potential benefit of using an opponent model. Pruning in M* is impossible in the general case. We prove a sufficient condition for pruning and present the {alpha}{beta}* algorithm which returns the M* value of a tree while searching only necessary branches.

  14. Phylogenetic trees in bioinformatics

    Energy Technology Data Exchange (ETDEWEB)

    Burr, Tom L [Los Alamos National Laboratory

    2008-01-01

    Genetic data is often used to infer evolutionary relationships among a collection of viruses, bacteria, animal or plant species, or other operational taxonomic units (OTU). A phylogenetic tree depicts such relationships and provides a visual representation of the estimated branching order of the OTUs. Tree estimation is unique for several reasons, including: the types of data used to represent each OTU; the use ofprobabilistic nucleotide substitution models; the inference goals involving both tree topology and branch length, and the huge number of possible trees for a given sample of a very modest number of OTUs, which implies that fmding the best tree(s) to describe the genetic data for each OTU is computationally demanding. Bioinformatics is too large a field to review here. We focus on that aspect of bioinformatics that includes study of similarities in genetic data from multiple OTUs. Although research questions are diverse, a common underlying challenge is to estimate the evolutionary history of the OTUs. Therefore, this paper reviews the role of phylogenetic tree estimation in bioinformatics, available methods and software, and identifies areas for additional research and development.

  15. Basic wood density of Acacia melanoxylon R.Br related to sample tree height, tree and site; Densidad basica de la madera de Acacia melanoxylon R. Br en relacion con la altura de muestreo, el arbol y el sitio

    Energy Technology Data Exchange (ETDEWEB)

    Igartua Dora, D. V.; Monteoliva, S.

    2009-07-01

    The aim of the work was to assess basic wood density variations of Acacia melanoxylon R.Br according to sample tree height, tree, and site. Twenty trees were selected from four sites in Buenos Aires Province, Argentine. Wood density was determined over two disc samples at four tree height (base, breast height, 30% and 50% of total tree height). According to determined ages, some trees were divided into two groups according to age (26-32 years and 9-12 years) and data were analyzed with an analysis of variance according to mixed model where tree was the random effect. Trees represent 74 % of total random variance. Within tree, axial tendency of wood density was to decrease from the base toward breast height and then its value was stable to the top. This was consistent across all sites and age groups. Forest resource growing at Los Tuelches site presented the highest basic wood density. (Author) 40 refs.

  16. The gravity apple tree

    Science.gov (United States)

    Espinosa Aldama, Mariana

    2015-04-01

    The gravity apple tree is a genealogical tree of the gravitation theories developed during the past century. The graphic representation is full of information such as guides in heuristic principles, names of main proponents, dates and references for original articles (See under Supplementary Data for the graphic representation). This visual presentation and its particular classification allows a quick synthetic view for a plurality of theories, many of them well validated in the Solar System domain. Its diachronic structure organizes information in a shape of a tree following similarities through a formal concept analysis. It can be used for educational purposes or as a tool for philosophical discussion.

  17. Prospects for Higgs boson searches at the Large Hadron Collider

    Indian Academy of Sciences (India)

    A brief discussion on the expected performance from these experiments in searches for one or more of the Higgs bosons from ... collision data-taking from 2008, have been designed to search for the Higgs over a wide mass range [5,6]. .... At tree-level, all Higgs masses and couplings can be expressed in terms of mA and ...

  18. MusiCat System Makes Library Searches More Fruitful.

    Science.gov (United States)

    Hansen, Per Hofman

    2002-01-01

    Describes MusiCat, an experimental user interface designed in Denmark that reflects the different ways that patrons think when searching for musical material on the Web. Discusses technology versus content; search trees that use a hierarchy of subject terms; and usability testing. (LRW)

  19. Search Brokers

    OpenAIRE

    Artyom Shneyerov; Andras Niedermayer

    2011-01-01

    We consider a market with dynamic random matching and bargaining with two-sided private information `a la Satterthwaite and Shneyerov (2007). Traders know their valuation for the good before entering the market and steady state distributions in the market are endogenously determined in equilibrium. The market is organized by a profit maximizing broker. We compare the case where the broker can only charge participation fees to buyers and sellers and can influence neither the matching technolog...

  20. De novo assembly and characterization of bark transcriptome using Illumina sequencing and development of EST-SSR markers in rubber tree (Hevea brasiliensis Muell. Arg.

    Directory of Open Access Journals (Sweden)

    Li Dejun

    2012-05-01

    Full Text Available Abstract Background In rubber tree, bark is one of important agricultural and biological organs. However, the molecular mechanism involved in the bark formation and development in rubber tree remains largely unknown, which is at least partially due to lack of bark transcriptomic and genomic information. Therefore, it is necessary to carried out high-throughput transcriptome sequencing of rubber tree bark to generate enormous transcript sequences for the functional characterization and molecular marker development. Results In this study, more than 30 million sequencing reads were generated using Illumina paired-end sequencing technology. In total, 22,756 unigenes with an average length of 485 bp were obtained with de novo assembly. The similarity search indicated that 16,520 and 12,558 unigenes showed significant similarities to known proteins from NCBI non-redundant and Swissprot protein databases, respectively. Among these annotated unigenes, 6,867 and 5,559 unigenes were separately assigned to Gene Ontology (GO and Clusters of Orthologous Group (COG. When 22,756 unigenes searched against the Kyoto Encyclopedia of Genes and Genomes Pathway (KEGG database, 12,097 unigenes were assigned to 5 main categories including 123 KEGG pathways. Among the main KEGG categories, metabolism was the biggest category (9,043, 74.75%, suggesting the active metabolic processes in rubber tree bark. In addition, a total of 39,257 EST-SSRs were identified from 22,756 unigenes, and the characterizations of EST-SSRs were further analyzed in rubber tree. 110 potential marker sites were randomly selected to validate the assembly quality and develop EST-SSR markers. Among 13 Hevea germplasms, PCR success rate and polymorphism rate of 110 markers were separately 96.36% and 55.45% in this study. Conclusion By assembling and analyzing de novo transcriptome sequencing data, we reported the comprehensive functional characterization of rubber tree bark. This research

  1. De novo assembly and characterization of bark transcriptome using Illumina sequencing and development of EST-SSR markers in rubber tree (Hevea brasiliensis Muell. Arg.).

    Science.gov (United States)

    Li, Dejun; Deng, Zhi; Qin, Bi; Liu, Xianghong; Men, Zhonghua

    2012-05-18

    In rubber tree, bark is one of important agricultural and biological organs. However, the molecular mechanism involved in the bark formation and development in rubber tree remains largely unknown, which is at least partially due to lack of bark transcriptomic and genomic information. Therefore, it is necessary to carried out high-throughput transcriptome sequencing of rubber tree bark to generate enormous transcript sequences for the functional characterization and molecular marker development. In this study, more than 30 million sequencing reads were generated using Illumina paired-end sequencing technology. In total, 22,756 unigenes with an average length of 485 bp were obtained with de novo assembly. The similarity search indicated that 16,520 and 12,558 unigenes showed significant similarities to known proteins from NCBI non-redundant and Swissprot protein databases, respectively. Among these annotated unigenes, 6,867 and 5,559 unigenes were separately assigned to Gene Ontology (GO) and Clusters of Orthologous Group (COG). When 22,756 unigenes searched against the Kyoto Encyclopedia of Genes and Genomes Pathway (KEGG) database, 12,097 unigenes were assigned to 5 main categories including 123 KEGG pathways. Among the main KEGG categories, metabolism was the biggest category (9,043, 74.75%), suggesting the active metabolic processes in rubber tree bark. In addition, a total of 39,257 EST-SSRs were identified from 22,756 unigenes, and the characterizations of EST-SSRs were further analyzed in rubber tree. 110 potential marker sites were randomly selected to validate the assembly quality and develop EST-SSR markers. Among 13 Hevea germplasms, PCR success rate and polymorphism rate of 110 markers were separately 96.36% and 55.45% in this study. By assembling and analyzing de novo transcriptome sequencing data, we reported the comprehensive functional characterization of rubber tree bark. This research generated a substantial fraction of rubber tree transcriptome

  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. Tree-growth analyses to estimate tree species' drought tolerance

    NARCIS (Netherlands)

    Eilmann, B.; Rigling, A.

    2012-01-01

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

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

  5. Big trees, old trees, and growth factor tables

    Science.gov (United States)

    Kevin T. Smith

    2018-01-01

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

  6. Inferring epidemic contact structure from phylogenetic trees.

    Directory of Open Access Journals (Sweden)

    Gabriel E Leventhal

    Full Text Available Contact structure is believed to have a large impact on epidemic spreading and consequently using networks to model such contact structure continues to gain interest in epidemiology. However, detailed knowledge of the exact contact structure underlying real epidemics is limited. Here we address the question whether the structure of the contact network leaves a detectable genetic fingerprint in the pathogen population. To this end we compare phylogenies generated by disease outbreaks in simulated populations with different types of contact networks. We find that the shape of these phylogenies strongly depends on contact structure. In particular, measures of tree imbalance allow us to quantify to what extent the contact structure underlying an epidemic deviates from a null model contact network and illustrate this in the case of random mixing. Using a phylogeny from the Swiss HIV epidemic, we show that this epidemic has a significantly more unbalanced tree than would be expected from random mixing.

  7. Clinician search behaviors may be influenced by search engine design.

    Science.gov (United States)

    Lau, Annie Y S; Coiera, Enrico; Zrimec, Tatjana; Compton, Paul

    2010-06-30

    Searching the Web for documents using information retrieval systems plays an important part in clinicians' practice of evidence-based medicine. While much research focuses on the design of methods to retrieve documents, there has been little examination of the way different search engine capabilities influence clinician search behaviors. Previous studies have shown that use of task-based search engines allows for faster searches with no loss of decision accuracy compared with resource-based engines. We hypothesized that changes in search behaviors may explain these differences. In all, 75 clinicians (44 doctors and 31 clinical nurse consultants) were randomized to use either a resource-based or a task-based version of a clinical information retrieval system to answer questions about 8 clinical scenarios in a controlled setting in a university computer laboratory. Clinicians using the resource-based system could select 1 of 6 resources, such as PubMed; clinicians using the task-based system could select 1 of 6 clinical tasks, such as diagnosis. Clinicians in both systems could reformulate search queries. System logs unobtrusively capturing clinicians' interactions with the systems were coded and analyzed for clinicians' search actions and query reformulation strategies. The most frequent search action of clinicians using the resource-based system was to explore a new resource with the same query, that is, these clinicians exhibited a "breadth-first" search behaviour. Of 1398 search actions, clinicians using the resource-based system conducted 401 (28.7%, 95% confidence interval [CI] 26.37-31.11) in this way. In contrast, the majority of clinicians using the task-based system exhibited a "depth-first" search behavior in which they reformulated query keywords while keeping to the same task profiles. Of 585 search actions conducted by clinicians using the task-based system, 379 (64.8%, 95% CI 60.83-68.55) were conducted in this way. This study provides evidence that

  8. Merged Search Algorithms for Radio Frequency Identification Anticollision

    Directory of Open Access Journals (Sweden)

    Bih-Yaw Shih

    2012-01-01

    The arbitration algorithm for RFID system is used to arbitrate all the tags to avoid the collision problem with the existence of multiple tags in the interrogation field of a transponder. A splitting algorithm which is called Binary Search Tree (BST is well known for multitags arbitration. In the current study, a splitting-based schema called Merged Search Tree is proposed to capture identification codes correctly for anticollision. Performance of the proposed algorithm is compared with the original BST according to time and power consumed during the arbitration process. The results show that the proposed model can reduce searching time and power consumed to achieve a better performance arbitration.

  9. Trees and Decisions

    OpenAIRE

    Alós-Ferrer, Carlos; Ritzberger, Klaus

    2003-01-01

    Abstract: The traditional model of sequential decision making, for instance, in extensive form games, is a tree. Most texts define a tree as a connected directed graph without loops and a distinguished node, called the root. But an abstract graph isnot a domain for decision theory. Decision theory perceives of acts as functions from states to consequences. Sequential decisions, accordingly, get conceptualized by mappings from sets of states to sets of consequences. Thus, the question arises w...

  10. Visualisation of Regression Trees

    OpenAIRE

    Brunsdon, Chris

    2007-01-01

    he regression tree [1] has been used as a tool for exploring multivariate data sets for some time. As in multiple linear regression, the technique is applied to a data set consisting of a contin- uous response variable y and a set of predictor variables { x 1 ,x 2 ,...,x k } which may be continuous or categorical. However, instead of modelling y as a linear function of the predictors, regression trees model y as a series of ...

  11. Type extension trees

    DEFF Research Database (Denmark)

    Jaeger, Manfred

    2006-01-01

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

  12. Tree Improvement Glossary

    DEFF Research Database (Denmark)

    Schmidt, Lars Holger

    Forest tree improvement encompasses a number of scientific and technical areas like floral-, reproductive- and micro-biology, genetics breeding methods and strategies, propagation, gene conservation, data analysis and statistics, each area with a comprehensive terminology. The terms selected...... for definition here are those most frequently used in tree improvement literature. Clonal propagation is included in the view of the great expansion of that field as a means of mass multiplication of improved material....

  13. Tree felling 2014

    CERN Multimedia

    2014-01-01

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

  14. Anatomy of the Pythagoras' Tree

    Science.gov (United States)

    Teia, Luis

    2016-01-01

    The architecture of nature can be seen at play in a tree: no two are alike. The Pythagoras' tree behaves just as a "tree" in that the root plus the same movement repeated over and over again grows from a seed, to a plant, to a tree. In human life, this movement is termed cell division. With triples, this movement is a geometrical and…

  15. State Trees and Arbor Days.

    Science.gov (United States)

    Forest Service (USDA), Washington, DC.

    Provides information on state trees for each of the 50 states and the District of Columbia. Includes for each state: (1) year in which state tree was chosen; (2) common and scientific names of the tree; (3) arbor day observance; (4) address of state forester; and (5) drawings of the tree, leaf, and fruit or cone. (JN)

  16. Attack Trees with Sequential Conjunction

    NARCIS (Netherlands)

    Jhawar, Ravi; Kordy, Barbara; Mauw, Sjouke; Radomirović, Sasa; Trujillo-Rasua, Rolando

    2015-01-01

    We provide the first formal foundation of SAND attack trees which are a popular extension of the well-known attack trees. The SAND at- tack tree formalism increases the expressivity of attack trees by intro- ducing the sequential conjunctive operator SAND. This operator enables the modeling of

  17. Economic Valuation of Urban Trees: Ribnjak Park Case Study, Zagreb

    Directory of Open Access Journals (Sweden)

    Karlo Beljan

    2015-06-01

    Full Text Available Background and Purpose: Population growth, urbanisation and technological development are creating a growing need for urban forests and parks, which are becoming green oases for recreation and relaxation. Apart from the sociological and economic components, urban forest valuation is presented through tourism, the market value of main and secondary forest products, and the growing value of real estate in the vicinity of green areas. Environmental economics explores the optimal ratio between the costs and the benefits received from the investment in the environment. The aim of this research is monetary valuation of urban trees. Materials and Methods: A Danish model for tree value determination was applied in Ribnjak Park as a case study. The model is based on tree growing costs and the present value. It is limited by the subjective aesthetic tree value estimation, but it is used in Europe because of its practicality. Individual tree value estimation is used because of the tree damage from vehicles or new residential buildings. The method is suitable for individual trees or groups of trees, but it is not appropriate for forest stands. Twenty random selected trees from nine different tree species have been analysed in the park. Diameter at breast height, tree height, expected age, aesthetic value and location were recorded for each tree. Furthermore, ecological, social and health tree values were taken into account separately with the calculation of points. Results: According to the evaluation, the average monetary value of one tree in Ribnjak Park is 542 EUR. The average diameter at breast height is 57.86 cm with the average age of 96.14 years. Plane trees have the highest value in comparison to other sampled species. Conclusions: Tree values vary depending on age, dimension or aesthetic values. The disadvantage of this method is in the estimation of very old tree value and in high involvement of personal estimation, which creates an opportunity

  18. Meta Search Engines.

    Science.gov (United States)

    Garman, Nancy

    1999-01-01

    Describes common options and features to consider in evaluating which meta search engine will best meet a searcher's needs. Discusses number and names of engines searched; other sources and specialty engines; search queries; other search options; and results options. (AEF)

  19. Improving Monte-Carlo Tree Search in Havannah

    Science.gov (United States)

    Lorentz, Richard J.

    Havannah is a game played on an hexagonal board of hexagons where the base of the board typically ranges from four to ten hexagons. The game is known to be difficult to program. We study an MCTS-based approach to programming Havannah using our program named Wanderer. We experiment with five techniques of the basic MCTS algorithms and demonstrate that at normal time controls of approximately 30 seconds per move Wanderer can make quite strong moves with bases of size four or five, and play a reasonable game with bases of size six or seven. At longer time controls (ten minutes per move) Wanderer (1) appears to play nearly perfectly with base four, (2) is difficult for most humans to beat at base five, and (3) gives a good game at bases six and seven. Future research focuses on larger board sizes.

  20. Total red meat intake of ≥0.5 servings/d does not negatively influence cardiovascular disease risk factors: a systemically searched meta-analysis of randomized controlled trials.

    Science.gov (United States)

    O'Connor, Lauren E; Kim, Jung Eun; Campbell, Wayne W

    2017-01-01

    Observational associations between red meat intake and cardiovascular disease (CVD) are inconsistent. There are limited comprehensive analyses of randomized controlled trials (RCTs) that investigate the effects of red meat consumption on CVD risk factors. The purpose of this systematically searched meta-analysis was to assess the effects of consuming ≥0.5 or meat/d on CVD risk factors [blood total cholesterol (TC), LDL cholesterol, HDL cholesterol, triglycerides, ratio of TC to HDL cholesterol (TC:HDL), and systolic and diastolic blood pressures (SBP and DBP, respectively)]. We hypothesized that the consumption of ≥0.5 servings of total red meat/d would have a negative effect on these CVD risk factors. Two researchers independently screened 945 studies from PubMed, Cochrane Library, and Scopus databases and extracted data from 24 qualified RCTs. Inclusion criteria were 1) RCT, 2) subjects aged ≥19 y, 3) consumption of ≥0.5 or meat servings/d [35 g (1.25 ounces)], and 4) reporting ≥1 CVD risk factor. We performed an adjusted 2-factor nested ANOVA mixed-effects model procedure on the postintervention values of TC, LDL cholesterol, HDL cholesterol, TC:HDL cholesterol, triglycerides, SBP, and DBP; calculated overall effect sizes of change values; and used a repeated-measures ANOVA to assess pre- to postintervention changes. Red meat intake did not affect lipid-lipoprotein profiles or blood pressure values postintervention (P > 0.05) or changes over time [weighted mean difference (95% CI): -0.01 mmol/L (-0.08, 0.06 mmol/L), 0.02 mmol/L (-0.05, 0.08 mmol/L), 0.03 mmol/L (-0.01, 0.07 mmol/L), and 0.04 mmol/L (-0.02, 0.10 mmol/L); -0.08 mm Hg (-0.26, 0.11 mm Hg); and -1.0 mm Hg (-2.4, 0.78 mm Hg) and 0.1 mm Hg (-1.2, 1.5 mm Hg) for TC, LDL cholesterol, HDL cholesterol, triglycerides, TC:HDL cholesterol, SBP, and DBP, respectively]. Among all subjects, TC, LDL cholesterol, HDL cholesterol, TC:HDL cholesterol, triglycerides, and DBP, but not SBP, decreased over

  1. Every DFS tree of a 3-connected graph contains a contractible edge

    DEFF Research Database (Denmark)

    Elmasry, Amr Ahmed Abd Elmoneim; Mehlhorn, Kurt; Schmidt, Jens M.

    2013-01-01

    Tutte proved that every 3-connected graph G on more than 4 vertices contains a contractible edge. We strengthen this result by showing that every depth-first-search tree of G contains a contractible edge. Moreover, we show that every spanning tree of G contains a contractible edge if G is 3-regular...

  2. Paper-Based Survivorship Care Plans May be Less Helpful for Cancer Patients Who Search for Disease-Related Information on the Internet: Results of the Registrationsystem Oncological Gynecology (ROGY) Care Randomized Trial.

    Science.gov (United States)

    Nicolaije, Kim Ah; Ezendam, Nicole Pm; Pijnenborg, Johanna Ma; Boll, Dorry; Vos, Maria Caroline; Kruitwagen, Roy Fpm; van de Poll-Franse, Lonneke V

    2016-07-08

    The Institute of Medicine recommends Survivorship Care Plans (SCPs) for all cancer survivors. However, it is unclear whether certain patient groups may or may not benefit from SCPs. The aim was to assess whether the effects of an automatically generated paper SCP on patients' satisfaction with information provision and care, illness perceptions, and health care utilization were moderated by disease-related Internet use. Twelve hospitals were randomized to either SCP care or usual care in the pragmatic cluster randomized Registrationsystem Oncological GYnecology (ROGY) Care trial. Newly diagnosed endometrial cancer patients completed questionnaires after diagnosis (N=221; response: 74.7%, 221/296), 6 months (n=158), and 12 months (n=147), including patients' satisfaction with information provision and care, illness perceptions, health care utilization (how many times patients visited a medical specialist or primary care physician about their cancer in the past 6 months), and disease-related Internet use (whether patients used the Internet to look for information about cancer). In total, 80 of 221 (36.2%) patients used the Internet to obtain disease-related information. Disease-related Internet use moderated the SCP care effect on the amount of information received about the disease (P=.03) and medical tests (P=.01), helpfulness of the information (P=.01), and how well patients understood their illness (P=.04). All stratified analyses were not statistically significant. However, it appeared that patients who did not seek disease-related information on the Internet in the SCP care arm reported receiving more information about their disease (mean 63.9, SD 20.1 vs mean 58.3, SD 23.7) and medical tests (mean 70.6, SD 23.5 vs mean 64.7, SD 24.9), finding the information more helpful (76.7, SD 22.9 vs mean 67.8, SD 27.2; scale 0-100), and understanding their illness better (mean 6.6, SD 3.0 vs mean 6.1, SD 3.2; scale 1-10) than patients in the usual care arm did. In

  3. Steiner trees in industry

    CERN Document Server

    Du, Ding-Zhu

    2001-01-01

    This book is a collection of articles studying various Steiner tree prob­ lems with applications in industries, such as the design of electronic cir­ cuits, computer networking, telecommunication, and perfect phylogeny. The Steiner tree problem was initiated in the Euclidean plane. Given a set of points in the Euclidean plane, the shortest network interconnect­ ing the points in the set is called the Steiner minimum tree. The Steiner minimum tree may contain some vertices which are not the given points. Those vertices are called Steiner points while the given points are called terminals. The shortest network for three terminals was first studied by Fermat (1601-1665). Fermat proposed the problem of finding a point to minimize the total distance from it to three terminals in the Euclidean plane. The direct generalization is to find a point to minimize the total distance from it to n terminals, which is still called the Fermat problem today. The Steiner minimum tree problem is an indirect generalization. Sch...

  4. The Cost of Cache-Oblivious Searching

    DEFF Research Database (Denmark)

    Bender, Michael A.; Brodal, Gerth Stølting; Fagerberg, Rolf

    2011-01-01

    This paper gives tight bounds on the cost of cache-oblivious searching. The paper shows that no cache-oblivious search structure can guarantee a search performance of fewer than lg elog  B N memory transfers between any two levels of the memory hierarchy. This lower bound holds even if all...... increases. The expectation is taken over the random placement in memory of the first element of the structure. Because searching in the disk-access machine (DAM) model can be performed in log  B N+O(1) block transfers, this result establishes a separation between the (2-level) DAM model and cache......-oblivious model. The DAM model naturally extends to k levels. The paper also shows that as k grows, the search costs of the optimal k-level DAM search structure and the optimal cache-oblivious search structure rapidly converge. This result demonstrates that for a multilevel memory hierarchy, a simple cache...

  5. Demography of exploited tree species in the Bolivian Amazon

    NARCIS (Netherlands)

    Zuidema, P.A.

    2000-01-01

    Tropical forests are threatened world-wide. Therefore, there is a search for ways to use the forests in a sustainable way, as this could assist in the conservation of these special ecosystems. Non-timber products collected from trees in tropical forests are often mentioned as examples of

  6. Application of neem tree in agriculture, industry, medicine, and ...

    African Journals Online (AJOL)

    The objective of this review was to consult and discuss the application of the Neem tree in agriculture, industry, Medicine, and the environment. Materials and Methods: Literature retrieval was performed on four databases: OVID; PUBMED; EBSCOhost, and EMBASE, and in the ISI Web of Science. Key words for the search ...

  7. TreeFam: 2008 Update

    DEFF Research Database (Denmark)

    Ruan, Jue; Li, Heng; Chen, Zhongzhong

    2008-01-01

    TreeFam (http://www.treefam.org) was developed to provide curated phylogenetic trees for all animal gene families, as well as orthologue and paralogue assignments. Release 4.0 of TreeFam contains curated trees for 1314 families and automatically generated trees for another 14,351 families. We have...... expanded TreeFam to include 25 fully sequenced animal genomes, as well as four genomes from plant and fungal outgroup species. We have also introduced more accurate approaches for automatically grouping genes into families, for building phylogenetic trees, and for inferring orthologues and paralogues....... The user interface for viewing phylogenetic trees and family information has been improved. Furthermore, a new perl API lets users easily extract data from the TreeFam mysql database....

  8. Visualization of Uncertain Contour Trees

    DEFF Research Database (Denmark)

    Kraus, Martin

    2010-01-01

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

  9. Random forest ensemble classification based fuzzy logic

    Science.gov (United States)

    Ben Ayed, Abdelkarim; Benhammouda, Marwa; Ben Halima, Mohamed; Alimi, Adel M.

    2017-03-01

    In this paper, we treat the supervised data classification, while using the fuzzy random forests that combine the hardiness of the decision trees, the power of the random selection that increases the diversity of the trees in the forest as well as the flexibility of the fuzzy logic for noise. We will be interested in the construction of a forest of fuzzy decision trees. Our system is validated on nine standard classification benchmarks from UCI repository and have the specificity to control some data, to reduce the rate of mistakes and to put in evidence more of hardiness and more of interoperability.

  10. Optimal search behavior and classic foraging theory

    Energy Technology Data Exchange (ETDEWEB)

    Bartumeus, F [Department of Ecology and Evolutionary Biology, Princeton University, Princeton, NJ (United States); Catalan, J [Centre d' Estudis Avancats de Blanes CEAB-CSIC, C/Acces a la Cala Sant Francesc 14, 17300 Blanes, Catalonia (Spain)

    2009-10-30

    Random walk methods and diffusion theory pervaded ecological sciences as methods to analyze and describe animal movement. Consequently, statistical physics was mostly seen as a toolbox rather than as a conceptual framework that could contribute to theory on evolutionary biology and ecology. However, the existence of mechanistic relationships and feedbacks between behavioral processes and statistical patterns of movement suggests that, beyond movement quantification, statistical physics may prove to be an adequate framework to understand animal behavior across scales from an ecological and evolutionary perspective. Recently developed random search theory has served to critically re-evaluate classic ecological questions on animal foraging. For instance, during the last few years, there has been a growing debate on whether search behavior can include traits that improve success by optimizing random (stochastic) searches. Here, we stress the need to bring together the general encounter problem within foraging theory, as a mean for making progress in the biological understanding of random searching. By sketching the assumptions of optimal foraging theory (OFT) and by summarizing recent results on random search strategies, we pinpoint ways to extend classic OFT, and integrate the study of search strategies and its main results into the more general theory of optimal foraging.

  11. Identification of Fruit Tree Compositions in Public Parks Structure. Warsaw Case Study

    Directory of Open Access Journals (Sweden)

    Tabita Teodora Lisandru

    2016-11-01

    Full Text Available Fruit trees are essential components of different types of greenery, including not only private gardens but also historical and modern public parks and gardens of many other cities. The research was carried out in spring 2016 by visiting different parks. Fruit trees were identified in 22 public parks of Warsaw situated in different districts of the city and picked up randomly for preliminary study. Observations were made by photographic documentation and mapping of the fruit trees on park plans using GPS coordinates which were taken during the site visit and Google Earth maps. According to the observations, selected fruit trees compositions have been recognized in public parks of Warsaw. The compositional structures that have been observed consist of solitaire fruit trees, groups of trees (containing fruit trees, but mostly composed of fruit trees and ornamental shrubs and linear structures of fruit trees (rows and alleys. The results of the preliminary study show that the most frequent fruit tree compositions used in the structure of selected public parks of Warsaw represent groups of trees - groups that consist of fruit trees and different species of ornamental shrubs. The undertaken study confirmed that fruit trees planted in the public parks of Warsaw have a high compositional value. They play an important role in the spatial arrangement of the parks selected, but also define the scope and borders of the selected garden interiors and create attractive sites.

  12. A Suffix Tree Or Not a Suffix Tree?

    DEFF Research Database (Denmark)

    Starikovskaya, Tatiana; Vildhøj, Hjalte Wedel

    2015-01-01

    In this paper we study the structure of suffix trees. Given an unlabeled tree r on n nodes and suffix links of its internal nodes, we ask the question “Is r a suffix tree?”, i.e., is there a string S whose suffix tree has the same topological structure as r? We place no restrictions on S......, in particular we do not require that S ends with a unique symbol. This corresponds to considering the more general definition of implicit or extended suffix trees. Such general suffix trees have many applications and are for example needed to allow efficient updates when suffix trees are built online. We prove...... that r is a suffix tree if and only if it is realized by a string S of length n - 1, and we give a linear-time algorithm for inferring S when the first letter on each edge is known. This generalizes the work of I et al....

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

  14. The Future of Systematics: Tree Thinking without the Tree

    OpenAIRE

    Velasco, Joel D.

    2012-01-01

    Phylogenetic trees are meant to represent the genealogical history of life and apparently derive their justification from the existence of the tree of life and the fact that evolutionary processes are treelike. However, there are a number of problems for these assumptions. Here it is argued that once we understand the important role that phylogenetic trees play as models that contain idealizations, we can accept these criticisms and deny the reality of the tree while justifying the continued ...

  15. The Inference of Gene Trees with Species Trees

    Science.gov (United States)

    Szöllősi, Gergely J.; Tannier, Eric; Daubin, Vincent; Boussau, Bastien

    2015-01-01

    This article reviews the various models that have been used to describe the relationships between gene trees and species trees. Molecular phylogeny has focused mainly on improving models for the reconstruction of gene trees based on sequence alignments. Yet, most phylogeneticists seek to reveal the history of species. Although the histories of genes and species are tightly linked, they are seldom identical, because genes duplicate, are lost or horizontally transferred, and because alleles can coexist in populations for periods that may span several speciation events. Building models describing the relationship between gene and species trees can thus improve the reconstruction of gene trees when a species tree is known, and vice versa. Several approaches have been proposed to solve the problem in one direction or the other, but in general neither gene trees nor species trees are known. Only a few studies have attempted to jointly infer gene trees and species trees. These models account for gene duplication and loss, transfer or incomplete lineage sorting. Some of them consider several types of events together, but none exists currently that considers the full repertoire of processes that generate gene trees along the species tree. Simulations as well as empirical studies on genomic data show that combining gene tree–species tree models with models of sequence evolution improves gene tree reconstruction. In turn, these better gene trees provide a more reliable basis for studying genome evolution or reconstructing ancestral chromosomes and ancestral gene sequences. We predict that gene tree–species tree methods that can deal with genomic data sets will be instrumental to advancing our understanding of genomic evolution. PMID:25070970

  16. Experimentos computacionales en un estudio de simulación de modelos de regresión para una mejor comprensión de las herramientas Random Forests y Conditional Trees

    OpenAIRE

    Rollón de Pinedo, Álvaro

    2016-01-01

    El presente Trabajo de Fin de Grado tiene como objetivo fundamental la realización de experimentos y simulaciones que permitan mejorar la comprensión que se posee de una de las herramientas estadísticas más potentes de las últimas décadas, especialmente en problemas de regresión y clasificación, los Random Forests. Los algoritmos de Bosques Aleatorios surgen como la evolución natural de los modelos estadísticos de árboles individuales de decisión, entre los cuales se pueden destacar dos pr...

  17. 28 CFR 511.15 - When searches will be conducted.

    Science.gov (United States)

    2010-07-01

    ... 28 Judicial Administration 2 2010-07-01 2010-07-01 false When searches will be conducted. 511.15... will be conducted. You and your belongings may be searched, either randomly or based on reasonable..., religion, national origin, or sex. (2) Non-inmates will be given the option of either consenting to random...

  18. P{owering 'Trees

    Indian Academy of Sciences (India)

    Melia dubia Cav. of Meliaceae is a large deciduous tree. Leaves are compound with toothed leaflets. Flowers are small, greenish-yellow in much-branched inflorescences. Fruits are green, ellipsoidal with a single seed covered by hard portion ( as in a mango fruit) and surrounded by fleshy pulp outside. The bark is bitter ...

  19. Trees for future forests

    DEFF Research Database (Denmark)

    Lobo, Albin

    Climate change creates new challenges in forest management. The increase in temperature may in the long run be beneficial for the forests in the northern latitudes, but the high rate at which climate change is predicted to proceed will make adaptation difficult because trees are long living sessi...

  20. Multiscale singularity trees

    DEFF Research Database (Denmark)

    Somchaipeng, Kerawit; Sporring, Jon; Johansen, Peter

    2007-01-01

    We propose MultiScale Singularity Trees (MSSTs) as a structure to represent images, and we propose an algorithm for image comparison based on comparing MSSTs. The algorithm is tested on 3 public image databases and compared to 2 state-of-theart methods. We conclude that the computational complexi...

  1. Formal fault tree semantics

    OpenAIRE

    Schellhorn, Gerhard

    2002-01-01

    Formal fault tree semantics / G. Schellhorn, A. Thums, and W. Reif. - In: IDPT : Proceedings of the Sixth World Conference on Integrated Design and Process Technology : June 23 - 27, 2003, Pasadena, California / SDPS, Society for Design & Process Science. - 2002. - 1CD-ROM

  2. How to Prune Trees

    Science.gov (United States)

    Peter Bedker; Joseph O' Brien; Manfred Mielke

    2012-01-01

    The objective of pruning is to produce strong, healthy, attractive plants. By understanding how, when and why to prune, and by following a few simple principles, this objective can be achievedHow to Prune Trees (Revised 2012) Agency Publisher: Agriculture Dept., Forest Service, Northeastern Area State and Price forestry USA List Price:$4.00 Sale...

  3. Portraits of Tree Families

    NARCIS (Netherlands)

    Balgooy, van M.M.J.

    1998-01-01

    With the publication of the second volume of the series ‘Malesian Seed Plants’, entitled ‘Portraits of Tree Families’, I would like to refer to the Introduction of the first volume, ‘Spot-characters’ for a historical background and an explanation of the aims of this series. The present book treats

  4. Christmas Tree Pest Manual

    Science.gov (United States)

    Department of Entomology Michigan State University

    1998-01-01

    This manual can help you identify and control damaging Christmas tree pests in the North Central region of the United States. Most of the information also applies to the northeastern states and to the southern portions of the Canadian Provinces that border these states. You do not have to be a pest specialist to use this information; we wrote the manual in everyday...

  5. Phylogenics & Tree-Thinking

    Science.gov (United States)

    Baum, David A.; Offner, Susan

    2008-01-01

    Phylogenetic trees, which are depictions of the inferred evolutionary relationships among a set of species, now permeate almost all branches of biology and are appearing in increasing numbers in biology textbooks. While few state standards explicitly require knowledge of phylogenetics, most require some knowledge of evolutionary biology, and many…

  6. Monotone Decision Trees

    NARCIS (Netherlands)

    J.C. Bioch (Cor); T. Petter; R. Potharst (Rob)

    1997-01-01

    textabstractEUR-FEW-CS-97-07 Title Monotone decision trees Author(s) R. Potharst J.C. Bioch T. Petter Abstract In many classification problems the domains of the attributes and the classes are linearly ordered. Often, classification must preserve this ordering: this is called monotone

  7. Chapter 5 - Tree Mortality

    Science.gov (United States)

    Mark J. Ambrose

    2014-01-01

    Tree mortality is a natural process in all forest ecosystems. Extremely high mortality, however, can also 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....

  8. Certified Kruskal's Tree Theorem

    Directory of Open Access Journals (Sweden)

    Christian Sternagel

    2014-07-01

    Full Text Available This article presents the first formalization of Kurskal's tree theorem in aproof assistant. The Isabelle/HOL development is along the lines of Nash-Williams' original minimal bad sequence argument for proving the treetheorem. Along the way, proofs of Dickson's lemma and Higman's lemma, as well as some technical details of the formalization are discussed.

  9. Riparian Ficus tree communities: the distribution and abundance of riparian fig trees in northern Thailand.

    Directory of Open Access Journals (Sweden)

    Pornwiwan Pothasin

    Full Text Available Fig trees (Ficus are often ecologically significant keystone species because they sustain populations of the many seed-dispersing animals that feed on their fruits. They are prominent components of riparian zones where they may also contribute to bank stability as well as supporting associated animals. The diversity and distributions of riparian fig trees in deciduous and evergreen forests in Chiang Mai Province, Northern Thailand were investigated in 2010-2012. To record the diversity and abundance of riparian fig trees, we (1 calculated stem density, species richness, and diversity indices in 20×50 m randomly selected quadrats along four streams and (2 measured the distances of individual trees from four streams to determine if species exhibit distinct distribution patterns within riparian zones. A total of 1169 individuals (from c. 4 ha were recorded in the quadrats, representing 33 Ficus species (13 monoecious and 20 dioecious from six sub-genera and about 70% of all the species recorded from northern Thailand. All 33 species had at least some stems in close proximity to the streams, but they varied in their typical proximity, with F. squamosa Roxb. and F. ischnopoda Miq the most strictly stream-side species. The riparian forests in Northern Thailand support a rich diversity and high density of Ficus species and our results emphasise the importance of fig tree within the broader priorities of riparian area conservation. Plans to maintain or restore properly functioning riparian forests need to take into account their significance.

  10. Tree Transduction Tools for Cdec

    Directory of Open Access Journals (Sweden)

    Austin Matthews

    2014-09-01

    Full Text Available We describe a collection of open source tools for learning tree-to-string and tree-to-tree transducers and the extensions to the cdec decoder that enable translation with these. Our modular, easy-to-extend tools extract rules from trees or forests aligned to strings and trees subject to different structural constraints. A fast, multithreaded implementation of the Cohn and Blunsom (2009 model for extracting compact tree-to-string rules is also included. The implementation of the tree composition algorithm used by cdec is described, and translation quality and decoding time results are presented. Our experimental results add to the body of evidence suggesting that tree transducers are a compelling option for translation, particularly when decoding speed and translation model size are important.

  11. Graph Extremities Defined by Search Algorithms

    Directory of Open Access Journals (Sweden)

    Jean-Paul Bordat

    2010-03-01

    Full Text Available Graph search algorithms have exploited graph extremities, such as the leaves of a tree and the simplicial vertices of a chordal graph. Recently, several well-known graph search algorithms have been collectively expressed as two generic algorithms called MLS and MLSM. In this paper, we investigate the properties of the vertex that is numbered 1 by MLS on a chordal graph and by MLSM on an arbitrary graph. We explain how this vertex is an extremity of the graph. Moreover, we show the remarkable property that the minimal separators included in the neighborhood of this vertex are totally ordered by inclusion.

  12. Quantum walks and search algorithms

    CERN Document Server

    Portugal, Renato

    2013-01-01

    This book addresses an interesting area of quantum computation called quantum walks, which play an important role in building quantum algorithms, in particular search algorithms. Quantum walks are the quantum analogue of classical random walks. It is known that quantum computers have great power for searching unsorted databases. This power extends to many kinds of searches, particularly to the problem of finding a specific location in a spatial layout, which can be modeled by a graph. The goal is to find a specific node knowing that the particle uses the edges to jump from one node to the next. This book is self-contained with main topics that include: Grover's algorithm, describing its geometrical interpretation and evolution by means of the spectral decomposition of the evolution operater Analytical solutions of quantum walks on important graphs like line, cycles, two-dimensional lattices, and hypercubes using Fourier transforms Quantum walks on generic graphs, describing methods to calculate the limiting d...

  13. Comparison of decision tree methods for finding active objects

    Science.gov (United States)

    Zhao, Yongheng; Zhang, Yanxia

    The automated classification of objects from large catalogs or survey projects is an important task in many astronomical surveys. Faced with various classification algorithms, astronomers should select the method according to their requirements. Here we describe several kinds of decision trees for finding active objects by multi-wavelength data, such as REPTree, Random Tree, Decision Stump, Random Forest, J48, NBTree, AdTree. All decision tree approaches investigated are in the WEKA package. The classification performance of the methods is presented. In the process of classification by decision tree methods, the classification rules are easily obtained, moreover these rules are clear and easy to understand for astronomers. As a result, astronomers are inclined to prefer and apply them, thus know which attributes are important to discriminate celestial objects. The experimental results show that when various decision trees are applied in discriminating active objects (quasars, BL Lac objects and active galaxies) from non-active objects (stars and galaxies), ADTree is the best only in terms of accuracy, Decision Stump is the best only considering speed, J48 is the optimal choice considering both accuracy and speed.

  14. Distance labeling schemes for trees

    DEFF Research Database (Denmark)

    Alstrup, Stephen; Gørtz, Inge Li; Bistrup Halvorsen, Esben

    2016-01-01

    We consider distance labeling schemes for trees: given a tree with n nodes, label the nodes with binary strings such that, given the labels of any two nodes, one can determine, by looking only at the labels, the distance in the tree between the two nodes. A lower bound by Gavoille et al. [Gavoill...

  15. Training and Pruning Apple Trees

    OpenAIRE

    Marini, Richard P. (Richard Paul), 1952-

    2009-01-01

    Discusses the pruning and training of apple trees, placing emphasis on proper training of young trees to save time and the expense of future pruning, and to produce earlier profitable crops. Advises about the best techniques for pruning in relation to age of the apple tree.

  16. TAG: A tree-assisted gossip protocol for on-demand video streaming

    OpenAIRE

    Zhou, Ming

    2005-01-01

    While a tree topology is often advocated for overlay video streaming due to its scalability, it suffers from discontinuous playback under highly dynamic network environments. On the other hand, gossip protocols using random message dissemination, though robust, fail to meet the real-time constraints for streaming applications. In this master thesis, I proposed TAG, a Tree-Assisted Gossip protocol, which adopts a tree structure with time indexing to accommodate asynchronous requests, and an ef...

  17. Greedy heuristics for minimization of number of terminal nodes in decision trees

    KAUST Repository

    Hussain, Shahid

    2014-10-01

    This paper describes, in detail, several greedy heuristics for construction of decision trees. We study the number of terminal nodes of decision trees, which is closely related with the cardinality of the set of rules corresponding to the tree. We compare these heuristics empirically for two different types of datasets (datasets acquired from UCI ML Repository and randomly generated data) as well as compare with the optimal results obtained using dynamic programming method.

  18. Randomization tests

    CERN Document Server

    Edgington, Eugene

    2007-01-01

    Statistical Tests That Do Not Require Random Sampling Randomization Tests Numerical Examples Randomization Tests and Nonrandom Samples The Prevalence of Nonrandom Samples in Experiments The Irrelevance of Random Samples for the Typical Experiment Generalizing from Nonrandom Samples Intelligibility Respect for the Validity of Randomization Tests Versatility Practicality Precursors of Randomization Tests Other Applications of Permutation Tests Questions and Exercises Notes References Randomized Experiments Unique Benefits of Experiments Experimentation without Mani

  19. A deterministic model for the growth of non-conducting electrical tree structures

    CERN Document Server

    Dodd, S J

    2003-01-01

    Electrical treeing is of interest to the electrical generation, transmission and distribution industries as it is one of the causes of insulation failure in electrical machines, switchgear and transformer bushings. In this paper a deterministic electrical tree growth model is described. The model is based on electrostatics and local electron avalanches to model partial discharge activity within the growing tree structure. Damage to the resin surrounding the tree structure is dependent on the local electrostatic energy dissipation by partial discharges within the tree structure and weighted by the magnitudes of the local electric fields in the resin surrounding the tree structure. The model is successful in simulating the formation of branched structures without the need of a random variable, a requirement of previous stochastic models. Instability in the spatial development of partial discharges within the tree structure takes the role of the stochastic element as used in previous models to produce branched t...

  20. Comparison of Greedy Algorithms for Decision Tree Optimization

    KAUST Repository

    Alkhalid, Abdulaziz

    2013-01-01

    This chapter is devoted to the study of 16 types of greedy algorithms for decision tree construction. The dynamic programming approach is used for construction of optimal decision trees. Optimization is performed relative to minimal values of average depth, depth, number of nodes, number of terminal nodes, and number of nonterminal nodes of decision trees. We compare average depth, depth, number of nodes, number of terminal nodes and number of nonterminal nodes of constructed trees with minimum values of the considered parameters obtained based on a dynamic programming approach. We report experiments performed on data sets from UCI ML Repository and randomly generated binary decision tables. As a result, for depth, average depth, and number of nodes we propose a number of good heuristics. © Springer-Verlag Berlin Heidelberg 2013.

  1. Contrasting natural regeneration and tree planting in fourteen North American cities

    Science.gov (United States)

    David J. Nowak

    2012-01-01

    Field data from randomly located plots in 12 cities in the United States and Canada were used to estimate the proportion of the existing tree population that was planted or occurred via natural regeneration. In addition, two cities (Baltimore and Syracuse) were recently re-sampled to estimate the proportion of newly established trees that were planted. Results for the...

  2. root rot disease of five fruit tree seedlings in the nursery

    African Journals Online (AJOL)

    KAMALDEEN

    out on the 5 fruit trees with the 10 isolated fungi. The 5 fruit tree seedlings were then potted in polypots filled with forest soil. The disease organisms were confirmed by. Koch's postulates. The experiment was laid out in a completely randomized design replicated three times. Fusarium oxysporum and Aspergillus flavus were ...

  3. Tree species exhibit complex patterns of distribution in bottomland hardwood forests

    Science.gov (United States)

    Luben D Dimov; Jim L Chambers; Brian R. Lockhart

    2013-01-01

    & Context Understanding tree interactions requires an insight into their spatial distribution. & Aims We looked for presence and extent of tree intraspecific spatial point pattern (random, aggregated, or overdispersed) and interspecific spatial point pattern (independent, aggregated, or segregated). & Methods We established twelve 0.64-ha plots in natural...

  4. Influence of tree spatial pattern and sample plot type and size on inventory

    Science.gov (United States)

    John-Pascall Berrill; Kevin L. O' Hara

    2012-01-01

    Sampling with different plot types and sizes was simulated using tree location maps and data collected in three even-aged coast redwood (Sequoia sempervirens) stands selected to represent uniform, random, and clumped spatial patterns of tree locations. Fixed-radius circular plots, belt transects, and variable-radius plots were installed by...

  5. Probability distribution of long-run indiscriminate felling of trees in ...

    African Journals Online (AJOL)

    The study was undertaken to determine the probability distribution of Long-run indiscriminate felling of trees in northern senatorial district of Adamawa State. Specifically, the study focused on examining the future direction of indiscriminate felling of trees as well as its equilibrium distribution. A multi-stage and simple random ...

  6. Google Ajax Search API

    CERN Document Server

    Fitzgerald, Michael

    2007-01-01

    Use the Google Ajax Search API to integrateweb search, image search, localsearch, and other types of search intoyour web site by embedding a simple, dynamicsearch box to display search resultsin your own web pages using a fewlines of JavaScript. For those who do not want to write code,the search wizards and solutions builtwith the Google Ajax Search API generatecode to accomplish common taskslike adding local search results to a GoogleMaps API mashup, adding videosearch thumbnails to your web site, oradding a news reel with the latest up todate stories to your blog. More advanced users can

  7. YBYRÁ facilitates comparison of large phylogenetic trees.

    Science.gov (United States)

    Machado, Denis Jacob

    2015-07-01

    The number and size of tree topologies that are being compared by phylogenetic systematists is increasing due to technological advancements in high-throughput DNA sequencing. However, we still lack tools to facilitate comparison among phylogenetic trees with a large number of terminals. The "YBYRÁ" project integrates software solutions for data analysis in phylogenetics. It comprises tools for (1) topological distance calculation based on the number of shared splits or clades, (2) sensitivity analysis and automatic generation of sensitivity plots and (3) clade diagnoses based on different categories of synapomorphies. YBYRÁ also provides (4) an original framework to facilitate the search for potential rogue taxa based on how much they affect average matching split distances (using MSdist). YBYRÁ facilitates comparison of large phylogenetic trees and outperforms competing software in terms of usability and time efficiency, specially for large data sets. The programs that comprises this toolkit are written in Python, hence they do not require installation and have minimum dependencies. The entire project is available under an open-source licence at http://www.ib.usp.br/grant/anfibios/researchSoftware.html .

  8. tropiTree: an NGS-based EST-SSR resource for 24 tropical tree species.

    Directory of Open Access Journals (Sweden)

    Joanne R Russell

    Full Text Available The development of genetic tools for non-model organisms has been hampered by cost, but advances in next-generation sequencing (NGS have created new opportunities. In ecological research, this raises the prospect for developing molecular markers to simultaneously study important genetic processes such as gene flow in multiple non-model plant species within complex natural and anthropogenic landscapes. Here, we report the use of bar-coded multiplexed paired-end Illumina NGS for the de novo development of expressed sequence tag-derived simple sequence repeat (EST-SSR markers at low cost for a range of 24 tree species. Each chosen tree species is important in complex tropical agroforestry systems where little is currently known about many genetic processes. An average of more than 5,000 EST-SSRs was identified for each of the 24 sequenced species, whereas prior to analysis 20 of the species had fewer than 100 nucleotide sequence citations. To make results available to potential users in a suitable format, we have developed an open-access, interactive online database, tropiTree (http://bioinf.hutton.ac.uk/tropiTree, which has a range of visualisation and search facilities, and which is a model for the efficient presentation and application of NGS data.

  9. tropiTree: an NGS-based EST-SSR resource for 24 tropical tree species.

    Science.gov (United States)

    Russell, Joanne R; Hedley, Peter E; Cardle, Linda; Dancey, Siobhan; Morris, Jenny; Booth, Allan; Odee, David; Mwaura, Lucy; Omondi, William; Angaine, Peter; Machua, Joseph; Muchugi, Alice; Milne, Iain; Kindt, Roeland; Jamnadass, Ramni; Dawson, Ian K

    2014-01-01

    The development of genetic tools for non-model organisms has been hampered by cost, but advances in next-generation sequencing (NGS) have created new opportunities. In ecological research, this raises the prospect for developing molecular markers to simultaneously study important genetic processes such as gene flow in multiple non-model plant species within complex natural and anthropogenic landscapes. Here, we report the use of bar-coded multiplexed paired-end Illumina NGS for the de novo development of expressed sequence tag-derived simple sequence repeat (EST-SSR) markers at low cost for a range of 24 tree species. Each chosen tree species is important in complex tropical agroforestry systems where little is currently known about many genetic processes. An average of more than 5,000 EST-SSRs was identified for each of the 24 sequenced species, whereas prior to analysis 20 of the species had fewer than 100 nucleotide sequence citations. To make results available to potential users in a suitable format, we have developed an open-access, interactive online database, tropiTree (http://bioinf.hutton.ac.uk/tropiTree), which has a range of visualisation and search facilities, and which is a model for the efficient presentation and application of NGS data.

  10. Global value trees.

    Directory of Open Access Journals (Sweden)

    Zhen Zhu

    Full Text Available The fragmentation of production across countries has become an important feature of the globalization in recent decades and is often conceptualized by the term "global value chains" (GVCs. When empirically investigating the GVCs, previous studies are mainly interested in knowing how global the GVCs are rather than how the GVCs look like. From a complex networks perspective, we use the World Input-Output Database (WIOD to study the evolution of the global production system. We find that the industry-level GVCs are indeed not chain-like but are better characterized by the tree topology. Hence, we compute the global value trees (GVTs for all the industries available in the WIOD. Moreover, we compute an industry importance measure based on the GVTs and compare it with other network centrality measures. Finally, we discuss some future applications of the GVTs.

  11. 24 Ways to Kill a Tree

    OpenAIRE

    Appleton, Bonnie Lee, 1948-2012

    2009-01-01

    Few residential trees die of old age. Mechanical damage and improper tree care kill more trees than any insects or diseases. This publication shows 24 ways to void making the tree-damaging mistake. Few of these items alone would kill a tree, but multiple problems will certainly stress, and could eventually kill, a tree.

  12. Wood for the trees

    Directory of Open Access Journals (Sweden)

    Rob Garbutt

    2013-10-01

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

  13. Submodular unsplittable flow on trees

    DEFF Research Database (Denmark)

    Adamaszek, Anna Maria; Chalermsook, Parinya; Ene, Alina

    2016-01-01

    We study the Unsplittable Flow problem (UFP) on trees with a submodular objective function. The input to this problem is a tree with edge capacities and a collection of tasks, each characterized by a source node, a sink node, and a demand. A subset of the tasks is feasible if the tasks can...... simultaneously send their demands from the source to the sink without violating the edge capacities. The goal is to select a feasible subset of the tasks that maximizes a submodular objective function. Our main result is an O(k log n)-approximation algorithm for Submodular UFP on trees where k denotes...... the pathwidth of the given tree. Since every tree has pathwidth O(log n), we obtain an O(log2 n) approximation for arbitrary trees. This is the first non-trivial approximation guarantee for the problem and it matches the best approximation known for UFP on trees with a linear objective function. Our main...

  14. (Almost) practical tree codes

    KAUST Repository

    Khina, Anatoly

    2016-08-15

    We consider the problem of stabilizing an unstable plant driven by bounded noise over a digital noisy communication link, a scenario at the heart of networked control. To stabilize such a plant, one needs real-time encoding and decoding with an error probability profile that decays exponentially with the decoding delay. The works of Schulman and Sahai over the past two decades have developed the notions of tree codes and anytime capacity, and provided the theoretical framework for studying such problems. Nonetheless, there has been little practical progress in this area due to the absence of explicit constructions of tree codes with efficient encoding and decoding algorithms. Recently, linear time-invariant tree codes were proposed to achieve the desired result under maximum-likelihood decoding. In this work, we take one more step towards practicality, by showing that these codes can be efficiently decoded using sequential decoding algorithms, up to some loss in performance (and with some practical complexity caveats). We supplement our theoretical results with numerical simulations that demonstrate the effectiveness of the decoder in a control system setting.

  15. Active Flows on Trees

    Science.gov (United States)

    Forrow, Aden; Woodhouse, Francis; Dunkel, Joern

    Coherent, large scale dynamics in many nonequilibrium physical, biological, or information transport networks are driven by small-scale local energy input. We introduce and explore a generic model for compressible active flows on tree networks. In contrast to thermally-driven systems, active friction selects discrete states with only a small number of oscillation modes activated at distinct fixed amplitudes. This state selection interacts with graph topology to produce different localized dynamical time scales in separate regions of large networks. Using perturbation theory, we systematically predict the stationary states of noisy networks and find good agreement with a Bayesian state estimation based on a hidden Markov model applied to simulated time series data on binary trees. While the number of stable states per tree scales exponentially with the number of edges, the mean number of activated modes in each state averages 1 / 4 the number of edges. More broadly, these results suggest that the macroscopic response of active networks, from actomyosin force networks in cells to cytoplasmic flows, can be dominated by a significantly reduced number of modes, in stark contrast to energy equipartition in thermal equilibrium systems.

  16. Neural network design with combined backpropagation and creeping random search learning algorithms applied to the determination of retained austenite in TRIP steels; Diseno de redes neuronales con aprendizaje combinado de retropropagacion y busqueda aleatoria progresiva aplicado a la determinacion de austenita retenida en aceros TRIP

    Energy Technology Data Exchange (ETDEWEB)

    Toda-Caraballo, I.; Garcia-Mateo, C.; Capdevila, C.

    2010-07-01

    At the beginning of the decade of the nineties, the industrial interest for TRIP steels leads to a significant increase of the investigation and application in this field. In this work, the flexibility of neural networks for the modelling of complex properties is used to tackle the problem of determining the retained austenite content in TRIP-steel. Applying a combination of two learning algorithms (backpropagation and creeping-random-search) for the neural network, a model has been created that enables the prediction of retained austenite in low-Si / low-Al multiphase steels as a function of processing parameters. (Author). 34 refs.

  17. How doctors search

    DEFF Research Database (Denmark)

    Lykke, Marianne; Price, Susan; Delcambre, Lois

    2012-01-01

    Professional, workplace searching is different from general searching, because it is typically limited to specific facets and targeted to a single answer. We have developed the semantic component (SC) model, which is a search feature that allows searchers to structure and specify the search...... to context-specific aspects of the main topic of the documents. We have tested the model in an interactive searching study with family doctors with the purpose to explore doctors’ querying behaviour, how they applied the means for specifying a search, and how these features contributed to the search outcome....... In general, the doctors were capable of exploiting system features and search tactics during the searching. Most searchers produced well-structured queries that contained appropriate search facets. When searches failed it was not due to query structure or query length. Failures were mostly caused by the well...

  18. When Gravity Fails: Local Search Topology

    Science.gov (United States)

    Frank, Jeremy; Cheeseman, Peter; Stutz, John; Lau, Sonie (Technical Monitor)

    1997-01-01

    Local search algorithms for combinatorial search problems frequently encounter a sequence of states in which it is impossible to improve the value of the objective function; moves through these regions, called {\\em plateau moves), dominate the time spent in local search. We analyze and characterize {\\em plateaus) for three different classes of randomly generated Boolean Satisfiability problems. We identify several interesting features of plateaus that impact the performance of local search algorithms. We show that local minima tend to be small but occasionally may be very large. We also show that local minima can be escaped without unsatisfying a large number of clauses, but that systematically searching for an escape route may be computationally expensive if the local minimum is large. We show that plateaus with exits, called benches, tend to be much larger than minima, and that some benches have very few exit states which local search can use to escape. We show that the solutions (i.e. global minima) of randomly generated problem instances form clusters, which behave similarly to local minima. We revisit several enhancements of local search algorithms and explain their performance in light of our results. Finally we discuss strategies for creating the next generation of local search algorithms.

  19. Lévy walks for autonomous search

    Science.gov (United States)

    Flenner, Arjuna; Flenner, Jennifer; Bobinchak, James; Mercier, David; Le, Anhtuan; Estabridis, Katia; Hewer, Gary

    2012-06-01

    A canonical problem for autonomy is search and discovery. Often, searching needs to be unpredictable in order to be effective. In this paper, we investigate and compare the effectiveness of the traditional and predictable lawnmower search strategy to that of a random search. Specifically the family of searches with paths determined by heavy tailed distributions called Lévy stable searches is investigated. These searches are characterized by long flight paths, followed by a new random direction, with the flight path lengths determined by the distribution parameter α. Two basic search scenarios are considered in this study: stationary targets, and moving targets, both on planar surfaces. Monte-Carlo simulations demonstrate the advantages of Lévy over the lawnmower strategy especially for moving targets. Ultimately to corroborate the suitability of the Lévy strategy for UAVs, we implement and demonstrate the feasibility of the algorithm in the Multiple Unified Simulation Environment (MUSE), which includes vehicle's constraints and dynamics. The MUSE / Air Force Synthetic Environment for Reconnaissance and Surveillance (AFSERS) simulation system is the primary virtual ISR and UAV simulation within DOD for command and staff level training for the Joint Services.

  20. Tree species composition, structure and utilisation in Maruzi Hills ...

    African Journals Online (AJOL)

    The study investigated the tree species composition, vegetation structure and harvesting pattern to guide management of the Maruzi Hills Forest Reserve. Stratified random sampling was used to site six (100 m × 100 m) permanent sample plots in the woodland, bushland and grassland vegetation types identified in the ...

  1. Arsenical poisoning of fruit trees

    Energy Technology Data Exchange (ETDEWEB)

    Headden, W.P.

    1910-01-01

    Corrosive arsenical poisoning attacks the tree at the crown, below the surface of the soil and usually involves the large roots also. Pear and apple trees are affected; the pear tree is, at least, as susceptible to the action of the arsenic as the apple tree. Some varieties of pears, as well as apples, seem more susceptible than others, but this is true only in a general way. The age of the tree at the time the first applications were made seems to have some effect upon the resisting power of the bark. The variety of soil may have some influence but it is not pronounced enough to be recognized with certainty. The first sign of trouble in the apple tree is an early ripening of the leaves, at least, one year before the death of the tree; in pear trees the foilage ripens early and assumes a deep purple color. The amount of arsenic present in the destroyed bark and in the woody tissues of such trees is as great as in cases in which it is known that arsenic was the cause of death. The trouble is very general throughout the state and occurs in all kinds of soils which fact eliminates the question of seepage and, to a large extent, that of alkalis. In the case of trees which have not been sprayed but which have been grown as fillers in sprayed orchards, the wood contained arsenic. This is true, too, of young trees grown in soil which contains arsenic. This shows that the arsenic may be taken up with the nitrient solutions. The fruit grown on such trees, apples and pears, contain arsenic and also the leaves. The fruit and leaves grow and are shed each season; this is not the case with the woody portions of the tree. Systemic poisoning is produced by this arsenic distributed throughout the tree, interfering with nutrition and growth of the three and in some cases causing its death.

  2. Rate of tree carbon accumulation increases continuously with tree size

    Science.gov (United States)

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

    2014-01-01

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

  3. Classification of Different Degrees of Disability Following Intracerebral Hemorrhage: A Decision Tree Analysis from VISTA-ICH Collaboration.

    Science.gov (United States)

    Phan, Thanh G; Chen, Jian; Beare, Richard; Ma, Henry; Clissold, Benjamin; Van Ly, John; Srikanth, Velandai

    2017-01-01

    Prognostication following intracerebral hemorrhage (ICH) has focused on poor outcome at the expense of lumping together mild and moderate disability. We aimed to develop a novel approach at classifying a range of disability following ICH. The Virtual International Stroke Trial Archive collaboration database was searched for patients with ICH and known volume of ICH on baseline CT scans. Disability was partitioned into mild [modified Rankin Scale (mRS) at 90 days of 0-2], moderate (mRS = 3-4), and severe disabilities (mRS = 5-6). We used binary and trichotomy decision tree methodology. The data were randomly divided into training (2/3 of data) and validation (1/3 data) datasets. The area under the receiver operating characteristic curve (AUC) was used to calculate the accuracy of the decision tree model. We identified 957 patients, age 65.9 ± 12.3 years, 63.7% males, and ICH volume 22.6 ± 22.1 ml. The binary tree showed that lower ICH volume (27.9 ml), older age (>69.5 years), and low Glasgow Coma Scale (tree showed that ICH volume, age, and serum glucose can separate mild, moderate, and severe disability groups with AUC 0.79 (95% CI 0.71-0.87). Both the binary and trichotomy methods provide equivalent discrimination of disability outcome after ICH. The trichotomy method can classify three categories at once, whereas this action was not possible with the binary method. The trichotomy method may be of use to clinicians and trialists for classifying a range of disability in ICH.

  4. Automated method for identification and artery-venous classification of vessel trees in retinal vessel networks.

    Directory of Open Access Journals (Sweden)

    Vinayak S Joshi

    Full Text Available The separation of the retinal vessel network into distinct arterial and venous vessel trees is of high interest. We propose an automated method for identification and separation of retinal vessel trees in a retinal color image by converting a vessel segmentation image into a vessel segment map and identifying the individual vessel trees by graph search. Orientation, width, and intensity of each vessel segment are utilized to find the optimal graph of vessel segments. The separated vessel trees are labeled as primary vessel or branches. We utilize the separated vessel trees for arterial-venous (AV classification, based on the color properties of the vessels in each tree graph. We applied our approach to a dataset of 50 fundus images from 50 subjects. The proposed method resulted in an accuracy of 91.44% correctly classified vessel pixels as either artery or vein. The accuracy of correctly classified major vessel segments was 96.42%.

  5. Short-term Internet search using makes people rely on search engines when facing unknown issues.

    Science.gov (United States)

    Wang, Yifan; Wu, Lingdan; Luo, Liang; Zhang, Yifen; Dong, Guangheng

    2017-01-01

    The Internet search engines, which have powerful search/sort functions and ease of use features, have become an indispensable tool for many individuals. The current study is to test whether the short-term Internet search training can make people more dependent on it. Thirty-one subjects out of forty subjects completed the search training study which included a pre-test, a six-day's training of Internet search, and a post-test. During the pre- and post- tests, subjects were asked to search online the answers to 40 unusual questions, remember the answers and recall them in the scanner. Un-learned questions were randomly presented at the recalling stage in order to elicited search impulse. Comparing to the pre-test, subjects in the post-test reported higher impulse to use search engines to answer un-learned questions. Consistently, subjects showed higher brain activations in dorsolateral prefrontal cortex and anterior cingulate cortex in the post-test than in the pre-test. In addition, there were significant positive correlations self-reported search impulse and brain responses in the frontal areas. The results suggest that a simple six-day's Internet search training can make people dependent on the search tools when facing unknown issues. People are easily dependent on the Internet search engines.

  6. Short-term Internet search using makes people rely on search engines when facing unknown issues.

    Directory of Open Access Journals (Sweden)

    Yifan Wang

    Full Text Available The Internet search engines, which have powerful search/sort functions and ease of use features, have become an indispensable tool for many individuals. The current study is to test whether the short-term Internet search training can make people more dependent on it. Thirty-one subjects out of forty subjects completed the search training study which included a pre-test, a six-day's training of Internet search, and a post-test. During the pre- and post- tests, subjects were asked to search online the answers to 40 unusual questions, remember the answers and recall them in the scanner. Un-learned questions were randomly presented at the recalling stage in order to elicited search impulse. Comparing to the pre-test, subjects in the post-test reported higher impulse to use search engines to answer un-learned questions. Consistently, subjects showed higher brain activations in dorsolateral prefrontal cortex and anterior cingulate cortex in the post-test than in the pre-test. In addition, there were significant positive correlations self-reported search impulse and brain responses in the frontal areas. The results suggest that a simple six-day's Internet search training can make people dependent on the search tools when facing unknown issues. People are easily dependent on the Internet search engines.

  7. submitter Searches at LEP

    CERN Document Server

    Kawagoe, Kiyotomo

    2001-01-01

    Searches for new particles and new physics were extensively performed at LEP. Although no evidence for new particle/physics was discovered, the null results set very stringent limits to theories beyond the standard model. In this paper, searches at LEP and anomalies observed in the searches are presented. Future prospect of searches at the new energy frontier machines is also discussed.

  8. Web Search Engines

    OpenAIRE

    Rajashekar, TB

    1998-01-01

    The World Wide Web is emerging as an all-in-one information source. Tools for searching Web-based information include search engines, subject directories and meta search tools. We take a look at key features of these tools and suggest practical hints for effective Web searching.

  9. Sound Search Engine Concept

    DEFF Research Database (Denmark)

    2006-01-01

    Sound search is provided by the major search engines, however, indexing is text based, not sound based. We will establish a dedicated sound search services with based on sound feature indexing. The current demo shows the concept of the sound search engine. The first engine will be realased June...

  10. Radiofrequency radiation injures trees around mobile phone base stations.

    Science.gov (United States)

    Waldmann-Selsam, Cornelia; Balmori-de la Puente, Alfonso; Breunig, Helmut; Balmori, Alfonso

    2016-12-01

    In the last two decades, the deployment of phone masts around the world has taken place and, for many years, there has been a discussion in the scientific community about the possible environmental impact from mobile phone base stations. Trees have several advantages over animals as experimental subjects and the aim of this study was to verify whether there is a connection between unusual (generally unilateral) tree damage and radiofrequency exposure. To achieve this, a detailed long-term (2006-2015) field monitoring study was performed in the cities of Bamberg and Hallstadt (Germany). During monitoring, observations and photographic recordings of unusual or unexplainable tree damage were taken, alongside the measurement of electromagnetic radiation. In 2015 measurements of RF-EMF (Radiofrequency Electromagnetic Fields) were carried out. A polygon spanning both cities was chosen as the study site, where 144 measurements of the radiofrequency of electromagnetic fields were taken at a height of 1.5m in streets and parks at different locations. By interpolation of the 144 measurement points, we were able to compile an electromagnetic map of the power flux density in Bamberg and Hallstadt. We selected 60 damaged trees, in addition to 30 randomly selected trees and 30 trees in low radiation areas (n=120) in this polygon. The measurements of all trees revealed significant differences between the damaged side facing a phone mast and the opposite side, as well as differences between the exposed side of damaged trees and all other groups of trees in both sides. Thus, we found that side differences in measured values of power flux density corresponded to side differences in damage. The 30 selected trees in low radiation areas (no visual contact to any phone mast and power flux density under 50μW/m2) showed no damage. Statistical analysis demonstrated that electromagnetic radiation from mobile phone masts is harmful for trees. These results are consistent with the fact that

  11. Completely Independent Spanning Trees in (Partial k-Trees

    Directory of Open Access Journals (Sweden)

    Matsushita Masayoshi

    2015-08-01

    Full Text Available Two spanning trees T1 and T2 of a graph G are completely independent if, for any two vertices u and v, the paths from u to v in T1 and T2 are internally disjoint. For a graph G, we denote the maximum number of pairwise completely independent spanning trees by cist(G. In this paper, we consider cist(G when G is a partial k-tree.

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

    Science.gov (United States)

    G.H. Donovan; D.T. Butry

    2010-01-01

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

  13. Public health and pipe breaks in water distribution systems: analysis with internet search volume as a proxy.

    Science.gov (United States)

    Shortridge, Julie E; Guikema, Seth D

    2014-04-15

    Drinking water distribution infrastructure has been identified as a factor in waterborne disease outbreaks and improved understanding of the public health risks associated with distribution system failures has been identified as a priority area for research. Pipe breaks may pose a risk, as their occurrence and repair can result in low or negative pressure, potentially allowing contamination of drinking water from adjacent soils. However, measuring this phenomenon is challenging because the most likely health impact is mild gastrointestinal (GI) illness, which is unlikely to result in a doctor or hospital visit. Here we present a novel method that uses data mining techniques and internet search volume to assess the relationship between pipe breaks and symptoms of GI illness in two U.S. cities. Weekly search volume for the terms diarrhea and vomiting was used as the response variable with the number of pipe breaks in each city as a covariate as well as additional covariates to control for seasonal patterns, search volume persistence, and other sources of GI illness. The fit and predictive accuracy of multiple regression and data mining techniques were compared, with the best performance obtained using random forest and bagged regression tree models. Pipe breaks were found to be an important and positively correlated predictor of internet search volume in multiple models in both cities, supporting previous investigations that indicated an increased risk of GI illness from distribution system disturbances. Copyright © 2014 Elsevier Ltd. All rights reserved.

  14. Decoding the genomic tree of life.

    Science.gov (United States)

    Simonson, Anne B; Servin, Jacqueline A; Skophammer, Ryan G; Herbold, Craig W; Rivera, Maria C; Lake, James A

    2005-05-03

    Genomes hold within them the record of the evolution of life on Earth. But genome fusions and horizontal gene transfer (HGT) seem to have obscured sufficiently the gene sequence record such that it is difficult to reconstruct the phylogenetic tree of life. HGT among prokaryotes is not random, however. Some genes (informational genes) are more difficult to transfer than others (operational genes). Furthermore, environmental, metabolic, and genetic differences among organisms restrict HGT, so that prokaryotes preferentially share genes with other prokaryotes having properties in common, including genome size, genome G+C composition, carbon utilization, oxygen utilization/sensitivity, and temperature optima, further complicating attempts to reconstruct the tree of life. A new method of phylogenetic reconstruction based on gene presence and absence, called conditioned reconstruction, has improved our prospects for reconstructing prokaryotic evolution. It is also able to detect past genome fusions, such as the fusion that appears to have created the first eukaryote. This genome fusion between a deep branching eubacterium, possibly an ancestor of the cyanobacterium and a proteobacterium, with an archaeal eocyte (crenarchaea), appears to be the result of an early symbiosis. Given new tools and new genes from relevant organisms, it should soon be possible to test current and future fusion theories for the origin of eukaryotes and to discover the general outlines of the prokaryotic tree of life.

  15. Searching for Single Pulses Using Heimdall

    Science.gov (United States)

    Walsh, Gregory; Lynch, Ryan

    2018-01-01

    In radio pulsar surveys, the interstellar medium causes a frequency dependent dispersive delay of a pulsed signal across the observing band. If not corrected, this delay substantially lowers S/N and makes most pulses undetectable. The delay is proportional to an unknown dispersion measure (DM), which must be searched over with many trial values. A number of new, GPU-accelerated codes are now available to optimize this dedispersion task, and to search for transient pulsed radio emission. We report on the use of Heimdall, one such GPU-accelerated tree dedispersion utility, to search for transient radio sources in a Green Bank Telescope survey of the Cygnus Region and North Galactic Plane. The survey is carried out at central frequency of 820 MHz with a goal of finding Fast Radio Bursts, Rotating Radio Transients, young pulsars, and millisecond pulsars. We describe the the survey, data processing pipeline, and follow-up of candidate sources.

  16. GRFT – Genetic records family tree web applet

    Directory of Open Access Journals (Sweden)

    Samuel ePimentel

    2011-03-01

    Full Text Available Current software for storing and displaying records of genetic crosses does not provide an easy way to determine the lineage of an individual. The genetic records family tree (GRFT applet processes records of genetic crosses and allows researchers to quickly visualize lineages using a family tree construct and to access other information from these records using any Internet browser. Users select from three display features: 1 a family tree view which displays a color-coded family tree for an individual, 2 a sequential list of crosses, and 3 a list of crosses matching user-defined search criteria. Each feature contains options to specify the number of records shown and the latter two contain an option to filter results by the owner of the cross. The family tree feature is interactive, displaying a popup box with genetic information when the user mouses over an individual and allowing the user to draw a new tree by clicking on any individual in the current tree. The applet is written in Javascript and reads genetic records from a tab-delimited text file on the server, so it is cross-platform, can be accessed by anyone with an Internet connection, and supports almost instantaneous generation of new trees and table lists. Researchers can use the tool with their own genetic cross records for any sexually-reproducing organism. No additional software is required and with only minor modifications to the script, researchers can add their own custom columns. GRFT's speed, versatility, and low overhead make it an effective and innovative visualization method for genetic records. A sample tool is available at http://stanford.edu/~walbot/grft-sample.html.

  17. Impact of gene family evolutionary histories on phylogenetic species tree inference by gene tree parsimony.

    Science.gov (United States)

    Shi, Tao

    2016-03-01

    Complicated history of gene duplication and loss brings challenge to molecular phylogenetic inference, especially in deep phylogenies. However, phylogenomic approaches, such as gene tree parsimony (GTP), show advantage over some other approaches in its ability to use gene families with duplications. GTP searches the 'optimal' species tree by minimizing the total cost of biological events such as duplications, but accuracy of GTP and phylogenetic signal in the context of different gene families with distinct histories of duplication and loss are unclear. To evaluate how different evolutionary properties of different gene families can impact on species tree inference, 3900 gene families from seven angiosperms encompassing a wide range of gene content, lineage-specific expansions and contractions were analyzed. It was found that the gene content and total duplication number in a gene family strongly influence species tree inference accuracy, with the highest accuracy achieved at either very low or very high gene content (or duplication number) and lowest accuracy centered in intermediate gene content (or duplication number), as the relationship can fit a binomial regression. Besides, for gene families of similar level of average gene content, those with relatively higher lineage-specific expansion or duplication rates tend to show lower accuracy. Additional correlation tests support that high accuracy for those gene families with large gene content may rely on abundant ancestral copies to provide many subtrees to resolve conflicts, whereas high accuracy for single or low copy gene families are just subject to sequence substitution per se. Very low accuracy reached by gene families of intermediate gene content or duplication number can be due to insufficient subtrees to resolve the conflicts from loss of alternative copies. As these evolutionary properties can significantly influence species tree accuracy, I discussed the potential weighting of the duplication cost by

  18. Genetic search feature selection for affective modeling

    DEFF Research Database (Denmark)

    Martínez, Héctor P.; Yannakakis, Georgios N.

    2010-01-01

    Automatic feature selection is a critical step towards the generation of successful computational models of affect. This paper presents a genetic search-based feature selection method which is developed as a global-search algorithm for improving the accuracy of the affective models built....... The method is tested and compared against sequential forward feature selection and random search in a dataset derived from a game survey experiment which contains bimodal input features (physiological and gameplay) and expressed pairwise preferences of affect. Results suggest that the proposed method...

  19. Performance Simulations of Moving Target Search Algorithms

    Directory of Open Access Journals (Sweden)

    Peter K. K. Loh

    2009-01-01

    Full Text Available The design of appropriate moving target search (MTS algorithms for computer-generated bots poses serious challenges as they have to satisfy stringent requirements that include computation and execution efficiency. In this paper, we investigate the performance and behaviour of existing moving target search algorithms when applied to search-and-capture gaming scenarios. As part of the investigation, we also introduce a novel algorithm known as abstraction MTS. We conduct performance simulations with a game bot and moving target within randomly generated mazes of increasing sizes and reveal that abstraction MTS exhibits competitive performance even with large problem spaces.

  20. Recent tree cover increases in eastern China linked to low, declining human pressure, steep topography, and climatic conditions favoring tree growth.

    Science.gov (United States)

    Nüchel, Jonas; Svenning, Jens-Christian

    2017-01-01

    Globally, the extent of forest continues to decline, however, some countries have increased their forest extent in recent years. China is one of these countries and has managed to increase their tree cover through huge reforestation and afforestation programs during recent decades as well as land abandonment dynamics. This study investigates tree cover change in the eastern half of China between 2000 and 2010 on three different scales, using random forest modeling of remote sensing data for tree cover in relation to environmental and anthropogenic predictor variables. Our results show that between the years 2000 and 2010 2,667,875 km2 experienced an increase in tree cover while 1,854,900 km2 experienced a decline in tree cover. The area experiencing ≥10% increase in tree cover is almost twice as large as the area with ≥10% drop in tree cover. There is a clear relation between topography and tree cover change with steeper and mid-elevation areas having a larger response on tree cover increase than other areas. Furthermore, human influence, change in population density, and actual evapotranspiration are also important factors in explaining where tree cover has changed. This study adds to the understanding of tree cover change in China, as it has focus on the entire eastern half of China on three different scales and how tree cover change is linked to topography and anthropogenic pressure. Though, our results show an increase in tree cover in China, this study emphasizes the importance of incorporating anthropogenic factors together with biodiversity protection into the reforestation and afforestation programs in the future.

  1. Recent tree cover increases in eastern China linked to low, declining human pressure, steep topography, and climatic conditions favoring tree growth.

    Directory of Open Access Journals (Sweden)

    Jonas Nüchel

    Full Text Available Globally, the extent of forest continues to decline, however, some countries have increased their forest extent in recent years. China is one of these countries and has managed to increase their tree cover through huge reforestation and afforestation programs during recent decades as well as land abandonment dynamics. This study investigates tree cover change in the eastern half of China between 2000 and 2010 on three different scales, using random forest modeling of remote sensing data for tree cover in relation to environmental and anthropogenic predictor variables. Our results show that between the years 2000 and 2010 2,667,875 km2 experienced an increase in tree cover while 1,854,900 km2 experienced a decline in tree cover. The area experiencing ≥10% increase in tree cover is almost twice as large as the area with ≥10% drop in tree cover. There is a clear relation between topography and tree cover change with steeper and mid-elevation areas having a larger response on tree cover increase than other areas. Furthermore, human influence, change in population density, and actual evapotranspiration are also important factors in explaining where tree cover has changed. This study adds to the understanding of tree cover change in China, as it has focus on the entire eastern half of China on three different scales and how tree cover change is linked to topography and anthropogenic pressure. Though, our results show an increase in tree cover in China, this study emphasizes the importance of incorporating anthropogenic factors together with biodiversity protection into the reforestation and afforestation programs in the future.

  2. Preference Factoring for Stochastic Trees

    OpenAIRE

    Gordon Hazen

    2000-01-01

    Stochastic trees are extensions of decision trees that facilitate the modeling of temporal uncertainties. Their primary application has been to medical treatment decisions. It is often convenient to present stochastic trees in factored form, allowing loosely coupled pieces of the model to be formulated and presented separately. In this paper, we show how the notion of factoring can be extended as well to preference components of the stochastic model. We examine updateable-state utility, a fle...

  3. REPTREE CLASSIFIER FOR IDENTIFYING LINK SPAM IN WEB SEARCH ENGINES

    Directory of Open Access Journals (Sweden)

    S.K. Jayanthi

    2013-01-01

    Full Text Available Search Engines are used for retrieving the information from the web. Most of the times, the importance is laid on top 10 results sometimes it may shrink as top 5, because of the time constraint and reliability on the search engines. Users believe that top 10 or 5 of total results are more relevant. Here comes the problem of spamdexing. It is a method to deceive the search result quality. Falsified metrics such as inserting enormous amount of keywords or links in website may take that website to the top 10 or 5 positions. This paper proposes a classifier based on the Reptree (Regression tree representative. As an initial step Link-based features such as neighbors, pagerank, truncated pagerank, trustrank and assortativity related attributes are inferred. Based on this features, tree is constructed. The tree uses the feature inference to differentiate spam sites from legitimate sites. WEBSPAM-UK-2007 dataset is taken as a base. It is preprocessed and converted into five datasets FEATA, FEATB, FEATC, FEATD and FEATE. Only link based features are taken for experiments. This paper focus on link spam alone. Finally a representative tree is created which will more precisely classify the web spam entries. Results are given. Regression tree classification seems to perform well as shown through experiments.

  4. SEARCH, blackbox optimization, and sample complexity

    Energy Technology Data Exchange (ETDEWEB)

    Kargupta, H. [Los Alamos National Lab., NM (United States). Computational Science Methods Div.; Goldberg, D.E. [Univ. of Illinois, Urbana, IL (United States). Dept. of General Engineering

    1996-05-01

    The SEARCH (Search Envisioned As Relation and Class Hierarchizing) framework developed elsewhere (Kargupta, 1995; Kargupta and Goldberg, 1995) offered an alternate perspective toward blackbox optimization -- optimization in presence of little domain knowledge. The SEARCH framework investigates the conditions essential for transcending the limits of random enumerative search using a framework developed in terms of relations, classes and partial ordering. This paper presents a summary of some of the main results of that work. A closed form bound on the sample complexity in terms of the cardinality of the relation space, class space, desired quality of the solution and the reliability is presented. This also leads to the identification of the class of order-k delineable problems that can be solved in polynomial sample complexity. These results are applicable to any blackbox search algorithms, including evolutionary optimization techniques.

  5. Optimizing literature search in systematic reviews

    DEFF Research Database (Denmark)

    Aagaard, Thomas; Lund, Hans; Juhl, Carsten Bogh

    2016-01-01

    BACKGROUND: When conducting systematic reviews, it is essential to perform a comprehensive literature search to identify all published studies relevant to the specific research question. The Cochrane Collaborations Methodological Expectations of Cochrane Intervention Reviews (MECIR) guidelines...... state that searching MEDLINE, EMBASE and CENTRAL should be considered mandatory. The aim of this study was to evaluate the MECIR recommendations to use MEDLINE, EMBASE and CENTRAL combined, and examine the yield of using these to find randomized controlled trials (RCTs) within the area...... of musculoskeletal disorders. METHODS: Data sources were systematic reviews published by the Cochrane Musculoskeletal Review Group, including at least five RCTs, reporting a search history, searching MEDLINE, EMBASE, CENTRAL, and adding reference- and hand-searching. Additional databases were deemed eligible...

  6. Ringed Seal Search for Global Optimization via a Sensitive Search Model.

    Science.gov (United States)

    Saadi, Younes; Yanto, Iwan Tri Riyadi; Herawan, Tutut; Balakrishnan, Vimala; Chiroma, Haruna; Risnumawan, Anhar

    2016-01-01

    The efficiency of a metaheuristic algorithm for global optimization is based on its ability to search and find the global optimum. However, a good search often requires to be balanced between exploration and exploitation of the search space. In this paper, a new metaheuristic algorithm called Ringed Seal Search (RSS) is introduced. It is inspired by the natural behavior of the seal pup. This algorithm mimics the seal pup movement behavior and its ability to search and choose the best lair to escape predators. The scenario starts once the seal mother gives birth to a new pup in a birthing lair that is constructed for this purpose. The seal pup strategy consists of searching and selecting the best lair by performing a random walk to find a new lair. Affected by the sensitive nature of seals against external noise emitted by predators, the random walk of the seal pup takes two different search states, normal state and urgent state. In the normal state, the pup performs an intensive search between closely adjacent lairs; this movement is modeled via a Brownian walk. In an urgent state, the pup leaves the proximity area and performs an extensive search to find a new lair from sparse targets; this movement is modeled via a Levy walk. The switch between these two states is realized by the random noise emitted by predators. The algorithm keeps switching between normal and urgent states until the global optimum is reached. Tests and validations were performed using fifteen benchmark test functions to compare the performance of RSS with other baseline algorithms. The results show that RSS is more efficient than Genetic Algorithm, Particles Swarm Optimization and Cuckoo Search in terms of convergence rate to the global optimum. The RSS shows an improvement in terms of balance between exploration (extensive) and exploitation (intensive) of the search space. The RSS can efficiently mimic seal pups behavior to find best lair and provide a new algorithm to be used in global

  7. Ringed Seal Search for Global Optimization via a Sensitive Search Model.

    Directory of Open Access Journals (Sweden)

    Younes Saadi

    Full Text Available The efficiency of a metaheuristic algorithm for global optimization is based on its ability to search and find the global optimum. However, a good search often requires to be balanced between exploration and exploitation of the search space. In this paper, a new metaheuristic algorithm called Ringed Seal Search (RSS is introduced. It is inspired by the natural behavior of the seal pup. This algorithm mimics the seal pup movement behavior and its ability to search and choose the best lair to escape predators. The scenario starts once the seal mother gives birth to a new pup in a birthing lair that is constructed for this purpose. The seal pup strategy consists of searching and selecting the best lair by performing a random walk to find a new lair. Affected by the sensitive nature of seals against external noise emitted by predators, the random walk of the seal pup takes two different search states, normal state and urgent state. In the normal state, the pup performs an intensive search between closely adjacent lairs; this movement is modeled via a Brownian walk. In an urgent state, the pup leaves the proximity area and performs an extensive search to find a new lair from sparse targets; this movement is modeled via a Levy walk. The switch between these two states is realized by the random noise emitted by predators. The algorithm keeps switching between normal and urgent states until the global optimum is reached. Tests and validations were performed using fifteen benchmark test functions to compare the performance of RSS with other baseline algorithms. The results show that RSS is more efficient than Genetic Algorithm, Particles Swarm Optimization and Cuckoo Search in terms of convergence rate to the global optimum. The RSS shows an improvement in terms of balance between exploration (extensive and exploitation (intensive of the search space. The RSS can efficiently mimic seal pups behavior to find best lair and provide a new algorithm to be

  8. Ringed Seal Search for Global Optimization via a Sensitive Search Model

    Science.gov (United States)

    Saadi, Younes; Yanto, Iwan Tri Riyadi; Herawan, Tutut; Balakrishnan, Vimala; Chiroma, Haruna; Risnumawan, Anhar

    2016-01-01

    The efficiency of a metaheuristic algorithm for global optimization is based on its ability to search and find the global optimum. However, a good search often requires to be balanced between exploration and exploitation of the search space. In this paper, a new metaheuristic algorithm called Ringed Seal Search (RSS) is introduced. It is inspired by the natural behavior of the seal pup. This algorithm mimics the seal pup movement behavior and its ability to search and choose the best lair to escape predators. The scenario starts once the seal mother gives birth to a new pup in a birthing lair that is constructed for this purpose. The seal pup strategy consists of searching and selecting the best lair by performing a random walk to find a new lair. Affected by the sensitive nature of seals against external noise emitted by predators, the random walk of the seal pup takes two different search states, normal state and urgent state. In the normal state, the pup performs an intensive search between closely adjacent lairs; this movement is modeled via a Brownian walk. In an urgent state, the pup leaves the proximity area and performs an extensive search to find a new lair from sparse targets; this movement is modeled via a Levy walk. The switch between these two states is realized by the random noise emitted by predators. The algorithm keeps switching between normal and urgent states until the global optimum is reached. Tests and validations were performed using fifteen benchmark test functions to compare the performance of RSS with other baseline algorithms. The results show that RSS is more efficient than Genetic Algorithm, Particles Swarm Optimization and Cuckoo Search in terms of convergence rate to the global optimum. The RSS shows an improvement in terms of balance between exploration (extensive) and exploitation (intensive) of the search space. The RSS can efficiently mimic seal pups behavior to find best lair and provide a new algorithm to be used in global

  9. To Search or Not to Search!

    Science.gov (United States)

    Taylor, J. Rodney

    Constitutional guarantees, as provided by the Bill of Rights, are enjoyed by all citizens. This principle applies no less to students with respect to their college or university domicile. Case law on this subject suggests that three questions must be answered to determine the reasonableness of residence searching: (1) by whom the search is…

  10. A Note on a Tree-Based 2D Indexing

    Science.gov (United States)

    Žd'Árek, Jan; Melichar, Bořivoj

    A new approach to the 2D pattern matching and specifically to 2D text indexing is proposed. We present the transformation of 2D structures into the form of a tree, preserving the context of each element of the structure. The tree can be linearised using the prefix notation into the form of a text (a string) and we do the pattern matching in this text. Over this representation pushdown automata indexing the 2D text are constructed. They allow to search for 2D prefixes, suffixes, or factors of the 2D text in time proportional to the size of the representation of a 2D pattern. This result achieves the properties analogous to the results obtained in tree pattern matching and string indexing.

  11. EEG feature selection method based on decision tree.

    Science.gov (United States)

    Duan, Lijuan; Ge, Hui; Ma, Wei; Miao, Jun

    2015-01-01

    This paper aims to solve automated feature selection problem in brain computer interface (BCI). In order to automate feature selection process, we proposed a novel EEG feature selection method based on decision tree (DT). During the electroencephalogram (EEG) signal processing, a feature extraction method based on principle component analysis (PCA) was used, and the selection process based on decision tree was performed by searching the feature space and automatically selecting optimal features. Considering that EEG signals are a series of non-linear signals, a generalized linear classifier named support vector machine (SVM) was chosen. In order to test the validity of the proposed method, we applied the EEG feature selection method based on decision tree to BCI Competition II datasets Ia, and the experiment showed encouraging results.

  12. Tree felling: a necessary evil

    CERN Multimedia

    CERN Bulletin

    2013-01-01

    CERN started a campaign of tree felling in 2010 for safety reasons, and it will continue this year in various parts of the Meyrin site. As in previous years, the trees cut down in 2013 will be recycled and some will be replaced.   Diseased tree that had to be cut down on the Meyrin site. In association with the Geneva nature and countryside directorate (Direction générale de la nature et du paysage, DGNP), CERN commissioned the Geneva school of landscaping, engineering and architecture (Haute école du paysage, d’ingénierie et d’architecture, HEPIA) to compile an inventory of the trees on the Meyrin site. In total, 1285 trees (excluding poplars) were recorded. 75.5% of these trees were declared to be in a good state of health (i.e. 971 trees), 21.5% in a moderate state of health (276 trees) and 3% in a poor state of health (38 trees). As for the poplars, the 236 specimens recorded on the Meyrin site were judged to be too old, to...

  13. Tree games with regular objectives

    Directory of Open Access Journals (Sweden)

    Marcin Przybyłko

    2014-08-01

    Full Text Available We study tree games developed recently by Matteo Mio as a game interpretation of the probabilistic μ-calculus. With expressive power comes complexity. Mio showed that tree games are able to encode Blackwell games and, consequently, are not determined under deterministic strategies. We show that non-stochastic tree games with objectives recognisable by so-called game automata are determined under deterministic, finite memory strategies. Moreover, we give an elementary algorithmic procedure which, for an arbitrary regular language L and a finite non-stochastic tree game with a winning objective L decides if the game is determined under deterministic strategies.

  14. Making CSB + -Trees Processor Conscious

    DEFF Research Database (Denmark)

    Samuel, Michael; Pedersen, Anders Uhl; Bonnet, Philippe

    2005-01-01

    Cache-conscious indexes, such as CSB+-tree, are sensitive to the underlying processor architecture. In this paper, we focus on how to adapt the CSB+-tree so that it performs well on a range of different processor architectures. Previous work has focused on the impact of node size on the performan...... a systematic method for adapting CSB+-tree to new platforms. This work is a first step towards integrating CSB+-tree in MySQL’s heap storage manager....

  15. A representation and classification scheme for tree-like structures in medical images: an application on branching pattern analysis of ductal trees in x-ray galactograms

    Science.gov (United States)

    Megalooikonomou, Vasileios; Kontos, Despina; Danglemaier, Joseph; Javadi, Ailar; Bakic, Predrag R.; Maidment, Andrew D. A.

    2006-03-01

    We propose a multi-step approach for representing and classifying tree-like structures in medical images. Examples of such tree-like structures are encountered in the bronchial system, the vessel topology and the breast ductal network. We assume that the tree-like structures are already segmented. To avoid the tree isomorphism problem we obtain the breadth-first canonical form of a tree. Our approach is based on employing tree encoding techniques, such as the depth-first string encoding and the Prüfer encoding, to obtain a symbolic representation. Thus, the problem of classifying trees is reduced to string classification where node labels are the string terms. We employ the tf-idf text mining technique to assign a weight of significance to each string term (i.e., tree node label). We perform similarity searches and k-nearest neighbor classification of the trees using the tf-idf weight vectors and the cosine similarity metric. We applied our approach to the breast ductal network manually extracted from clinical x-ray galactograms. The goal was to characterize the ductal tree-like parenchymal structures in order to distinguish among different groups of women. Our best classification accuracy reached up to 90% for certain experimental settings (k=4), outperforming on the average by 10% that of a previous state-of-the-art method based on ramification matrices. These results illustrate the effectiveness of the proposed approach in analyzing tree-like patterns in breast images. Developing such automated tools for the analysis of tree-like structures in medical images can potentially provide insight to the relationship between the topology of branching and function or pathology.

  16. The Steiner tree problem

    CERN Document Server

    Hwang, FK; Winter, P

    1992-01-01

    The Steiner problem asks for a shortest network which spans a given set of points. Minimum spanning networks have been well-studied when all connections are required to be between the given points. The novelty of the Steiner tree problem is that new auxiliary points can be introduced between the original points so that a spanning network of all the points will be shorter than otherwise possible. These new points are called Steiner points - locating them has proved problematic and research has diverged along many different avenues. This volume is devoted to the assimilation of the rich field of intriguing analyses and the consolidation of the fragments. A section has been given to each of the three major areas of interest which have emerged. The first concerns the Euclidean Steiner Problem, historically the original Steiner tree problem proposed by Jarník and Kössler in 1934. The second deals with the Steiner Problem in Networks, which was propounded independently by Hakimi and Levin and has enjoyed the most...

  17. Distributed Merge Trees

    Energy Technology Data Exchange (ETDEWEB)

    Morozov, Dmitriy; Weber, Gunther

    2013-01-08

    Improved simulations and sensors are producing datasets whose increasing complexity exhausts our ability to visualize and comprehend them directly. To cope with this problem, we can detect and extract significant features in the data and use them as the basis for subsequent analysis. Topological methods are valuable in this context because they provide robust and general feature definitions. As the growth of serial computational power has stalled, data analysis is becoming increasingly dependent on massively parallel machines. To satisfy the computational demand created by complex datasets, algorithms need to effectively utilize these computer architectures. The main strength of topological methods, their emphasis on global information, turns into an obstacle during parallelization. We present two approaches to alleviate this problem. We develop a distributed representation of the merge tree that avoids computing the global tree on a single processor and lets us parallelize subsequent queries. To account for the increasing number of cores per processor, we develop a new data structure that lets us take advantage of multiple shared-memory cores to parallelize the work on a single node. Finally, we present experiments that illustrate the strengths of our approach as well as help identify future challenges.

  18. Genealogy and gene trees.

    Science.gov (United States)

    Rasmuson, Marianne

    2008-02-01

    Heredity can be followed in persons or in genes. Persons can be identified only a few generations back, but simplified models indicate that universal ancestors to all now living persons have occurred in the past. Genetic variability can be characterized as variants of DNA sequences. Data are available only from living persons, but from the pattern of variation gene trees can be inferred by means of coalescence models. The merging of lines backwards in time leads to a MRCA (most recent common ancestor). The time and place of living for this inferred person can give insights in human evolutionary history. Demographic processes are incorporated in the model, but since culture and customs are known to influence demography the models used ought to be tested against available genealogy. The Icelandic data base offers a possibility to do so and points to some discrepancies. Mitochondrial DNA and Y chromosome patterns give a rather consistent view of human evolutionary history during the latest 100 000 years but the earlier epochs of human evolution demand gene trees with longer branches. The results of such studies reveal as yet unsolved problems about the sources of our genome.

  19. Occurrence of leguminous trees

    Energy Technology Data Exchange (ETDEWEB)

    Kirkbride, J.H.; Arkcoll, D.B.A.; Turnbull, J.W.; Magalhaes, L.M.S.; Fernandes, N.P.

    1984-01-01

    Five papers from the symposium are presented. Kirkbride, J.H. Jr.; Legumes of the cerrado. pp 23-46 (Refs. 55) A review is given. Some 548 legume species in 59 genera are listed that have been reported from cerrado vegetation. Felker, P.; Legume trees in semi-arid and arid areas. pp 47-59 (Refs. 41) A review is given of worldwide research activities. Arkcoll, D.B.; A comparison of some fast growing species suitable for woodlots in the wet tropics. pp 61-68 (Refs. 9) Studies are described near Manaus on intensive silviculture (for fuelwood production) of Eucalyptus deglupta, Cedrelinga catanaeformis (catenaeformis), Jacaranda copaia, and Inga edulis. Turnbull, J.W.; Six phyllodinous Acacia species for planting in the humid tropical lowlands. pp 69-73 (Refs. 14) Distribution, ecology, growth, and utilization are described for A. auriculiformis, A. mangium, A. aulacocarpa, A. crassicarpa, A. cincinnata, and A. polystachya. Magalhaes, L.M.S., Fernandes, N.P.; Experimental stands of leguminous trees in the Manaus region. pp 75-79 (Refs. 8) Performance up to age 20 yr of Cedrelinga catenaeformis, Dalbergia nigra, Dinizia excelsa, Dipteryx odorata, Dipteryx sp., Diplotropis sp., Eperua bijuga, Pithecellobium racemosum, Vouacapoua pallidior, and Hymenaea sp. is described.

  20. Shopping intention prediction using decision trees

    Directory of Open Access Journals (Sweden)

    Dario Šebalj

    2017-09-01

    Full Text Available Introduction: The price is considered to be neglected marketing mix element due to the complexity of price management and sensitivity of customers on price changes. It pulls the fastest customer reactions to that change. Accordingly, the process of making shopping decisions can be very challenging for customer. Objective: The aim of this paper is to create a model that is able to predict shopping intention and classify respondents into one of the two categories, depending on whether they intend to shop or not. Methods: Data sample consists of 305 respondents, who are persons older than 18 years involved in buying groceries for their household. The research was conducted in February 2017. In order to create a model, the decision trees method was used with its several classification algorithms. Results: All models, except the one that used RandomTree algorithm, achieved relatively high classification rate (over the 80%. The highest classification accuracy of 84.75% gave J48 and RandomForest algorithms. Since there is no statistically significant difference between those two algorithms, authors decided to choose J48 algorithm and build a decision tree. Conclusions: The value for money and price level in the store were the most significant variables for classification of shopping intention. Future study plans to compare this model with some other data mining techniques, such as neural networks or support vector machines since these techniques achieved very good accuracy in some previous research in this field.