A Data Structure Analogue for Modelling Tree Crowns

1975 ◽  
Vol 5 (4) ◽  
pp. 574-579 ◽  
Author(s):  
Stephen Smith ◽  
K. Scoullar
Keyword(s):  
Data Structure ◽  
Programming Language ◽  
Rooted Tree ◽  
Coniferous Tree ◽  
Computer Data ◽  
Tree Crowns ◽  
Single Tree ◽  
Structure Analogue ◽  
Stored Reserves ◽  
Branch Death

A rooted-tree computer data structure is used as an analogue of coniferous tree crowns in building a simulation model of a single tree. Submodels of branch death and the allocation of stored reserves are used to illustrate the model. The programming language used is PL/1.

Lidar-based measurement of surface roughness features of single tree crowns

2011 ◽  
Author(s):  
Melanie Kolditz ◽  
Petra M. Krahwinkler ◽  
Jürgen Roßmann
Keyword(s):  
Surface Roughness ◽  
Tree Crowns ◽  
Single Tree

Computer Data Structure for Geological Entities Modelling Based on OO-Solid Model

2011 ◽  
Vol 383-390 ◽  
pp. 2484-2491
Author(s):  
Jun Fan
Keyword(s):  
Data Structure ◽  
Data Model ◽  
Object Oriented ◽  
Geological Structure ◽  
Solid Model ◽  
Topological Relations ◽  
Seamless Integration ◽  
Computer Data ◽  
Model Based ◽  
Geometric Primitives

In the long evolution of the earth formation often form a complex geological structure, modeling for these complex geological entities (such as thinning-out, bifurcation, reverse, etc.) still require in-depth 3D modeling study. Because of discontinuity, complexity and uncertainty of distribution of 3D geo-objects, some models only are suitable for regular, continuous and relatively simple spatial objects, and some are suitable for discontinue, complex and uncertain geo-objects, but some improvements on these models, such as, updating of model, maintenance of topological and seamless integration between models, are still to be made. OO-Solid model, put forward by writer in 2002, is an object- oriented topological model based on sections. The OO-Solid Model is an object-oriented 3D topologic data model based on component for geology modeling with fully considering the topological relations between geological objects and its geometric primitives, Comparatively, it accords with the actual requirements of three-dimensional geological modeling . The key issue of 3D geology modeling is the 3D data model. Some data models are suitable for discontinue, complex and uncertain geo-objects, but the OO-Solid model is an object-oriented 3D topologic data model based on component for geology modeling with fully considering the topological relations between geological objects and its geometric primitives. OO-Solid model and data structure are designed. At last, 3D complex geological entities modeling based on OO-Solid are studied in this paper. These study is important and one of the core techniques for the 3DGM.

A computer data structure for inflammatory bowel disease histopathology reports

1998 ◽  
Vol 114 ◽  
pp. A49
Author(s):  
K. Wilkinson ◽  
C. Price ◽  
A. Solomonides ◽  
A. Forbes
Keyword(s):  
Inflammatory Bowel Disease ◽  
Data Structure ◽  
Bowel Disease ◽  
Computer Data ◽  
Inflammatory Bowel

scholarly journals THE PROCESS OF DETECTING BLOCKS WITH REPETITIONS AND EXCESS BUILDING USING A LANGUAGE-INDEPENDENT INCREASE DETECTOR

2021 ◽  
Vol 297 (3) ◽  
pp. 39-45
Author(s):  
N. PRAVORSKA ◽  
О. BARMAC ◽  
D. MEDZATIY ◽  
T. SHESTAKEVYCH ◽  
◽  
...  
Keyword(s):  
Data Structure ◽  
Programming Language ◽  
Simple Algorithm ◽  
Inverted Index ◽  
Graphical Methods ◽  
Program Code ◽  
Executable Code ◽  
Software Code ◽  
Automated Tools ◽  
Global Data

To avoid malfunctions of the developed software caused by errors, even when developed by professionals, a number of automated tools are used, which allow to evaluate the software code. A variety of detectors are commonly used to detect errors that occur due to duplicate blocks of executable code. The importance of developing such detectors is that the product is not dependent on the programming language and has a simple algorithm for finding cloned blocks of code. The approach of the language-independent repetition detector is based on a method based on the use of the clone index. It is a global data structure that resembles a typical inverted index. This approach is based on the text, ie the method becomes the basis for research independent of language. In recent years, additional methods have become increasingly popular, which analyze the source and executable code at a smaller level, and there are attempts to avoid unnecessary recalculations, by transferring information between versions. Reviewing the research presented in the works of scientists dealing with this problem, it was decided to propose an approach to improve methods for detecting repetitions and redundancy of program code based on language-independent incremental repetition detector (MNIDP). Most additional research is based on tree-like and graphical methods, ie they are strictly dependent on the programming language. The solution in the MNIDP campaign is to take the text as a basis, ie the method becomes the basis for research independent of language. This technique is not strictly language-independent, but due to the fact that the tokenization stage will be included, with the help of minor adjustments the desired result has been achieved. This provides a detailed analysis of the internal composition (namely, elements) of the detector and explanations of the work at different stages of the detection process.

scholarly journals APPLICATION OF GIS FOR MANAGING CHANGES OF LAND PARCELS OVER TIME

