Search results for "Data structure"
showing 10 items of 441 documents
A tractor mounted scanning LIDAR for the non-destructive measurement of vegetative volume and surface area of tree-row plantations: A comparison with…
2009
The use of a low-cost tractor-mounted scanning Light Detection and Ranging (LIDAR) system for capable of making non-destructive recordings of tree-row structure in orchards and vineyards is described. Field tests consisted of several LIDAR measurements on both sides of the crop row, before and after defoliation of selected trees. Summary parameters describing the tree-row volume and the total crop surface area viewed by the LIDAR (expressed as a ratio with ground surface area) were derived using a suitable numerical algorithm. The results for apple and pear orchards and a wine producing vineyard were shown to be in reasonable agreement with the results derived from a destructive leaf sampli…
Disentangling Sources of Gene Tree Discordance in Phylogenomic Datasets: Testing Ancient Hybridizations in Amaranthaceae s.l.
2019
Gene tree discordance in large genomic datasets can be caused by evolutionary processes such as incomplete lineage sorting and hybridization, as well as model violation, and errors in data processing, orthology inference, and gene tree estimation. Species tree methods that identify and accommodate all sources of conflict are not available, but a combination of multiple approaches can help tease apart alternative sources of conflict. Here, using a phylotranscriptomic analysis in combination with reference genomes, we test a hypothesis of ancient hybridization within the plant family Amaranthaceae s.l. that was previously supported by morphological, ecological, and Sanger-based molecular data…
New insights into the OCST problem
2009
This paper considers the Euclidean variant of the optimal communciation spanning tree (OCST) problem. Researches have analyzed the structure of the problem and found that high quality solutions prefer edges of low cost. Further, edges pointing to the center of the network are more likely to be included in good solutions. We add to the literature and provide additional insights into the structure of the OCST problem. Therefore, we investigate properies of the whole tree, such as node degrees and the Wiener index. The results reveal that optimal solutions are structured in a star-like manner. There are few nodes with high node degrees, these nodes are located next to the graph's center. The m…
A relational model for unstructured documents
1987
The logical structure of a document is usually a tree in which the order of the nodes is important at least at some level of the tree. We call a document unstructured if its structure is a single-level ordered tree. The purpose of this paper is to present a many-sorted algebra for handling unstructured documents. The documents in the model are represented by relations. An algebra for handling documents of one type can be extended to an algebra for handling documents of several types. Further, an algebra for handling documents can be extended by the relational algebra for handling documents and relations in a common algebra. The model of this paper can be regarded as a part of a general docu…
The Italian TREETALKER NETWORK (ITT-Net): continuous large scale monitoring of tree functional traits and vulnerabilities to climate change
2020
<p>The  <strong>Italian TREETALKER NETWORK (ITT-Net) </strong>aims to respond to one of the grand societal challenges: the impact of climate changes on forests ecosystem services and forest dieback. The comprehension of the link between these phenomena requires to complement the most classical approaches with a new monitoring paradigm based on large scale, single tree, high frequency and long-term monitoring tree physiology, which, at present, is limited by the still elevated costs of multi-sensor devices, their energy demand and maintenance not always suitable for monitoring in remote areas. The ITT-Net network will be a unique and un…
Fuzzified Tree Search in Real Domain Games
2011
Fuzzified game tree search algorithm is based on the idea that the exact game tree evaluation is not required to find the best move. Therefore, pruning techniques may be applied earlier resulting in faster search and greater performance. Applied to an abstract domain, it outperforms the existing ones such as Alpha-Beta, PVS, Negascout, NegaC*, SSS*/ Dual* and MTD(f). In this paper we present experimental results in real domain games, where the proposed algorithm demonstrated 10 percent performance increase over the existing algorithms.
Segmentation and virtual exploration of tracheobronchial trees
2003
Abstract The tracheobronchial tree as part of the lung is part of one of the most important organs of the human body. Inhaled air is distributed to the alveolus where oxygen and carbon dioxide exchange between air and blood takes place. In this paper, we introduce the virtual endoscopy system VIVENDI to perform virtual inspections of tracheobronchial trees based on their segmentation and of the complementing blood vessels. It is based on a hybrid segmentation pipeline which enables the segmentation of vascular and tracheobronchial structures down to the seventh generation of the bronchi.
AIs for Dominion Using Monte-Carlo Tree Search
2015
Dominion is a complex game, with hidden information and stochastic elements. This makes creating any artificial intelligence AI challenging. To this date, there is little work in the literature on AI for Dominion, and existing solutions rely upon carefully tuned finite-state solutions. This paper presents two novel AIs for Dominion based on Monte-Carlo Tree Search MCTS methods. This is achieved by employing Upper Confidence Bounds UCB and Upper Confidence Bounds applied to Trees UCT. The proposed solutions are notably better than existing work. The strongest proposal is able to win 67% of games played against a known, good finite-state solution, even when the finite-state solution has the u…
Expansive Voronoi Tree: A Motion Planner for Assembly Sequence Planning
2021
One major challenge in Assembly Sequence Planning (ASP) for complex real-world CAD-scenarios is to find an appropriate disassembly path for each assembled part. Complex real-world scenes are characterized by a large installation space. There each part has many different possible disassembly paths that differ in length and clearance. However, due to tight packing in the installation space, these paths can contain narrow passages. Therefore a motion planner is needed that is able to globally search for a reasonable path and to locally overcome narrow passages. Moreover, since motion planning requests are executed in the ASP context over and over again for many parts, both for those that can b…