• Title/Summary/Keyword: tree utilization

Search Result 238, Processing Time 0.024 seconds

Local Knowledge on Trees Utilization and Their Existing Threats in Rashad District of Nuba Mountains, Sudan

  • Adam, Yahia Omar
    • Journal of Forest and Environmental Science
    • /
    • v.30 no.4
    • /
    • pp.342-350
    • /
    • 2014
  • Rural people of Sudan are endowed with a deep knowledge concerning the utilization of different tree species. However research on the local knowledge related to tree species utilization still lacks adequate attention. The study objectives were to identify the existing local knowledge related to the utilization of the tree species and the existing threats to the availability of the trees. A total of 300 respondents were selected randomly from Rashad district in Nuba Mountains in 2011. Semi-structured interview, direct observation, group discussion, preference ranking and direct matrix ranking were used to collect the data. The study results revealed that people of Nuba Mountains utilize different tree species for food, medicinal purposes, fodder, firewood, construction and cultural ceremonies. The study results also indicated that the availability of trees is negatively influenced by firewood collection, agricultural expansion, drought, overgrazing and charcoal production. The study concluded that local knowledge has crucial role in tree species utilization in Nuba Mountains. Further researches to document and substantiate the local knowledge on useful tree species are highly recommended.

A Study on the Utilization of the Technology Tree as a Strategic Technology Information Repository - Focused on the Tech-Tree and TRM Integration - (전략기술정보 '레포지터리'로서 기술트리(Tech. Tree)의 활용방안에 관한 연구 - 기술로드맵(TRM)과의 전략적 통합방안을 중심으로 -)

  • Lee, Won-Il
    • Journal of Information Management
    • /
    • v.39 no.3
    • /
    • pp.205-220
    • /
    • 2008
  • This research focused on the major determinants for the strategic utilization of technology tree as a strategic technology information repository after the adoption of the technology tree in the R&D intensive organization. The study was performed based on both theoretical study and qualitative case study approaches. The result is as follows; for the strategic utilization of the technology tree for the information repository, it should be the market base and be closely related with the technology roadmap. In terms of the needs of times, this study regarding the strategic utilization of technology tree as a strategic technology information repository and as a s strategic supplement for technology roadmap is anticipated to be a good reference for the R&D-oriented organizations and technology-related studies in coming years.

Utilization of the Old Big Tree and Its Surrounding Space Pertaining to Cultural Value in Seoul (서울시 보호수를 대상으로 한 노거수 공간의 문화적 활용 가치 연구)

  • Jeong, Wook-Ju;Yoon, Sang-Jun
    • Journal of the Korean Society of Environmental Restoration Technology
    • /
    • v.17 no.1
    • /
    • pp.215-233
    • /
    • 2014
  • Seoul is an ancient city with a long history but there is hesitancy over referring to as a historic city due to the lack of traceable historic urban landscape elements which resulted from numerous invasions and general destruction. From a diachronic perspective, the nature which was survived the influence of development, could be the key element that links the past with the city's radically changed image in modern times. Although "old big trees" may be not a dominant influence with regards to the historical authenticity of the city, they are objects which contribute towards the historical authenticity by providing a sense of place in terms of connected narratives, as well as their natural image. However, the protection policy for an "old big tree" would place too much emphasis on the aspect of the ecological value rather than its cultural value. Generally, trees have been protected by installing a fence and a signboard around them as well as receiving additional care. However, it is difficult to find that surrounding space around the "law-protected tree" is connected with its original historical and cultural values. Even though the space around trees are no longer utilized in the same way as was so in the past, they still have high-potential in terms of cultural utilization. Therefore, the subject of this study is the "old big tree" as a natural object which contributed to the historical authenticity of Seoul. The current status of these "old big trees", aged between 100 and 800 years old, currently indicate that there are 215 trees designated as "law-protected tree" by the Seoul metropolitan government. This study aims to investigate the status of protection and utilization of the existing "law-protected trees" in the city of Seoul and find a way to increase both ecological preservation and cultural utilization for the high-potential "law-protected trees" within the city itself. In order to achieve this, previously researched papers shall be reviewed and surveyed pertaining to present usage patterns of the 215 "law-protected trees". In addition, five cases have been reviewed which focus on a few of utilizing the "protected trees" and their surrounding spaces. The results of the research indicate that 21 "old big trees" have high-potential in terms of cultural utilization as well as ecological value. However, it was revealed that there are limitations to pursue the value of preservation and utilization simultaneously throughout current regimental management. In order to cope with the current situation, it is pointed out that management facilities should be designed and installed by creative and flexible methods of organizing with consideration to the surrounding space and context. Even though in the case where there may not be a connecting history or legendary stories, the "old big trees" can serve as the fundamental features of small scale parks -dependent on their location, condition and environment- which will be of value to the local communities. This study could serve as a practical reference for the management and utilization of "old big trees" nationwide with numbers reaching 12,300 besides the city of Seoul.

