• Title/Summary/Keyword: Tree Volume

Search Result 356, Processing Time 0.026 seconds

Bulk Insertion Method for R-tree using Seeded Clustering (R-tree에서 Seeded 클러스터링을 이용한 다량 삽입)

  • 이태원;문봉기;이석호
    • Journal of KIISE:Databases
    • /
    • v.31 no.1
    • /
    • pp.30-38
    • /
    • 2004
  • In many scientific and commercial applications such as Earth Observation System (EOSDIS) and mobile Phone services tracking a large number of clients, it is a daunting task to archive and index ever increasing volume of complex data that are continuously added to databases. To efficiently manage multidimensional data in scientific and data warehousing environments, R-tree based index structures have been widely used. In this paper, we propose a scalable technique called seeded clustering that allows us to maintain R-tree indexes by bulk insertion while keeping pace with high data arrival rates. Our approach uses a seed tree, which is copied from the top k levels of a target R-tree, to classify input data objects into clusters. We then build an R-tree for each of the clusters and insert the input R-trees into the target R-tree in bulk one at a time. We present detailed algorithms for the seeded clustering and bulk insertion as well as the results from our extensive experimental study. The experimental results show that the bulk insertion by seeded clustering outperforms the previously known methods in terms of insertion cost and the quality of target R-trees measured by their query performance.

Study on the Estimate of Stand Volume in the Pitch Pine Forest (임분재적(林分材積) 추정(推定)에 관(關)한 연구(硏究))

  • Lee, Yeo Ha
    • Journal of Korean Society of Forest Science
    • /
    • v.18 no.1
    • /
    • pp.1-7
    • /
    • 1973
  • This survey was estimated under the ratio estimate such as single class method, simple random sampling method, compound ratio sampling method, separate ratio sampling method and average tree sampling method artificial forest pitch pine volume. The following results were realized by the ratio estimates. At the above table simple random sampling method and compound ratio sampling method are the only ones which is included the actual stand volume in the ratio estimatedstand volume. It is thought that the sampling was in a such good result was because of stand structual stands were simple forest. The most simple measurement and calcuation on the stand volume estimates, in order, would be (1) single class method, (2) simple random sampling method (3) average tree method (4) separate ratio sampling method and compound ratio sampling method, and at the planted evenaged forest the method has realized the best results in obtaining good accuracy and the measure stand volume with least time, expenses and labor in considerably.

  • PDF

The Improvement of Radiation Characteristics of Low Density Polyethylene by Addition of Treeing Inhibitors (트리 억제제 첨가에 의한 저밀도 폴리에틸렌의 내방사선성 향상)

  • Kim, Ki-Yup;Lee, Chung;Ryu, Boo-Hyung;Lim, Kee-Joe
    • The Transactions of the Korean Institute of Electrical Engineers C
    • /
    • v.49 no.8
    • /
    • pp.455-461
    • /
    • 2000
  • The inhibiting effects of electrical treeing and insulation properties of LDPE contained with treeing inhibitors was studied under radiation environment. Barbituric acid and its derivatives were selected as treeing inhibitors. The inception voltage and growth of tree, AC breakdown strength, volume resistivity, high frequency capacitance, and dissipation factor were observed as a function of dose(up to 1000 kGy). And also, measurements of thermo-luminescence(TL), and gel content were carried out. Crosslinked low density polyethylene(XLPE) contained with treeing inhibitors shows better insulation characteristics such as electrical tree propagation, AC breakdown strength, and volume resistivity than those of pure LDPE. The most effective treeing inhibitor was found on the barbituric acid contained XLPE.

  • PDF

Impacts of Reforestation on Stabilization of Riverine Water Levels in South Korea

  • JAEHYUN, YOON;SAANG JOON, BAAK;MIN YOUNG, SEO;TAEJONG, KIM
    • KDI Journal of Economic Policy
    • /
    • v.44 no.4
    • /
    • pp.1-24
    • /
    • 2022
  • We investigate how reforestation contributed to stabilization of riverine water levels in South Korea. For the purpose, we estimate an equation capturing dynamic relationships among rainfall, upstream-area tree stock, and downstream water levels in three river systems of Hongcheon, Mangyeong, and Hyeongsan, using daily observations of precipitation and water levels for the period from 1985 to 2005. Simulation based on estimation results shows that increase in the tree stock in a river basin leads to a significantly suppressed peaking in riverine water levels in response to an abrupt and concentrated rain in the upstream area. For instance, an hour-long concentration of 100mm rain results in 0.7m rise in water level if the volume of growing stock is 1 million m3, whereas the rise in water level stays below 0.27m with 5 million m3 in the growing-stock volume.

Point-to-Multipoint Minimum Cost Flow Problem with Convex Cost Function (콘벡스 비용함수를 갖는 점-대-다중점 최소비용 흐름문제)

  • 박구현;신용식
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.25 no.4
    • /
    • pp.15-25
    • /
    • 2000
  • In this paper, we introduce a point-to-multipoint minimum cost flow problem with convex and demand splitting. A source node transmits the traffic along the tree that includes members of the point-to-multipoint connection. The traffic is replicated by the nodes only at branch points of the tree. In order to minimize the sum of arc costs, we assume that the traffic demand can be splitted and transmitted to destination nodes along different trees. If arc cost is linear, the problem would be a Steiner tree problem in networks eve though demand splitting is permitted. The problem would be applied in transmitting large volume of traffic from a serve to clients in Internet environments. Optimality conditions of the problem are presented in terms of fair tree routing. The proposed algorithm is a finite terminating algorithm for $\varepsilon$-optimal solution. convergence of the algorithm is obtained under monotonic condition and strict convexity of the cost function. Computational experiences are included.

  • PDF

