• Journal of Computational Design and Engineering
• /
• v.1 no.3
• /
• pp.161-172
• /
• 2014

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.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.25 no.4
• /
• pp.171-183
• /
• 1998

The purpose of this study was to analyze urban greenspace area and vegetation structure by land use types for both Chuncheon and Kangleung. Natural and agricultural lands were predominant in the study cites, as 75-80% of total area. Residential lands accounted for about 10%, and commercial and industrial lands(including transportation), 5-10%. Only 10-20% of urban residential and commercial area was covered with greenspace. Woody plant cover was 12-13%, and tree density was 1.5 trees/100$m^2$ for urban lands(all land use types except natural land) in both cities. The tree-age structure was largely characterized by young, growing tree population, and species diversity within a diameter class decreases as the diameter classes get larger. Urban lands of both cities had quite a similar species composition of woody plants (similarity index of 0.65). Street trees in Chuncheon were intensively pruned annually to protect the above ground utility lines. Some strategies were explored to solve problems found in the existing greenspace structures. They included increase of biomass and greenspace area through minimization of unnecessary impervious surfaces, creation of multilayered and multiaged vegetation structures, relocation of above ground utility lines and avoidance of intensive tree pruning, and establishment of greenspace proximity and connectivity.

• Korean Journal of Computational Design and Engineering
• /
• v.2 no.2
• /
• pp.77-84
• /
• 1997

This paper is concerning the development of multiple neural networks system of problem domains where the complete input space can be decomposed into several different regions, and these are known prior to training neural networks. We will adopt oblique decision tree to represent the divided input space and sel ect an appropriate subnetworks, each of which is trained over a different region of input space. The overall architecture of multiple neural networks system, called the federated architecture, consists of a facilitator, normal subnetworks, and tile networks. The role of a facilitator is to choose the subnetwork that is suitable for the given input data using information obtained from decision tree. However, if input data is close enough to the boundaries of regions, there is a large possibility of selecting the invalid subnetwork due to the incorrect prediction of decision tree. When such a situation is encountered, the facilitator selects a tile network that is trained closely to the boundaries of partitioned input space, instead of a normal subnetwork. In this way, it is possible to reduce the large error of neural networks at zones close to borders of regions. The validation of our approach is examined and verified by applying the federated neural networks system to the configuration design of a midship structure.

• Korean Journal of Agricultural and Forest Meteorology
• /
• v.16 no.4
• /
• pp.259-266
• /
• 2014

Understanding the forest fire patterns is necessary to comprehend the stability of the forest ecosystems. Thus, researchers have suggested the simulation models to mimic the forest fire spread dynamics, which enables us to predict the forest damage in the scenarios that are difficult to be experimentally tested in laboratory scale. However, many of the models have the limitation that many of them did not consider the complicated environmental factors, such as fuel types, wind, and moisture. In this study, we suggested a simple model with the factors, especially, the geomorphological structure of the forest and two types of fuel. The two fuels correspond to susceptible tree and resistant tree with different probabilities of transferring fire. The trees were randomly distributed in simulation space at densities ranging from 0.5 (low) to 1.0 (high). The susceptible tree had higher value of the probability than the resistant tree. Based on the number of burnt trees, we then carried out the sensitivity analysis to quantify how the forest fire patterns are affected by the structure and tree density. We believe that our model can be a useful tool to explore forest fire spreading patterns.

• Journal of Korean Society of Steel Construction
• /
• v.25 no.4
• /
• pp.321-333
• /
• 2013

This study presents a practice of a scientific methodology, i.e., technology tree to describe hierarchies of functions and technologies of research projects. In this study functional developments of a well-known steel space frame truss are dealt with for an application of the technology tree process to execute the maintenance of road tunnels without blocking vehicles. It is verified that established results of technology tree process can be linked to a proof process of revealed functions and component technologies such as reference works and structural analyses. In the future the technology tree methodology can be extendedly used for an effective tool setting up research plans and developing integrated technologies of a specific item such as a steel structure.

• Spatial Information Research
• /
• v.7 no.2
• /
• pp.271-282
• /
• 1999

In this paper, we derived an efficient indexing scheme, SJ tree, which handles multi-attribute data and spatial join operations efficiently. In addition, a number of algorithms for manipulating multi-attribute data are given , together with their computational and I/O complexity . Moreover , we how that SJ tree is a kind of generalized B-tree. This means that SJ-tree can be easily implemented on existing built-in B-tree in most storage managers in the sense that the structure of SJ tree is like that of B-tree. The spatial join operation with spatial output is benchmarked using R-tree, B-tree, K-D-B tree, and SJ tree. Results from the benchmark test indicate that SJ tree out performance other indexing schemes on spatial join with point data.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2017.04a
• /
• pp.677-679
• /
• 2017

Data convergecast is an indispensable task for any WSN applications. Typically, scheduling in the WSN consists of two phases: tree construction and scheduling. The optimal tree structure and scheduling for the network is proven NP-hard. This paper focuses on the delay optimality while constructing the data convergecast tree. The algorithm can take any tree as the input, and by performing the switches (i.e. a node changes its parent), the expected aggregation delay is potentially reduced. Note that while constructing the tree, only the in-tree collisions between the child nodes sending data to their common parent is considered.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.17 no.1
• /
• pp.86-93
• /
• 2017

In this paper, we propose a novel defect detection method using component tree representations of scanning electron microscopy (SEM) images. The component tree contains rich information about the topological structure of images such as the stiffness of intensity changes, area, and volume of the lobes. This information can be used effectively in detecting suspicious defect areas. A quasi-linear algorithm is available for constructing the component tree and computing these attributes. In this paper, we modify the original component tree algorithm to be suitable for our defect detection application. First, we exclude pixels that are near the ground level during the initial stage of component tree construction. Next, we detect significant lobes based on multiple attributes and edge information. Our experiments performed with actual SEM wafer images show promising results. For a $1000{\times}1000$ image, the proposed algorithm performed the whole process in 1.36 seconds.

• Journal of applied mathematics & informatics
• /
• v.5 no.2
• /
• pp.427-432
• /
• 1998

When an undirected tree T and a vertex ${\gamma}$ in the tree are given the problem to transform T into a rooted tree with ${\gamma}$ as its root is considered. Using Euler tour and prefix sum an optimal algorithm has been developed [2,3]. We will present another parallel algorithm which is optimal also on EREW PRAM. Our approach resuces the given tree step by step by pruning and pointer jumping. That is the tree structure is retained during algorithm processing such that than other tree computations can be carried out in parallel.

• Proceedings of the KSRS Conference
• /
• 2007.10a
• /
• pp.345-348
• /
• 2007

This research aimed at developing a technique for estimating the tree height using BRF (Bi-directional Reflectance Factor) through the clarification of the relation between shape of the tree crown and the tree height and the relations between the shape of the tree crown and BRF. This paper, reports the results of analyses of data acquired by field measurements done to clarify relation between crown shape and tree height.