Bit-Vector-Based Space Partitioning Indexing Scheme for Improving Node Utilization and Information Retrieval (노드 이용률과 검색 속도 개선을 위한 비트 벡터 기반 공간 분할 색인 기법)

  • Yeo, Myung-Ho;Seong, Dong-Ook;Yoo, Jae-Soo
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.7
    • /
    • pp.799-803
    • /
    • 2010
  • The KDB-tree is a traditional indexing scheme for retrieving multidimensional data. Much research for KDB-tree family frequently addresses the low storage utilization and insufficient retrieval performance as their two bottlenecks. The bottlenecks occur due to a number of unnecessary splits caused by data insertion orders and data skewness. In this paper, we propose a novel index structure, called as $KDB_{CS}^+$-tree, to process skewed data efficiently and improve the retrieval performance. The $KDB_{CS}^+$-tree increases the number of fan-outs by exploiting bit-vectors for representing splitting information and pointer elimination. It also improves the storage utilization by representing entries as a hierarchical structure in each internal node.

Design and implementation of a time-based R-tree for indexing moving objects (이동체의 색인을 위한 시간 기반 R-트리의 설계 및 구현)

  • 전봉기;홍봉희
    • Journal of KIISE:Databases
    • /
    • v.30 no.3
    • /
    • pp.320-335
    • /
    • 2003
  • Location-Based Services(LBS) give rise to location-based queries of which results depend on the locations of moving objects. One of important applications of LBS is to examine tracks of continuously moving objects. Moving objects databases need to provide 3-dimensional indexing for efficiently processing range queries on the movement of continuously changing positions. An extension of the 2-dimensional R-tree to include time dimension shows low space utilization and poor search performance, because of high overlap of index nodes and their dead space. To solve these problems, we propose a new R-tree based indexing technique, namely TR-tree. To increase storage utilization, we assign more entries to the past node by using the unbalanced splitting policy. If two nodes are highly overlapped, these nodes are forcibly merged. It is the forced merging policy that reduces the dead space and the overlap of nodes. Since big line segments can also affect the overlap of index nodes to be increased, big line segments should be clipped by the clipping policy when splitting overfull nodes. The TR-tree outperforms the 3DR-tree and TB-tree in all experiments. Particularly, the storage utilization of the TR-tree is higher than the R-tree and R*-tree.

KDBcs-Tree : An Efficient Cache Conscious KDB-Tree for Multidimentional Data (KDBcs-트리 : 캐시를 고려한 효율적인 KDB-트리)

  • Yeo, Myung-Ho;Min, Young-Soo;Yoo, Jae-Soo
    • Journal of KIISE:Databases
    • /
    • v.34 no.4
    • /
    • pp.328-342
    • /
    • 2007
  • We propose a new cache conscious indexing structure for processing frequently updated data efficiently. Our proposed index structure is based on a KDB-Tree, one of the representative index structures based on space partitioning techniques. In this paper, we propose a data compression technique and a pointer elimination technique to increase the utilization of a cache line. To show our proposed index structure's superiority, we compare our index structure with variants of the CR-tree(e.g. the FF CR-tree and the SE CR-tree) in a variety of environments. As a result, our experimental results show that the proposed index structure achieves about 85%, 97%, and 86% performance improvements over the existing index structures in terms of insertion, update and cache-utilization, respectively.