Diet Composition of Japanese Tree Frog (Hyla japonica) in a Rice Paddy, South Korea

  • Park, So Hyun;Lee, Hyun;Cho, Kang-Hyun
    • Ecology and Resilient Infrastructure
    • /
    • v.5 no.1
    • /
    • pp.54-58
    • /
    • 2018
  • Diet composition of amphibians usually reflects the distribution of potential prey within habitats, as well as their diet preference. We identified the diet items of Japanese tree frog (Hyla japonica) using a stomach flushing method in a rice paddy for the establishment of bio-monitoring systems of landscape changes. During the reproductive period, 71% of calling males had empty stomachs. All prey items in the stomachs belonged to the phylum Arthropoda, from eight orders of Insecta and one order of Arachnida. Among insect prey, the most common items in the stomachs were adults of beetles, flies and bugs, and larvae of butterflies and moths. There was a significant positive correlation between the body mass of Japanese tree frogs and the volume of prey items. Our results can provide a basic framework to guide the monitoring systems using prey identification of Japanese tree frogs.

Cyber Shopping Mall Customer Segmentation

  • Koh, Bong-Sung;Kim, Yeon-Hyong
    • Journal of the Korean Data and Information Science Society
    • /
    • v.13 no.1
    • /
    • pp.121-127
    • /
    • 2002
  • The volume of electronic commerce based on Internet and network traffic is increasing rapidly. The objective of this study is to examine the current status of the exponentially multiplying cyber-shopping mall phenomenon. To this end, data obtained from a single cyber-shopping mall exemplified customer purchasing behavior and provided decision tree and correspondence analysis derived customer segmentation and merchandise.

  • PDF

Relation between crown-length, tree-height, diameter Clear-bale length and the longest branch length in a Pinus densiflora stand (적송림(赤松林)에 있어서의 성장인자간(成長因子間)의 상관(相關))

  • Yim, Kyong Bin;Pack, Myong Kyu
    • Journal of Korean Society of Forest Science
    • /
    • v.5 no.1
    • /
    • pp.27-32
    • /
    • 1966
  • Taking an opportunity of the application of clearcutting method, 140 red pine (Pinus densiflora Sieb. et Zucc.) trees grown at Chon-nam province, the southern part of South Korea, were fellen and the tree height, clear-bole length, D.B.H. diameter at base(0.2m above from the ground line) and the length of the longest branch were measured. The correlation between factors mentioned were analysed. The results are summarized as follows: 1. The correlation between crown length and tree height (r=0.821) was sinificant. 2. The correlation between the diameter at base and D.B.H. was highly significant (r=0.961). D.B.H. can be calculated from multiplying the diameter at base by 0.88. 3. A weak relation between D.B.H and tree height was abserved. 4. The positive correlation between tree height and clear-bole-length was calculated, but it was not sharp between D.B.H. and the length of the longest branch. 5. The height, basal area, D.B.H. and volume increment by tree class calculated from the data of the stem analysis are presented (Tab. 3~10).

  • PDF

A Study of Multicast Tree Problem with Multiple Constraints (다중 제약이 있는 멀티캐스트 트리 문제에 관한 연구)

  • Lee Sung-Ceun;Han Chi-Ceun
    • Journal of Internet Computing and Services
    • /
    • v.5 no.5
    • /
    • pp.129-138
    • /
    • 2004
  • In the telecommunications network, multicasting is widely used recently. Multicast tree problem is modeled as the NP-complete Steiner problem in the networks. In this paper, we study algorithms for finding efficient multicast trees with hop and node degree constraints. Multimedia service is an application of multicasting and it is required to transfer a large volume of multimedia data with QoS(Quality of Service). Though heuristics for solving the multicast tree problems with one constraint have been studied. however, there is no optimum algorithm that finds an optimum multicast tree with hop and node degree constraints up to now. In this paper, an approach for finding an efficient multicast tree that satisfies hop and node degree constraints is presented and the experimental results explain how the hop and node degree constraints affect to the total cost of a multicast tree.

  • PDF

Fast Visualization of Soft Objects Using Interval Tree (인터벌트리를 이용한 소프트 물체의 빠른 가시화)

  • Min, Gyeong-Ha;Lee, In-Gwon;Park, Chan-Mo
    • Journal of the Korea Computer Graphics Society
    • /
    • v.7 no.1
    • /
    • pp.1-9
    • /
    • 2001
  • We present a scheme and a data structure that decompose the space into adaptive-sized cells to improve the visualization of soft objects. Soft objects are visualized through the evaluation of the field functions at every point of the space. According to the propsed scheme, the affecting soft objects for a point in the space is searched through the data structure called interval tree based on the bounding volume of the components, which represent a soft object whose defining primitive(skeleton) is a simple geometric object such as point or line segment. The bounding volume of each component is generated with respect to the radius of a local field function of the component, threshold value, and the relations between the components and other neighboring components. The proposed scheme can be used in many applications for soft objects such as modeling and rendering, especially in interactive modeling process.

  • PDF