Research and implementation of realistic dynamic tree scene

2013 ◽  
Vol 33 (6) ◽  
pp. 1711-1714
Author(s):  
Xiang CUI ◽  
Xiaofeng JIANG
Keyword(s):  
2022 ◽  
Vol 16 (4) ◽  
pp. 1-33
Author(s):  
Danlu Liu ◽  
Yu Li ◽  
William Baskett ◽  
Dan Lin ◽  
Chi-Ren Shyu

Risk patterns are crucial in biomedical research and have served as an important factor in precision health and disease prevention. Despite recent development in parallel and high-performance computing, existing risk pattern mining methods still struggle with problems caused by large-scale datasets, such as redundant candidate generation, inability to discover long significant patterns, and prolonged post pattern filtering. In this article, we propose a novel dynamic tree structure, Risk Hierarchical Pattern Tree (RHPTree), and a top-down search method, RHPSearch, which are capable of efficiently analyzing a large volume of data and overcoming the limitations of previous works. The dynamic nature of the RHPTree avoids costly tree reconstruction for the iterative search process and dataset updates. We also introduce two specialized search methods, the extended target search (RHPSearch-TS) and the parallel search approach (RHPSearch-SD), to further speed up the retrieval of certain items of interest. Experiments on both UCI machine learning datasets and sampled datasets of the Simons Foundation Autism Research Initiative (SFARI)—Simon’s Simplex Collection (SSC) datasets demonstrate that our method is not only faster but also more effective in identifying comprehensive long risk patterns than existing works. Moreover, the proposed new tree structure is generic and applicable to other pattern mining problems.


1995 ◽  
Vol 05 (04) ◽  
pp. 635-646 ◽  
Author(s):  
MICHAEL A. PALIS ◽  
JING-CHIOU LIOU ◽  
SANGUTHEVAR RAJASEKARAN ◽  
SUNIL SHENDE ◽  
DAVID S.L. WEI

The scheduling problem for dynamic tree-structured task graphs is studied and is shown to be inherently more difficult than the static case. It is shown that any online scheduling algorithm, deterministic or randomized, has competitive ratio Ω((1/g)/ log d(1/g)) for trees with granularity g and degree at most d. On the other hand, it is known that static trees with arbitrary granularity can be scheduled to within twice the optimal schedule. It is also shown that the lower bound is tight: there is a deterministic online tree scheduling algorithm that has competitive ratio O((1/g)/ log d(1/g)). Thus, randomization does not help.


Author(s):  
Amos Korman ◽  
David Peleg ◽  
Yoav Rodeh

2008 ◽  
Vol 47 (06) ◽  
pp. 499-504
Author(s):  
M.W. Evens ◽  
D. A. Trace ◽  
K. Yang

Summary Objectives: Now that the National Library of Medicine has made SNOMED-CT widely available, we are trying to manage the terminology of a whole suite of medical applications and map our terminology into that in SNOMED. Methods: This paper describes the design and implementation of the Java Dynamic Tree that provides structure to our medical terminology and explains how it functions as the core of our system. Results: The tree was designed to reflect the stages in a patient interview, so it contains components for identifying the patient and the provider, a large set of chief complaints, review of systems, physical examination, several history modules, medications, laboratory tests, imaging, and special procedures. The tree is mirrored in a commercial DBMS, which also stores multi-encounter patient data, disorder patterns for our Bayesian diagnostic system, and the data and rules for other expert systems. The DBMS facilitates the import and export of large terminology files. Conclusions: Our Java Dynamic Tree allows the health care provider to view the entire terminology along with the structure that supports it, as well as the mechanism for the generation of progress notes and other documents, in terms of a single hierarchical structure. Changes in terminology can be propagated through the system under the control of the expert. The import/ export facility has been a major help by replacing our original terminology by the terminology in SNOMED-CT.


2019 ◽  
Vol 11 (8) ◽  
pp. 2293 ◽  
Author(s):  
Christian Dupraz ◽  
Kevin Wolz ◽  
Isabelle Lecomte ◽  
Grégoire Talbot ◽  
Grégoire Vincent ◽  
...  

Agroforestry, the intentional integration of trees with crops and/or livestock, can lead to multiple economic and ecological benefits compared to trees and crops/livestock grown separately. Field experimentation has been the primary approach to understanding the tree–crop interactions inherent in agroforestry. However, the number of field experiments has been limited by slow tree maturation and difficulty in obtaining consistent funding. Models have the potential to overcome these hurdles and rapidly advance understanding of agroforestry systems. Hi-sAFe is a mechanistic, biophysical model designed to explore the interactions within agroforestry systems that mix trees with crops. The model couples the pre-existing STICS crop model to a new tree model that includes several plasticity mechanisms responsive to tree–tree and tree–crop competition for light, water, and nitrogen. Monoculture crop and tree systems can also be simulated, enabling calculation of the land equivalent ratio. The model’s 3D and spatially explicit form is key for accurately representing many competition and facilitation processes. Hi-sAFe is a novel tool for exploring agroforestry designs (e.g., tree spacing, crop type, tree row orientation), management strategies (e.g., thinning, branch pruning, root pruning, fertilization, irrigation), and responses to environmental variation (e.g., latitude, climate change, soil depth, soil structure and fertility, fluctuating water table). By improving our understanding of the complex interactions within agroforestry systems, Hi-sAFe can ultimately facilitate adoption of agroforestry as a sustainable land-use practice.


2005 ◽  
Vol 4 (4) ◽  
pp. 331-353 ◽  
Author(s):  
Carlos Correa ◽  
Ivan Marsic ◽  
Xiaodong Sun

Sign in / Sign up

Export Citation Format

Share Document