Real-time traffic service in network with DiffServ (DiffServ 기반 네트워크에서의 실시간 트래픽 서비스)

  • Joung, Jin-No
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.1B
    • /
    • pp.53-60
    • /
    • 2007
  • We investigate the end-to-end delay bounds in large scale networks with Differentiated services (DiffServ) architecture. It is generally understood that networks with DiffServ architectures, where packets are treated according to the class they belong, can guarantee the end-to-end delay for packets of the highest priority class, only in lightly utilized cases. We focus on tree networks, which are defined to be acyclic connected graphs. We obtain a closed formula for delay bounds for such networks. We show that, in tree networks, the delay bounds exist regardless of the level of network utilization. These bounds are quadratically proportional to the maximum hop counts in heavily utilized networks; and are linearly proportional to the maximum hop counts in lightly utilized networks. Considering that tree networks, especially the Ethernet networks are being accepted more and more for access networks as well as provider networks, we argue that based on these delay bounds DiffServ architecture is able to support real time applications even for a large network. Throughout the paper we use Latency-Rate (LR) server model, with which it has proven that FIFO and Strict Priority are LR servers to each flows in certain conditions.

A Study on Spatial-temporal indexing for querying current and past positions (현재와 과거 위치 질의를 위한 시공간 색인에 관한 연구)

  • Jun, Bong-Gi
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.6
    • /
    • pp.1250-1256
    • /
    • 2004
  • The movement of continuously changing positions should be stored and indexed for querying current and past positions. A simple extension of the original R-tree to add time as another dimension, called 3D R-tree, does not handle current position queries and does not address the problem of low space utilization due to high overlap of index nodes. In this paper, 1 propose the dynamic splitting policy for improving the 3D R-tree in order to improve space utilization of split nodes. 1 also extend the original 3D R-tree by introducing a new tagged index structure for being able to query the current and past positions of moving objects. 1 found out that my extension of the original R-tree, called the tagged dynamic 3DR-tree, outperforms both the 3D R-tree and 75-tree when querying current and past position.

Market Segmentation of Patient-Utilization in Oriental Medical Care and Western Medical Care (양.한방 의료서비스 이용환자의 시장 세분화에 관한 연구)

  • 이선희;조희숙;최은영;최귀선;채유미
    • Health Policy and Management
    • /
    • v.12 no.1
    • /
    • pp.125-143
    • /
    • 2002
  • The objectives of this study were analysis of patient\`s characteristics and market segmentation in oriental medical care and western medical care. This study focused on medical utilization using Anderson's health utilization model. The source of data was 1998 National Health and Nutrition Survey which Korean Institute For Health and Social Affairs carried out. A stratified multistage probability sampling design was used in this survey. The analysis was conducted using the statistical software package SPSS version 10.0 and Answer Tree 2.1 which is one of data mining methodology. The results were as follows ; 1) 44.9% of respondents reported visiting oriental medical center within recent two weeks. 3.4% of them used oriental medical care. The group of age, kind of disease and medical expenditure are associated with the difference western and oriental medical utilization rate. 2) There were several factors related to utilization of oriental medical care according to decision tree. Especially, important factors that patient chose his medical center were kinds of disease, kinds of common medical use, and expenditure. 3) in the results of CART analysis, market of oriental medical care were classified by seven categories. The major groups who have a preference for oriental medicine were those musculo-skeletal, cerebra-vascular disease, or chronic headache patients, and they had a preference fur oriental medical care in common use. These results show that oriental and western medical market were divided into various areas by market segmentation.

Fault Tree Construction Method using Function Deployments of Machine Parts (기능 전개를 활용한 기계류 부품의 Fault Tree 구성에 관한 연구)

  • 하성도;이언경;강달모
    • Proceedings of the Korean Reliability Society Conference
    • /
    • 2001.06a
    • /
    • pp.257-263
    • /
    • 2001
  • In the analysis of product reliability, the fault tree is widely used since it shows the interrelations of the faults that lead to the product fault. A top-down approach based on experts’ experience is commonly used in the fault tree construction and the trees often take different forms depending on the intent of the analyst. In this work it is studied how to construct fault trees with the utilization of function trees obtained from analyzing the functions and sub-functions of products in order to suggest a generic way of fault tree construction. The function tree of a product is obtained by analyzing basic functions comprising the product main function in a bottom-up approach so that it enables to construct an objective fault tree. The fault tree for a scroll compressor is shown as an example.

  • PDF