2010 ◽  
Vol 13 (1) ◽  
pp. 77-83
Author(s):  
Duc Trong Tran
Keyword(s):  
Data Structure ◽  
Information Management ◽  
Programming Language ◽  
Current Data ◽  
Specific Point ◽  
Temporal Gis ◽  
The Past ◽  
Over Time ◽  
Application Of Gis

The GISs which are used for land information management in VietNam not enabled us to anser questions such as "How was this parcel changed in the past? ..." To address this issue, a temporal GIS module is researched and developed which is based on ArcGIS current data structure and programming language ArcObject. Experiment results illustrate the capability of this newly developed GIS module in monitoring temporal parcel history and reconstructing whole parcels state at a specific point in time.

Research on Budget Quota Method Based on P3e/c for Hydraulic and Hydropower Engineering

2012 ◽  
Vol 170-173 ◽  
pp. 2004-2007
Author(s):  
Fei Fei Pan ◽  
Ning Li ◽  
Yong Lei Cao ◽  
Le Zhang
Keyword(s):  
Decision Making ◽  
Data Structure ◽  
Statistical Method ◽  
Programming Language ◽  
Data Frame ◽  
Quota System ◽  
Engineering Construction ◽  
Construction Scheduling ◽  
Java Programming ◽  
Hydropower Engineering

According to lacking a statistical method of resource and quantity under a unified standard in hydraulic and hydropower engineering construction, the budget quota method based on P3e/c was proposed. The hierarchy structure of data-frame of P3e/c and the data structure of budget quota were analyzed. The budget quota system based on P3e/c was developed by utilizing JAVA programming language. A certain hydraulic and hydropower engineering in southwest of China was taken as an example. The results indicate that the veracity, universality and efficiency of construction scheduling have been improved significantly by integrating budget quota and P3e/c. Moreover, it provides the basic data for construction scheduling statistic and analysis. The proposed method provides decision making basis for designers and managers.

scholarly journals Data Structures in Leelus Programming Language: A Research

2021 ◽  
Author(s):  
Frank Appiah
Keyword(s):  
Data Structure ◽  
Programming Language ◽  
Data Structures ◽  
Type System

This is a research on data structures using pointer declaration for array dimensional type of representation in variable declaration. In this research, I will describe type array, term array and value array drawn from both data structure and type system.

An efficient technique for cloud storage using secured de-duplication algorithm

2021 ◽  
pp. 1-12
Author(s):  
Prakash Mohan ◽  
Manikandan Sundaram ◽  
Sambit Satpathy ◽  
Sanchali Das
Keyword(s):  
Data Structure ◽  
Programming Language ◽  
Cloud Storage ◽  
Storage Capacity ◽  
Cosine Similarity ◽  
Sensitive Information ◽  
Python Programming Language ◽  
Python Programming ◽  
Natural Language Process ◽  
Hashing Algorithm

Techniques of data compression involve de-duplication of data that plays an important role in eliminating duplicate copies of information and has been widely employed in cloud storage to scale back the storage capacity and save information measure. A secure AES encryption de-duplication system for finding duplication with the meaning and store up it in the cloud. To protect the privacy of sensitive information whereas supporting de-duplication, The AES encryption technique and SHA-256 hashing algorithm have been utilized to encrypt the information before outsourcing. Pre-processing is completed and documents are compared and verified with the use of wordnet. Cosine similarity is employed to see the similarity between both the documents and to perform this, a far economical VSM data structure is used. Wordnet hierarchical corpus is used to see syntax and semantics so that the identification of duplicates is done. NLTK provides a large vary of libraries and programs for symbolic and statistical natural language process (NLP) for the Python programming language that is used here for the unidentified words by cosine similarity. Within the previous strategies, cloud storage was used abundantly since similar files were allowed to store. By implementing our system, space for storing is reduced up to 85%. Since AES and SHA-256 are employed, it provides high security and efficiency.

A TIME AND SPACE EFFICIENT ALGORITHM FOR MINIMIZING COVER AUTOMATA FOR FINITE LANGUAGES

2003 ◽  
Vol 14 (06) ◽  
pp. 1071-1086 ◽  
Author(s):  
HEIKO KÖRNER
Keyword(s):  
Data Structure ◽  
Programming Language ◽  
Finite Automaton ◽  
Efficient Algorithm ◽  
Previous Method ◽  
Deterministic Finite Automaton ◽  
Time And Space ◽  
Language L ◽  
Finite Language ◽  
The Common

A deterministic finite automaton (DFA) [Formula: see text] is called a cover automaton (DFCA) for a finite language L over some alphabet Σ if [Formula: see text], with l being the length of some longest word in L. Thus a word w ∈ Σ* is in L if and only if |w| ≤ l and [Formula: see text]. The DFCA [Formula: see text] is minimal if no DFCA for L has fewer states. In this paper, we present an algorithm which converts an n–state DFA for some finite language L into a corresponding minimal DFCA, using only O(n log n) time and O(n) space. The best previously known algorithm requires O(n2) time and space. Furthermore, the new algorithm can also be used to minimize any DFCA, where the best previous method takes O(n4) time and space. Since the required data structure is rather complex, an implementation in the common programming language C/C++ is also provided.

Sign in / Sign up

Export Citation Format

Share Document